/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/bench-exp2x6.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 18:23:07,773 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 18:23:07,774 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 18:23:07,794 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 18:23:07,799 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 18:23:07,803 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 18:23:07,805 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 18:23:07,806 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 18:23:07,807 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 18:23:07,808 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 18:23:07,809 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 18:23:07,809 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 18:23:07,809 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 18:23:07,810 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 18:23:07,811 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 18:23:07,811 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 18:23:07,812 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 18:23:07,813 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 18:23:07,814 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 18:23:07,818 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 18:23:07,824 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 18:23:07,827 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 18:23:07,829 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 18:23:07,830 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 18:23:07,834 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 18:23:07,834 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 18:23:07,834 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 18:23:07,835 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 18:23:07,835 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 18:23:07,835 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 18:23:07,836 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 18:23:07,836 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 18:23:07,836 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 18:23:07,837 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 18:23:07,837 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 18:23:07,838 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 18:23:07,838 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 18:23:07,838 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 18:23:07,838 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 18:23:07,839 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 18:23:07,839 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 18:23:07,842 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2022-03-15 18:23:07,868 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 18:23:07,868 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 18:23:07,869 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 18:23:07,869 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 18:23:07,869 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 18:23:07,870 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 18:23:07,870 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 18:23:07,870 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 18:23:07,870 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 18:23:07,870 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 18:23:07,870 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 18:23:07,871 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 18:23:07,871 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 18:23:07,871 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 18:23:07,871 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 18:23:07,871 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 18:23:07,871 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 18:23:07,871 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 18:23:07,871 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 18:23:07,871 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 18:23:07,871 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 18:23:07,871 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 18:23:07,871 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 18:23:07,872 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 18:23:07,872 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 18:23:07,872 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 18:23:07,872 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 18:23:07,872 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 18:23:07,872 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 18:23:07,872 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 18:23:07,873 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 18:23:07,873 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 18:23:07,873 INFO L138 SettingsManager]: * Interpolant automaton=MCR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-03-15 18:23:08,040 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 18:23:08,071 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 18:23:08,075 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 18:23:08,075 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 18:23:08,076 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 18:23:08,077 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp2x6.wvr.c [2022-03-15 18:23:08,119 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/743ab10a3/e00ec58d94b64359a20d9bfa192cece8/FLAG41da2f5cb [2022-03-15 18:23:08,468 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 18:23:08,469 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x6.wvr.c [2022-03-15 18:23:08,473 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/743ab10a3/e00ec58d94b64359a20d9bfa192cece8/FLAG41da2f5cb [2022-03-15 18:23:08,892 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/743ab10a3/e00ec58d94b64359a20d9bfa192cece8 [2022-03-15 18:23:08,894 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 18:23:08,895 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 18:23:08,904 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 18:23:08,904 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 18:23:08,907 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 18:23:08,907 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 06:23:08" (1/1) ... [2022-03-15 18:23:08,908 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71f23618 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:23:08, skipping insertion in model container [2022-03-15 18:23:08,908 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 06:23:08" (1/1) ... [2022-03-15 18:23:08,913 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 18:23:08,925 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 18:23:09,150 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x6.wvr.c[2453,2466] [2022-03-15 18:23:09,153 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 18:23:09,157 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 18:23:09,174 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x6.wvr.c[2453,2466] [2022-03-15 18:23:09,175 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 18:23:09,184 INFO L208 MainTranslator]: Completed translation [2022-03-15 18:23:09,184 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:23:09 WrapperNode [2022-03-15 18:23:09,184 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 18:23:09,186 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 18:23:09,186 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 18:23:09,186 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 18:23:09,190 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:23:09" (1/1) ... [2022-03-15 18:23:09,197 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:23:09" (1/1) ... [2022-03-15 18:23:09,212 INFO L137 Inliner]: procedures = 20, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 91 [2022-03-15 18:23:09,212 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 18:23:09,213 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 18:23:09,213 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 18:23:09,213 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 18:23:09,219 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:23:09" (1/1) ... [2022-03-15 18:23:09,219 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:23:09" (1/1) ... [2022-03-15 18:23:09,221 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:23:09" (1/1) ... [2022-03-15 18:23:09,221 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:23:09" (1/1) ... [2022-03-15 18:23:09,229 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:23:09" (1/1) ... [2022-03-15 18:23:09,232 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:23:09" (1/1) ... [2022-03-15 18:23:09,233 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:23:09" (1/1) ... [2022-03-15 18:23:09,234 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 18:23:09,234 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 18:23:09,235 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 18:23:09,235 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 18:23:09,236 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:23:09" (1/1) ... [2022-03-15 18:23:09,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 18:23:09,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:23:09,270 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-15 18:23:09,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-15 18:23:09,316 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 18:23:09,316 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 18:23:09,317 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 18:23:09,317 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 18:23:09,317 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 18:23:09,317 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-03-15 18:23:09,317 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-03-15 18:23:09,317 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-03-15 18:23:09,318 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-03-15 18:23:09,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-15 18:23:09,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 18:23:09,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 18:23:09,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 18:23:09,321 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 18:23:09,321 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-15 18:23:09,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 18:23:09,323 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-15 18:23:09,420 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 18:23:09,421 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 18:23:09,581 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 18:23:09,589 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 18:23:09,589 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-03-15 18:23:09,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 06:23:09 BoogieIcfgContainer [2022-03-15 18:23:09,591 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 18:23:09,592 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 18:23:09,592 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 18:23:09,594 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 18:23:09,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 06:23:08" (1/3) ... [2022-03-15 18:23:09,595 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37d0f78c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 06:23:09, skipping insertion in model container [2022-03-15 18:23:09,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 06:23:09" (2/3) ... [2022-03-15 18:23:09,595 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37d0f78c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 06:23:09, skipping insertion in model container [2022-03-15 18:23:09,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 06:23:09" (3/3) ... [2022-03-15 18:23:09,596 INFO L111 eAbstractionObserver]: Analyzing ICFG bench-exp2x6.wvr.c [2022-03-15 18:23:09,600 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 18:23:09,600 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 18:23:09,601 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 18:23:09,601 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 18:23:09,633 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:23:09,633 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:23:09,633 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:23:09,633 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:23:09,635 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:23:09,635 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:23:09,635 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:23:09,635 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:23:09,637 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:23:09,637 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:23:09,637 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:23:09,637 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:23:09,638 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:23:09,638 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:23:09,639 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:23:09,639 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:23:09,642 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:23:09,642 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:23:09,644 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:23:09,644 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:23:09,645 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:23:09,645 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:23:09,645 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:23:09,645 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 18:23:09,650 INFO L148 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-03-15 18:23:09,682 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 18:23:09,700 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=MCR, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=true, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-15 18:23:09,700 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-03-15 18:23:09,711 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 18:23:09,721 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 140 places, 137 transitions, 306 flow [2022-03-15 18:23:09,727 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 140 places, 137 transitions, 306 flow [2022-03-15 18:23:09,729 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 140 places, 137 transitions, 306 flow [2022-03-15 18:23:09,801 INFO L129 PetriNetUnfolder]: 10/133 cut-off events. [2022-03-15 18:23:09,802 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-03-15 18:23:09,806 INFO L84 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 133 events. 10/133 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 91 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 93. Up to 2 conditions per place. [2022-03-15 18:23:09,810 INFO L116 LiptonReduction]: Number of co-enabled transitions 2160 [2022-03-15 18:23:12,621 INFO L131 LiptonReduction]: Checked pairs total: 2283 [2022-03-15 18:23:12,621 INFO L133 LiptonReduction]: Total number of compositions: 122 [2022-03-15 18:23:12,627 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 39 places, 30 transitions, 92 flow [2022-03-15 18:23:12,665 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 92 states, 91 states have (on average 3.7362637362637363) internal successors, (340), 91 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:23:12,667 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 91 states have (on average 3.7362637362637363) internal successors, (340), 91 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:23:12,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 18:23:12,677 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:23:12,678 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:23:12,678 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 18:23:12,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:23:12,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1900921161, now seen corresponding path program 1 times [2022-03-15 18:23:12,695 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:23:12,695 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670076019] [2022-03-15 18:23:12,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:23:12,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:23:12,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:23:12,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:23:12,976 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:23:12,977 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670076019] [2022-03-15 18:23:12,977 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670076019] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:23:12,977 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:23:12,977 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-03-15 18:23:12,978 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [747064502] [2022-03-15 18:23:12,979 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:23:12,985 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:23:13,010 INFO L252 McrAutomatonBuilder]: Finished intersection with 92 states and 208 transitions. [2022-03-15 18:23:13,010 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:23:15,142 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 18:23:15,143 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 18:23:15,143 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:23:15,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 18:23:15,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 18:23:15,159 INFO L87 Difference]: Start difference. First operand has 92 states, 91 states have (on average 3.7362637362637363) internal successors, (340), 91 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:23:15,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:23:15,222 INFO L93 Difference]: Finished difference Result 181 states and 677 transitions. [2022-03-15 18:23:15,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 18:23:15,224 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 18:23:15,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:23:15,231 INFO L225 Difference]: With dead ends: 181 [2022-03-15 18:23:15,231 INFO L226 Difference]: Without dead ends: 172 [2022-03-15 18:23:15,232 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 3 SyntacticMatches, 67 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 18:23:15,234 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 18:23:15,235 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 18:23:15,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-03-15 18:23:15,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2022-03-15 18:23:15,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 171 states have (on average 3.7953216374269005) internal successors, (649), 171 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:23:15,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 649 transitions. [2022-03-15 18:23:15,268 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 649 transitions. Word has length 21 [2022-03-15 18:23:15,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:23:15,268 INFO L470 AbstractCegarLoop]: Abstraction has 172 states and 649 transitions. [2022-03-15 18:23:15,268 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:23:15,268 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 649 transitions. [2022-03-15 18:23:15,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 18:23:15,270 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:23:15,270 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:23:15,270 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 18:23:15,270 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 18:23:15,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:23:15,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1078790394, now seen corresponding path program 1 times [2022-03-15 18:23:15,272 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:23:15,272 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358785373] [2022-03-15 18:23:15,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:23:15,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:23:15,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:23:15,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:23:15,411 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:23:15,412 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358785373] [2022-03-15 18:23:15,412 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358785373] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:23:15,413 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:23:15,413 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 18:23:15,413 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1604434199] [2022-03-15 18:23:15,413 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:23:15,417 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:23:15,436 INFO L252 McrAutomatonBuilder]: Finished intersection with 122 states and 294 transitions. [2022-03-15 18:23:15,436 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:23:16,571 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [859#(< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)), 863#(or (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod (* 16 ~x4~0) 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)))), 862#(or (< (mod (* 16 ~x4~0) 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)))), 864#(or (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (<= (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296)))), 861#(or (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296))), 860#(< (mod ~x4~0 4294967296) (mod ~n~0 4294967296))] [2022-03-15 18:23:16,572 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 18:23:16,572 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:23:16,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 18:23:16,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-03-15 18:23:16,572 INFO L87 Difference]: Start difference. First operand 172 states and 649 transitions. Second operand has 10 states, 10 states have (on average 7.1) internal successors, (71), 9 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:23:16,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:23:16,881 INFO L93 Difference]: Finished difference Result 278 states and 1039 transitions. [2022-03-15 18:23:16,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 18:23:16,882 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 9 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 18:23:16,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:23:16,886 INFO L225 Difference]: With dead ends: 278 [2022-03-15 18:23:16,887 INFO L226 Difference]: Without dead ends: 268 [2022-03-15 18:23:16,887 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 87 SyntacticMatches, 7 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-03-15 18:23:16,888 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 113 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 18:23:16,889 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 0 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 18:23:16,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2022-03-15 18:23:16,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 224. [2022-03-15 18:23:16,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 223 states have (on average 3.9730941704035874) internal successors, (886), 223 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:23:16,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 886 transitions. [2022-03-15 18:23:16,915 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 886 transitions. Word has length 22 [2022-03-15 18:23:16,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:23:16,915 INFO L470 AbstractCegarLoop]: Abstraction has 224 states and 886 transitions. [2022-03-15 18:23:16,915 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 9 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:23:16,915 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 886 transitions. [2022-03-15 18:23:16,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 18:23:16,917 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:23:16,917 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:23:16,917 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 18:23:16,917 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 18:23:16,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:23:16,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1831903457, now seen corresponding path program 1 times [2022-03-15 18:23:16,920 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:23:16,921 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129320711] [2022-03-15 18:23:16,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:23:16,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:23:16,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:23:17,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:23:17,001 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:23:17,001 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129320711] [2022-03-15 18:23:17,001 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129320711] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:23:17,001 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1585749593] [2022-03-15 18:23:17,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:23:17,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:23:17,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:23:17,003 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:23:17,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-03-15 18:23:17,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:23:17,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 18:23:17,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:23:17,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:23:17,225 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:23:17,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:23:17,295 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1585749593] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:23:17,296 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:23:17,296 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-03-15 18:23:17,296 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [430762124] [2022-03-15 18:23:17,296 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:23:17,298 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:23:17,340 INFO L252 McrAutomatonBuilder]: Finished intersection with 128 states and 314 transitions. [2022-03-15 18:23:17,340 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:23:20,485 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 25 new interpolants: [1730#(< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)), 1738#(and (or (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)) (or (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))) (or (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))) (or (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0))), 1750#(or (< (mod (* 16 ~x3~0) 4294967296) (mod ~n~0 4294967296)) (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)))), 1736#(or (< (mod (* 16 ~x3~0) 4294967296) (mod ~n~0 4294967296)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)))), 1731#(or (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))), 1737#(or (< (mod (* 16 ~x3~0) 4294967296) (mod ~n~0 4294967296)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)))), 1728#(< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)), 1746#(or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))), 1734#(or (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))), 1744#(or (< (mod (* 16 ~x3~0) 4294967296) (mod ~n~0 4294967296)) (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)))), 1735#(or (< (mod (* 16 ~x3~0) 4294967296) (mod ~n~0 4294967296)) (<= (mod ~n~0 4294967296) (mod ~x3~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))), 1742#(or (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296))), 1733#(or (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))), 1747#(or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))), 1739#(< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)), 1749#(or (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))), 1741#(or (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296))), 1740#(or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296))), 1729#(or (< (mod (* 16 ~x3~0) 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)))), 1752#(and (or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)) (or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0)) (or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))) (or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))))), 1732#(or (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296))), 1743#(or (< (mod (* 16 ~x3~0) 4294967296) (mod ~n~0 4294967296)) (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)))), 1748#(or (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))), 1745#(and (or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)) (or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0)) (or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))) (or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))))), 1751#(or (< (mod (* 16 ~x3~0) 4294967296) (mod ~n~0 4294967296)) (<= (mod ~n~0 4294967296) (mod ~x3~0 4294967296)) (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)))] [2022-03-15 18:23:20,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 18:23:20,486 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:23:20,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 18:23:20,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=801, Unknown=0, NotChecked=0, Total=992 [2022-03-15 18:23:20,487 INFO L87 Difference]: Start difference. First operand 224 states and 886 transitions. Second operand has 29 states, 29 states have (on average 5.724137931034483) internal successors, (166), 28 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:23:22,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:23:22,832 INFO L93 Difference]: Finished difference Result 874 states and 3296 transitions. [2022-03-15 18:23:22,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-15 18:23:22,833 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 5.724137931034483) internal successors, (166), 28 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 18:23:22,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:23:22,838 INFO L225 Difference]: With dead ends: 874 [2022-03-15 18:23:22,839 INFO L226 Difference]: Without dead ends: 874 [2022-03-15 18:23:22,839 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 109 SyntacticMatches, 11 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=455, Invalid=1525, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 18:23:22,840 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 592 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 1683 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 592 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-03-15 18:23:22,841 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [592 Valid, 0 Invalid, 1768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1683 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-03-15 18:23:22,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2022-03-15 18:23:22,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 468. [2022-03-15 18:23:22,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 467 states have (on average 4.226980728051392) internal successors, (1974), 467 states have internal predecessors, (1974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:23:22,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 1974 transitions. [2022-03-15 18:23:22,861 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 1974 transitions. Word has length 22 [2022-03-15 18:23:22,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:23:22,861 INFO L470 AbstractCegarLoop]: Abstraction has 468 states and 1974 transitions. [2022-03-15 18:23:22,862 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 5.724137931034483) internal successors, (166), 28 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:23:22,862 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 1974 transitions. [2022-03-15 18:23:22,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 18:23:22,866 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:23:22,866 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:23:22,892 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-03-15 18:23:23,079 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:23:23,080 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 18:23:23,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:23:23,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1073450706, now seen corresponding path program 1 times [2022-03-15 18:23:23,085 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:23:23,085 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460913286] [2022-03-15 18:23:23,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:23:23,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:23:23,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:23:23,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:23:23,145 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:23:23,146 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460913286] [2022-03-15 18:23:23,146 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460913286] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:23:23,146 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:23:23,146 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 18:23:23,146 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [721946794] [2022-03-15 18:23:23,146 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:23:23,149 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:23:23,167 INFO L252 McrAutomatonBuilder]: Finished intersection with 128 states and 314 transitions. [2022-03-15 18:23:23,167 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:23:24,931 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [3594#(< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)), 3598#(or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (<= (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296)) (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296)))), 3593#(< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)), 3597#(or (< (mod (* 16 ~x2~0) 4294967296) (mod ~n~0 4294967296)) (<= (mod ~n~0 4294967296) (mod ~x2~0 4294967296)) (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296))), 3595#(or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))), 3596#(or (not (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))) (< (mod (* 16 ~x2~0) 4294967296) (mod ~n~0 4294967296)))] [2022-03-15 18:23:24,932 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 18:23:24,932 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:23:24,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 18:23:24,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-03-15 18:23:24,933 INFO L87 Difference]: Start difference. First operand 468 states and 1974 transitions. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 9 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:23:25,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:23:25,245 INFO L93 Difference]: Finished difference Result 660 states and 2668 transitions. [2022-03-15 18:23:25,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 18:23:25,245 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 9 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 18:23:25,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:23:25,249 INFO L225 Difference]: With dead ends: 660 [2022-03-15 18:23:25,249 INFO L226 Difference]: Without dead ends: 650 [2022-03-15 18:23:25,249 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-03-15 18:23:25,250 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 89 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 18:23:25,250 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 0 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 18:23:25,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2022-03-15 18:23:25,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 532. [2022-03-15 18:23:25,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 531 states have (on average 4.233521657250471) internal successors, (2248), 531 states have internal predecessors, (2248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:23:25,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 2248 transitions. [2022-03-15 18:23:25,264 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 2248 transitions. Word has length 22 [2022-03-15 18:23:25,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:23:25,264 INFO L470 AbstractCegarLoop]: Abstraction has 532 states and 2248 transitions. [2022-03-15 18:23:25,264 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 9 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:23:25,264 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 2248 transitions. [2022-03-15 18:23:25,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 18:23:25,280 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:23:25,280 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:23:25,280 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-15 18:23:25,280 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 18:23:25,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:23:25,281 INFO L85 PathProgramCache]: Analyzing trace with hash -368533468, now seen corresponding path program 1 times [2022-03-15 18:23:25,282 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:23:25,284 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683262248] [2022-03-15 18:23:25,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:23:25,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:23:25,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:23:25,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:23:25,338 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:23:25,338 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683262248] [2022-03-15 18:23:25,338 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683262248] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 18:23:25,338 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 18:23:25,338 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 18:23:25,338 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [607881672] [2022-03-15 18:23:25,338 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:23:25,342 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:23:25,358 INFO L252 McrAutomatonBuilder]: Finished intersection with 122 states and 294 transitions. [2022-03-15 18:23:25,358 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:23:26,684 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [5331#(< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)), 5332#(< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)), 5334#(or (< (mod (* 16 ~x1~0) 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)))), 5333#(or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))), 5335#(or (< (mod (* 16 ~x1~0) 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296))))] [2022-03-15 18:23:26,685 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 18:23:26,685 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:23:26,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 18:23:26,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-03-15 18:23:26,686 INFO L87 Difference]: Start difference. First operand 532 states and 2248 transitions. Second operand has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:23:26,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 18:23:26,951 INFO L93 Difference]: Finished difference Result 674 states and 2712 transitions. [2022-03-15 18:23:26,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 18:23:26,952 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 18:23:26,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 18:23:26,955 INFO L225 Difference]: With dead ends: 674 [2022-03-15 18:23:26,956 INFO L226 Difference]: Without dead ends: 668 [2022-03-15 18:23:26,956 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 86 SyntacticMatches, 9 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-03-15 18:23:26,956 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 96 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 18:23:26,957 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 0 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 18:23:26,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2022-03-15 18:23:26,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 562. [2022-03-15 18:23:26,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 561 states have (on average 4.185383244206774) internal successors, (2348), 561 states have internal predecessors, (2348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:23:26,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 2348 transitions. [2022-03-15 18:23:26,970 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 2348 transitions. Word has length 22 [2022-03-15 18:23:26,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 18:23:26,971 INFO L470 AbstractCegarLoop]: Abstraction has 562 states and 2348 transitions. [2022-03-15 18:23:26,971 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:23:26,971 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 2348 transitions. [2022-03-15 18:23:26,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 18:23:26,972 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 18:23:26,973 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 18:23:26,973 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-15 18:23:26,973 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-03-15 18:23:26,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 18:23:26,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1325344228, now seen corresponding path program 1 times [2022-03-15 18:23:26,974 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 18:23:26,974 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855624631] [2022-03-15 18:23:26,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:23:26,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 18:23:27,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:23:27,215 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:23:27,215 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 18:23:27,216 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855624631] [2022-03-15 18:23:27,216 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855624631] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 18:23:27,216 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350538706] [2022-03-15 18:23:27,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 18:23:27,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 18:23:27,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 18:23:27,225 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 18:23:27,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-03-15 18:23:28,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 18:23:28,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 18:23:28,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 18:23:53,866 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:23:53,867 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 18:24:18,734 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 18:24:18,735 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [350538706] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 18:24:18,735 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 18:24:18,735 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-03-15 18:24:18,735 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [726508746] [2022-03-15 18:24:18,735 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 18:24:18,738 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 18:24:18,773 INFO L252 McrAutomatonBuilder]: Finished intersection with 172 states and 448 transitions. [2022-03-15 18:24:18,774 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 18:27:55,771 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 51 new interpolants: [7295#(and (or (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296) 1))) (or (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (= (+ (* (- 1) ~x2~0) ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 0)) (or (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (<= (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296))))), 7319#(and (or (< (mod (* 16 ~x3~0) 4294967296) (mod ~n~0 4294967296)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))) (= (+ (* (- 1) ~x2~0) ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 0)) (or (< (mod (* 16 ~x3~0) 4294967296) (mod ~n~0 4294967296)) (< (+ ~x4~0 (* (div (* 16 ~x3~0) 4294967296) 4294967296)) (+ (* 16 ~x3~0) (* (div ~x4~0 4294967296) 4294967296) 1)) (not (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)))) (or (<= (+ (* 16 ~x3~0) (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div (* 16 ~x3~0) 4294967296) 4294967296))) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))))), 7327#(and (or (< (mod (* 16 ~x3~0) 4294967296) (mod ~n~0 4294967296)) (< (+ ~x4~0 (* (div (* 16 ~x3~0) 4294967296) 4294967296)) (+ (* 16 ~x3~0) (* (div ~x4~0 4294967296) 4294967296) 1)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)))) (or (< (mod (* 16 ~x3~0) 4294967296) (mod ~n~0 4294967296)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))) (= (+ (* (- 1) ~x2~0) ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 0)) (or (<= (+ (* 16 ~x3~0) (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div (* 16 ~x3~0) 4294967296) 4294967296))) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))))), 7328#(and (or (< (mod (* 16 ~x3~0) 4294967296) (mod ~n~0 4294967296)) (< (+ ~x4~0 (* (div (* 16 ~x3~0) 4294967296) 4294967296)) (+ (* 16 ~x3~0) (* (div ~x4~0 4294967296) 4294967296) 1)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)))) (or (< (mod (* 16 ~x3~0) 4294967296) (mod ~n~0 4294967296)) (not (<= (+ (* 16 ~x3~0) (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div (* 16 ~x3~0) 4294967296) 4294967296)))) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))) (= (+ (* (- 1) ~x2~0) ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 0)) (or (< (mod (* 16 ~x3~0) 4294967296) (mod ~n~0 4294967296)) (<= (+ 3 ~x4~0 (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))) (<= (+ (* 16 ~x3~0) (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div (* 16 ~x3~0) 4294967296) 4294967296))) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))))), 7299#(and (or (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296) 1))) (or (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (= (+ (* (- 1) ~x2~0) ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 0)) (or (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (<= (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296))))), 7323#(and (or (< (mod (* 16 ~x3~0) 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))) (= (+ (* (- 1) ~x2~0) ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 0)) (or (< (mod (* 16 ~x3~0) 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))) (<= (+ (* (div (+ 268435456 (* (- 1) ~x4~0) (* 268435456 (div (* 16 ~x3~0) 4294967296)) (* (div ~x4~0 4294967296) 4294967296)) 268435456) 4294967296) (* 16 ~x4~0)) (+ (* 16 ~x3~0) (* (div ~x4~0 4294967296) 68719476736)))) (or (<= (+ (* (div (+ 4294967295 (* (- 16) ~x4~0) (* 16 ~x3~0) (* (div ~x4~0 4294967296) 68719476736)) 4294967296) 4294967296) (* 16 ~x4~0) (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 (* (div (* 16 ~x3~0) 4294967296) 4294967296) (* (div ~x4~0 4294967296) 68719476736) 4294967293)) (not (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))))), 7309#(and (or (<= (+ (* (div (+ 4294967295 (* (- 16) ~x4~0) ~x3~0 (* (div ~x4~0 4294967296) 68719476736)) 4294967296) 4294967296) (* 16 ~x4~0) (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296) (* (div ~x4~0 4294967296) 68719476736) 4294967293)) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))) (or (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (= (+ (* (- 1) ~x2~0) ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 0)) (or (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (<= (+ (* (div (+ 268435456 (* (- 1) ~x4~0) (* 268435456 (div ~x3~0 4294967296)) (* (div ~x4~0 4294967296) 4294967296)) 268435456) 4294967296) (* 16 ~x4~0)) (+ ~x3~0 (* (div ~x4~0 4294967296) 68719476736))))), 7331#(and (or (<= (+ (* 73014444032 (div ~x3~0 4294967296)) (* 16 ~x4~0) 1) (+ (* ~x3~0 17) (* (div ~x4~0 4294967296) 68719476736))) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))) (or (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (<= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)))) (or (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))) (or (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (<= (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296))))), 7307#(and (or (< (mod (* 16 ~x4~0) 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296))) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< (+ (* (div ~x3~0 4294967296) 4294967296) (* 16 ~x4~0)) (+ ~x3~0 (* (div (* 16 ~x4~0) 4294967296) 4294967296) 1))) (or (< (mod (* 16 ~x4~0) 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296))) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (= (+ (* (- 1) ~x2~0) ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 0)) (or (< (mod (* 16 ~x4~0) 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296))) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (<= (+ ~x3~0 (* (div (* 16 ~x4~0) 4294967296) 4294967296)) (+ (* (div ~x3~0 4294967296) 4294967296) (* 16 ~x4~0))))), 7300#(and (or (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296) 1))) (or (<= (+ 3 ~x4~0 (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (<= (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)))) (or (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (not (<= (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)))) (= (+ (* (- 1) ~x2~0) ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 0))), 7292#(and (or (< (mod (* 16 ~x4~0) 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296))) (= (+ (* (- 1) ~x2~0) ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 0)) (or (< (mod (* 16 ~x4~0) 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296))) (<= (+ ~x3~0 (* (div (* 16 ~x4~0) 4294967296) 4294967296)) (+ (* (div ~x3~0 4294967296) 4294967296) (* 16 ~x4~0)))) (or (< (mod (* 16 ~x4~0) 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296))) (< (+ (* (div ~x3~0 4294967296) 4294967296) (* 16 ~x4~0)) (+ ~x3~0 (* (div (* 16 ~x4~0) 4294967296) 4294967296) 1)))), 7303#(and (or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296) 1))) (or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (<= (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)))) (or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (= (+ (* (- 1) ~x2~0) ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 0))), 7308#(and (or (<= (+ (* (div (+ 268435456 (* (- 1) ~x4~0) (* 268435456 (div ~x3~0 4294967296)) (* (div ~x4~0 4294967296) 4294967296)) 268435456) 4294967296) (* 16 ~x4~0)) (+ ~x3~0 (* (div ~x4~0 4294967296) 68719476736))) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))) (or (<= (+ (* (div (+ 4294967295 (* (- 16) ~x4~0) ~x3~0 (* (div ~x4~0 4294967296) 68719476736)) 4294967296) 4294967296) (* 16 ~x4~0) (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296) (* (div ~x4~0 4294967296) 68719476736) 4294967293)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))) (or (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (= (+ (* (- 1) ~x2~0) ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 0))), 7297#(and (or (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (not (<= (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)))) (= (+ (* (- 1) ~x2~0) ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 0)) (or (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296) 1))) (or (<= (+ 3 ~x4~0 (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (<= (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296))))), 7306#(and (or (<= (+ 3 ~x4~0 (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (<= (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)))) (or (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296) 1))) (or (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (not (<= (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)))) (= (+ (* (- 1) ~x2~0) ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 0))), 7298#(and (or (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296) 1))) (or (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (= (+ (* (- 1) ~x2~0) ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 0)) (or (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (<= (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296))))), 7311#(and (or (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (= (+ (* (- 1) ~x2~0) ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 0)) (or (<= (+ (* (div (+ 4294967295 (* (- 16) ~x4~0) ~x3~0 (* (div ~x4~0 4294967296) 68719476736)) 4294967296) 4294967296) (* 16 ~x4~0) (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296) (* (div ~x4~0 4294967296) 68719476736) 4294967293)) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))) (or (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (<= (+ (* (div (+ 268435456 (* (- 1) ~x4~0) (* 268435456 (div ~x3~0 4294967296)) (* (div ~x4~0 4294967296) 4294967296)) 268435456) 4294967296) (* 16 ~x4~0)) (+ ~x3~0 (* (div ~x4~0 4294967296) 68719476736))) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)))), 7321#(and (or (< (mod (* 16 ~x3~0) 4294967296) (mod ~n~0 4294967296)) (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (+ ~x4~0 (* (div (* 16 ~x3~0) 4294967296) 4294967296)) (+ (* 16 ~x3~0) (* (div ~x4~0 4294967296) 4294967296) 1)) (not (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)))) (or (< (mod (* 16 ~x3~0) 4294967296) (mod ~n~0 4294967296)) (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))) (= (+ (* (- 1) ~x2~0) ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 0)) (or (< (mod (* 16 ~x3~0) 4294967296) (mod ~n~0 4294967296)) (<= (+ 3 ~x4~0 (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))) (<= (+ (* 16 ~x3~0) (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div (* 16 ~x3~0) 4294967296) 4294967296))) (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))))), 7291#(and (or (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296) 1))) (or (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (<= (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)))) (or (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (= (+ (* (- 1) ~x2~0) ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 0))), 7329#(and (or (< (mod (* 16 ~x3~0) 4294967296) (mod ~n~0 4294967296)) (< (mod (* 16 ~x4~0) 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296))) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))) (= (+ (* (- 1) ~x2~0) ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 0)) (or (< (mod (* 16 ~x3~0) 4294967296) (mod ~n~0 4294967296)) (< (+ (* (div (* 16 ~x3~0) 4294967296) 4294967296) (* 16 ~x4~0)) (+ (* 16 ~x3~0) (* (div (* 16 ~x4~0) 4294967296) 4294967296) 1)) (not (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296))) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)))) (or (< (mod (* 16 ~x4~0) 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296))) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))) (<= (+ (* 16 ~x3~0) (* (div (* 16 ~x4~0) 4294967296) 4294967296)) (+ (* (div (* 16 ~x3~0) 4294967296) 4294967296) (* 16 ~x4~0))))), 7296#(and (or (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (<= (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)))) (or (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (= (+ (* (- 1) ~x2~0) ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 0)) (or (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296) 1)))), 7335#(and (or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (<= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)))) (or (<= (+ (* 73014444032 (div ~x3~0 4294967296)) (* 16 ~x4~0) 1) (+ (* ~x3~0 17) (* (div ~x4~0 4294967296) 68719476736))) (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))) (or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (<= (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)))) (or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))))), 7330#(and (or (< (mod (* 16 ~x3~0) 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))) (<= (+ (* (div (+ 268435456 (* (- 1) ~x4~0) (* 268435456 (div (* 16 ~x3~0) 4294967296)) (* (div ~x4~0 4294967296) 4294967296)) 268435456) 4294967296) (* 16 ~x4~0)) (+ (* 16 ~x3~0) (* (div ~x4~0 4294967296) 68719476736)))) (or (<= (+ (* (div (+ 4294967295 (* (- 16) ~x4~0) (* 16 ~x3~0) (* (div ~x4~0 4294967296) 68719476736)) 4294967296) 4294967296) (* 16 ~x4~0) (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 (* (div (* 16 ~x3~0) 4294967296) 4294967296) (* (div ~x4~0 4294967296) 68719476736) 4294967293)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)))) (or (< (mod (* 16 ~x3~0) 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))) (= (+ (* (- 1) ~x2~0) ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 0))), 7290#(and (or (< (mod (* 16 ~x3~0) 4294967296) (mod ~n~0 4294967296)) (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (+ ~x4~0 (* (div (* 16 ~x3~0) 4294967296) 4294967296)) (+ (* 16 ~x3~0) (* (div ~x4~0 4294967296) 4294967296) 1)) (not (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)))) (or (< (mod (* 16 ~x3~0) 4294967296) (mod ~n~0 4294967296)) (<= (+ (* 16 ~x3~0) (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div (* 16 ~x3~0) 4294967296) 4294967296))) (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)))) (or (< (mod (* 16 ~x3~0) 4294967296) (mod ~n~0 4294967296)) (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))) (= (+ (* (- 1) ~x2~0) ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 0))), 7317#(and (or (<= (+ (* (div (+ 4294967295 (* (- 16) ~x4~0) ~x3~0 (* (div ~x4~0 4294967296) 68719476736)) 4294967296) 4294967296) (* 16 ~x4~0) (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296) (* (div ~x4~0 4294967296) 68719476736) 4294967293)) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))) (or (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (<= (+ (* (div (+ 268435456 (* (- 1) ~x4~0) (* 268435456 (div ~x3~0 4294967296)) (* (div ~x4~0 4294967296) 4294967296)) 268435456) 4294967296) (* 16 ~x4~0)) (+ ~x3~0 (* (div ~x4~0 4294967296) 68719476736))) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))) (or (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (= (+ (* (- 1) ~x2~0) ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 0))), 7305#(and (or (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (<= (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)))) (or (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (= (+ (* (- 1) ~x2~0) ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 0)) (or (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296) 1)))), 7324#(and (or (< (mod (* 16 ~x3~0) 4294967296) (mod ~n~0 4294967296)) (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))) (<= (+ (* (div (+ 268435456 (* (- 1) ~x4~0) (* 268435456 (div (* 16 ~x3~0) 4294967296)) (* (div ~x4~0 4294967296) 4294967296)) 268435456) 4294967296) (* 16 ~x4~0)) (+ (* 16 ~x3~0) (* (div ~x4~0 4294967296) 68719476736)))) (or (< (mod (* 16 ~x3~0) 4294967296) (mod ~n~0 4294967296)) (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))) (= (+ (* (- 1) ~x2~0) ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 0)) (or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (<= (+ (* (div (+ 4294967295 (* (- 16) ~x4~0) (* 16 ~x3~0) (* (div ~x4~0 4294967296) 68719476736)) 4294967296) 4294967296) (* 16 ~x4~0) (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 (* (div (* 16 ~x3~0) 4294967296) 4294967296) (* (div ~x4~0 4294967296) 68719476736) 4294967293)) (not (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))))), 7286#(and (or (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296) 1))) (or (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (= (+ (* (- 1) ~x2~0) ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 0)) (or (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (<= (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296))))), 7332#(and (or (< (mod (* 16 ~x3~0) 4294967296) (mod ~n~0 4294967296)) (<= (+ (* 16 ~x3~0) (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div (* 16 ~x3~0) 4294967296) 4294967296))) (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)))) (or (< (mod (* 16 ~x3~0) 4294967296) (mod ~n~0 4294967296)) (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (+ ~x4~0 (* (div (* 16 ~x3~0) 4294967296) 4294967296)) (+ (* 16 ~x3~0) (* (div ~x4~0 4294967296) 4294967296) 1)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)))) (or (< (mod (* 16 ~x3~0) 4294967296) (mod ~n~0 4294967296)) (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))) (= (+ (* (- 1) ~x2~0) ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 0))), 7315#(and (or (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (= (+ (* (- 1) ~x2~0) ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 0)) (or (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (<= (+ (* (div (+ 268435456 (* (- 1) ~x4~0) (* 268435456 (div ~x3~0 4294967296)) (* (div ~x4~0 4294967296) 4294967296)) 268435456) 4294967296) (* 16 ~x4~0)) (+ ~x3~0 (* (div ~x4~0 4294967296) 68719476736)))) (or (<= (+ (* (div (+ 4294967295 (* (- 16) ~x4~0) ~x3~0 (* (div ~x4~0 4294967296) 68719476736)) 4294967296) 4294967296) (* 16 ~x4~0) (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296) (* (div ~x4~0 4294967296) 68719476736) 4294967293)) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)))), 7240#(or (and (< (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296) 1)) (= (+ (* (- 1) ~x2~0) ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 0) (<= (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)))) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296))), 7288#(and (or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (= (+ (* (- 1) ~x2~0) ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 0)) (or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (<= (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)))) (or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296) 1)))), 7287#(and (or (< (mod (* 16 ~x3~0) 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))) (= (+ (* (- 1) ~x2~0) ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 0)) (or (< (mod (* 16 ~x3~0) 4294967296) (mod ~n~0 4294967296)) (< (+ ~x4~0 (* (div (* 16 ~x3~0) 4294967296) 4294967296)) (+ (* 16 ~x3~0) (* (div ~x4~0 4294967296) 4294967296) 1)) (not (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)))) (or (< (mod (* 16 ~x3~0) 4294967296) (mod ~n~0 4294967296)) (<= (+ (* 16 ~x3~0) (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div (* 16 ~x3~0) 4294967296) 4294967296))) (not (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))))), 7304#(and (or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296) 1))) (or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (not (<= (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)))) (= (+ (* (- 1) ~x2~0) ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 0)) (or (<= (+ 3 ~x4~0 (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))) (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (<= (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296))))), 7293#(and (or (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296))) (< (+ (* (div ~x3~0 4294967296) 4294967296) (* 16 ~x4~0)) (+ ~x3~0 (* (div (* 16 ~x4~0) 4294967296) 4294967296) 1))) (or (< (mod (* 16 ~x4~0) 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296))) (<= (+ ~x3~0 (* (div (* 16 ~x4~0) 4294967296) 4294967296)) (+ (* (div ~x3~0 4294967296) 4294967296) (* 16 ~x4~0)))) (or (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod (* 16 ~x4~0) 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296))) (= (+ (* (- 1) ~x2~0) ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 0))), 7326#(and (or (< (mod (* 16 ~x3~0) 4294967296) (mod ~n~0 4294967296)) (< (+ ~x4~0 (* (div (* 16 ~x3~0) 4294967296) 4294967296)) (+ (* 16 ~x3~0) (* (div ~x4~0 4294967296) 4294967296) 1)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)))) (or (< (mod (* 16 ~x3~0) 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))) (= (+ (* (- 1) ~x2~0) ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 0)) (or (< (mod (* 16 ~x3~0) 4294967296) (mod ~n~0 4294967296)) (<= (+ (* 16 ~x3~0) (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div (* 16 ~x3~0) 4294967296) 4294967296))) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))))), 7310#(and (or (< (mod (* 16 ~x4~0) 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296))) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (<= (+ ~x3~0 (* (div (* 16 ~x4~0) 4294967296) 4294967296)) (+ (* (div ~x3~0 4294967296) 4294967296) (* 16 ~x4~0)))) (or (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod (* 16 ~x4~0) 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296))) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (= (+ (* (- 1) ~x2~0) ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 0)) (or (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296))) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< (+ (* (div ~x3~0 4294967296) 4294967296) (* 16 ~x4~0)) (+ ~x3~0 (* (div (* 16 ~x4~0) 4294967296) 4294967296) 1)))), 7322#(and (or (< (mod (* 16 ~x4~0) 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296))) (not (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))) (<= (+ (* 16 ~x3~0) (* (div (* 16 ~x4~0) 4294967296) 4294967296)) (+ (* (div (* 16 ~x3~0) 4294967296) 4294967296) (* 16 ~x4~0)))) (or (< (mod (* 16 ~x3~0) 4294967296) (mod ~n~0 4294967296)) (< (+ (* (div (* 16 ~x3~0) 4294967296) 4294967296) (* 16 ~x4~0)) (+ (* 16 ~x3~0) (* (div (* 16 ~x4~0) 4294967296) 4294967296) 1)) (not (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296))) (not (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)))) (or (< (mod (* 16 ~x3~0) 4294967296) (mod ~n~0 4294967296)) (< (mod (* 16 ~x4~0) 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296))) (not (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))) (= (+ (* (- 1) ~x2~0) ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 0))), 7318#(and (or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (<= (+ 2 (* (div (+ 4294967295 (* (- 16) ~x4~0) ~x3~0 (* (div ~x4~0 4294967296) 68719476736)) 4294967296) 4294967296) (* 16 ~x4~0) (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 ~x3~0 (* (div ~x4~0 4294967296) 68719476736)))) (or (<= (+ (* (div (+ (* (- 1) ~n~0) (* (div ~x3~0 4294967296) (- 268435456)) ~x3~0 (* (- 15) ~x4~0) 4294967296 (* (div ~n~0 4294967296) 4294967296) (* (div ~x4~0 4294967296) 64424509440)) 4026531840) 4294967296) (* 16 ~x4~0)) (+ ~x3~0 (* (div ~x4~0 4294967296) 68719476736))) (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (<= (+ (* (div (+ 268435456 (* (- 1) ~x4~0) (* 268435456 (div ~x3~0 4294967296)) (* (div ~x4~0 4294967296) 4294967296)) 268435456) 4294967296) (* 16 ~x4~0)) (+ ~x3~0 (* (div ~x4~0 4294967296) 68719476736))) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))) (or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (= (+ (* (- 1) ~x2~0) ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 0))), 7302#(and (or (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (not (<= (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)))) (= (+ (* (- 1) ~x2~0) ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 0)) (or (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296) 1))) (or (<= (+ 3 ~x4~0 (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (<= (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296))))), 7294#(and (or (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296) 1))) (or (<= (+ 3 ~x4~0 (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (<= (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)))) (or (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (not (<= (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)))) (= (+ (* (- 1) ~x2~0) ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 0))), 7316#(and (or (<= (+ (* (div (+ (* (- 1) ~n~0) (* (div ~x3~0 4294967296) (- 268435456)) ~x3~0 (* (- 15) ~x4~0) 4294967296 (* (div ~n~0 4294967296) 4294967296) (* (div ~x4~0 4294967296) 64424509440)) 4026531840) 4294967296) (* 16 ~x4~0)) (+ ~x3~0 (* (div ~x4~0 4294967296) 68719476736))) (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (<= (+ (* (div (+ 268435456 (* (- 1) ~x4~0) (* 268435456 (div ~x3~0 4294967296)) (* (div ~x4~0 4294967296) 4294967296)) 268435456) 4294967296) (* 16 ~x4~0)) (+ ~x3~0 (* (div ~x4~0 4294967296) 68719476736)))) (or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (= (+ (* (- 1) ~x2~0) ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 0)) (or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (<= (+ 2 (* (div (+ 4294967295 (* (- 16) ~x4~0) ~x3~0 (* (div ~x4~0 4294967296) 68719476736)) 4294967296) 4294967296) (* 16 ~x4~0) (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 ~x3~0 (* (div ~x4~0 4294967296) 68719476736))))), 7314#(and (or (<= (+ (* (div (+ 4294967295 (* (- 16) ~x4~0) ~x3~0 (* (div ~x4~0 4294967296) 68719476736)) 4294967296) 4294967296) (* 16 ~x4~0) (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296) (* (div ~x4~0 4294967296) 68719476736) 4294967293)) (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))) (or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (<= (+ (* (div (+ 268435456 (* (- 1) ~x4~0) (* 268435456 (div ~x3~0 4294967296)) (* (div ~x4~0 4294967296) 4294967296)) 268435456) 4294967296) (* 16 ~x4~0)) (+ ~x3~0 (* (div ~x4~0 4294967296) 68719476736))) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))) (or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (= (+ (* (- 1) ~x2~0) ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 0))), 7301#(and (or (<= (+ 3 ~x4~0 (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))) (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (<= (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)))) (or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296) 1))) (or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (not (<= (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)))) (= (+ (* (- 1) ~x2~0) ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 0))), 7289#(and (or (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (= (+ (* (- 1) ~x2~0) ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 0)) (or (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296) 1))) (or (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (<= (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296))))), 7312#(and (or (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (<= (+ 2 (* (div (+ 4294967295 (* (- 16) ~x4~0) ~x3~0 (* (div ~x4~0 4294967296) 68719476736)) 4294967296) 4294967296) (* 16 ~x4~0) (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 ~x3~0 (* (div ~x4~0 4294967296) 68719476736)))) (or (<= (+ (* (div (+ (* (- 1) ~n~0) (* (div ~x3~0 4294967296) (- 268435456)) ~x3~0 (* (- 15) ~x4~0) 4294967296 (* (div ~n~0 4294967296) 4294967296) (* (div ~x4~0 4294967296) 64424509440)) 4026531840) 4294967296) (* 16 ~x4~0)) (+ ~x3~0 (* (div ~x4~0 4294967296) 68719476736))) (<= (+ (* (div (+ 268435456 (* (- 1) ~x4~0) (* 268435456 (div ~x3~0 4294967296)) (* (div ~x4~0 4294967296) 4294967296)) 268435456) 4294967296) (* 16 ~x4~0)) (+ ~x3~0 (* (div ~x4~0 4294967296) 68719476736))) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))) (or (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (= (+ (* (- 1) ~x2~0) ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 0))), 7333#(and (or (< (mod (* 16 ~x3~0) 4294967296) (mod ~n~0 4294967296)) (<= (+ 3 ~x4~0 (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))) (<= (+ (* 16 ~x3~0) (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div (* 16 ~x3~0) 4294967296) 4294967296))) (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)))) (or (< (mod (* 16 ~x3~0) 4294967296) (mod ~n~0 4294967296)) (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (+ ~x4~0 (* (div (* 16 ~x3~0) 4294967296) 4294967296)) (+ (* 16 ~x3~0) (* (div ~x4~0 4294967296) 4294967296) 1)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)))) (or (< (mod (* 16 ~x3~0) 4294967296) (mod ~n~0 4294967296)) (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))) (= (+ (* (- 1) ~x2~0) ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 0))), 7334#(and (or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (<= (+ (* (div (+ 4294967295 (* (- 16) ~x4~0) (* 16 ~x3~0) (* (div ~x4~0 4294967296) 68719476736)) 4294967296) 4294967296) (* 16 ~x4~0) (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 (* (div (* 16 ~x3~0) 4294967296) 4294967296) (* (div ~x4~0 4294967296) 68719476736) 4294967293)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)))) (or (< (mod (* 16 ~x3~0) 4294967296) (mod ~n~0 4294967296)) (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))) (= (+ (* (- 1) ~x2~0) ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 0)) (or (< (mod (* 16 ~x3~0) 4294967296) (mod ~n~0 4294967296)) (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (not (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))) (<= (+ (* (div (+ 268435456 (* (- 1) ~x4~0) (* 268435456 (div (* 16 ~x3~0) 4294967296)) (* (div ~x4~0 4294967296) 4294967296)) 268435456) 4294967296) (* 16 ~x4~0)) (+ (* 16 ~x3~0) (* (div ~x4~0 4294967296) 68719476736))))), 7313#(and (or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (<= (+ (* (div (+ 268435456 (* (- 1) ~x4~0) (* 268435456 (div ~x3~0 4294967296)) (* (div ~x4~0 4294967296) 4294967296)) 268435456) 4294967296) (* 16 ~x4~0)) (+ ~x3~0 (* (div ~x4~0 4294967296) 68719476736)))) (or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (= (+ (* (- 1) ~x2~0) ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 0)) (or (<= (+ (* (div (+ 4294967295 (* (- 16) ~x4~0) ~x3~0 (* (div ~x4~0 4294967296) 68719476736)) 4294967296) 4294967296) (* 16 ~x4~0) (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 (* (div ~x3~0 4294967296) 4294967296) (* (div ~x4~0 4294967296) 68719476736) 4294967293)) (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)))), 7320#(and (or (< (mod (* 16 ~x3~0) 4294967296) (mod ~n~0 4294967296)) (not (<= (+ (* 16 ~x3~0) (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div (* 16 ~x3~0) 4294967296) 4294967296)))) (not (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))) (= (+ (* (- 1) ~x2~0) ~x1~0 (* (div ~x1~0 4294967296) (- 4294967296)) (* (div ~x2~0 4294967296) 4294967296)) 0)) (or (< (mod (* 16 ~x3~0) 4294967296) (mod ~n~0 4294967296)) (< (+ ~x4~0 (* (div (* 16 ~x3~0) 4294967296) 4294967296)) (+ (* 16 ~x3~0) (* (div ~x4~0 4294967296) 4294967296) 1)) (not (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296)))) (or (< (mod (* 16 ~x3~0) 4294967296) (mod ~n~0 4294967296)) (<= (+ 3 ~x4~0 (* (div ~n~0 4294967296) 4294967296)) (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296))) (<= (+ (* 16 ~x3~0) (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div (* 16 ~x3~0) 4294967296) 4294967296))) (not (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))))), 7325#(and (or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))) (or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (<= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)))) (or (<= (+ (* 73014444032 (div ~x3~0 4294967296)) (* 16 ~x4~0) 1) (+ (* ~x3~0 17) (* (div ~x4~0 4294967296) 68719476736))) (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296))) (or (< (mod ~x1~0 4294967296) (mod ~n~0 4294967296)) (<= (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)))))] [2022-03-15 18:27:55,772 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-03-15 18:27:55,772 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 18:27:55,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-03-15 18:27:55,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=554, Invalid=3678, Unknown=58, NotChecked=0, Total=4290 [2022-03-15 18:27:55,774 INFO L87 Difference]: Start difference. First operand 562 states and 2348 transitions. Second operand has 58 states, 57 states have (on average 4.631578947368421) internal successors, (264), 57 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 18:27:57,150 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:28:37,070 WARN L228 SmtUtils]: Spent 38.69s on a formula simplification. DAG size of input: 125 DAG size of output: 90 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 18:28:39,445 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:28:47,370 WARN L228 SmtUtils]: Spent 5.74s on a formula simplification. DAG size of input: 107 DAG size of output: 58 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 18:28:49,421 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:28:51,124 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:28:53,136 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:29:34,667 WARN L228 SmtUtils]: Spent 40.88s on a formula simplification. DAG size of input: 140 DAG size of output: 91 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 18:29:36,832 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:29:39,844 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:29:41,953 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-03-15 18:29:43,835 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:29:51,928 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:29:58,421 WARN L228 SmtUtils]: Spent 6.30s on a formula simplification. DAG size of input: 107 DAG size of output: 58 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 18:30:00,056 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-03-15 18:30:03,692 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:30:05,950 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse10 (div c_~x3~0 4294967296)) (.cse12 (div c_~x4~0 4294967296))) (let ((.cse2 (* .cse12 4294967296)) (.cse16 (div c_~x1~0 4294967296)) (.cse15 (* (div c_~x2~0 4294967296) 4294967296)) (.cse17 (* 4294967296 .cse10)) (.cse11 (* 16 c_~x4~0)) (.cse18 (mod c_~n~0 4294967296)) (.cse1 (* c_~x3~0 16))) (let ((.cse3 (+ (* (div .cse1 4294967296) 4294967296) c_~x4~0)) (.cse5 (not (< (mod c_~x4~0 4294967296) .cse18))) (.cse14 (+ .cse17 .cse11)) (.cse13 (* (div .cse11 4294967296) 4294967296)) (.cse6 (< (mod .cse11 4294967296) .cse18)) (.cse0 (not (< (mod c_~x3~0 4294967296) .cse18))) (.cse7 (= (+ (* (- 4294967296) .cse16) c_~x1~0 (* (- 1) c_~x2~0) .cse15) 0)) (.cse4 (< (mod .cse1 4294967296) .cse18)) (.cse9 (+ c_~x3~0 .cse2)) (.cse8 (+ .cse17 c_~x4~0))) (and (or .cse0 (<= (+ .cse1 .cse2) .cse3) .cse4) (or .cse5 .cse6 .cse7) (<= .cse8 .cse9) (<= (+ (* 73014444032 .cse10) .cse11 1) (+ (* c_~x3~0 17) (* .cse12 68719476736))) (or .cse5 .cse6 (<= (+ .cse13 c_~x3~0) .cse14)) (= (+ c_~x1~0 .cse15) (+ (* 4294967296 .cse16) c_~x2~0)) (or (< .cse3 (+ .cse1 .cse2 1)) .cse0 .cse4) (or .cse5 (< .cse14 (+ .cse13 c_~x3~0 1)) .cse6) (or .cse0 .cse7 .cse4) (<= .cse9 .cse8))))) is different from false [2022-03-15 18:30:08,200 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:30:10,142 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:30:32,859 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:31:28,682 WARN L228 SmtUtils]: Spent 55.09s on a formula simplification. DAG size of input: 137 DAG size of output: 106 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 18:31:30,686 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:31:33,352 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:31:35,365 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:31:37,381 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:31:39,155 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:31:41,177 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:31:43,192 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:31:45,208 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:31:47,221 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:31:49,248 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:31:51,301 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:31:53,310 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:31:55,316 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:31:57,327 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:31:59,338 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:32:01,359 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:32:15,452 WARN L228 SmtUtils]: Spent 9.75s on a formula simplification. DAG size of input: 97 DAG size of output: 88 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 18:32:56,824 WARN L228 SmtUtils]: Spent 40.59s on a formula simplification. DAG size of input: 137 DAG size of output: 106 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 18:32:59,124 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:33:01,135 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:33:03,157 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:33:05,168 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:33:07,179 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:33:09,186 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:33:11,193 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:33:13,203 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:33:15,376 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:33:17,385 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:33:19,398 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:33:27,272 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:33:29,398 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-03-15 18:33:31,298 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-03-15 18:33:33,556 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-03-15 18:33:34,676 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:33:49,121 WARN L228 SmtUtils]: Spent 9.20s on a formula simplification. DAG size of input: 106 DAG size of output: 64 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 18:33:51,127 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:33:53,137 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:33:54,621 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:33:57,565 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:33:59,576 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:34:02,931 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:34:06,139 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:34:07,837 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:34:09,846 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:34:11,644 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:34:21,085 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:34:23,088 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:34:25,258 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:34:51,979 WARN L228 SmtUtils]: Spent 23.28s on a formula simplification. DAG size of input: 137 DAG size of output: 91 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 18:34:55,761 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:34:57,797 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:34:59,819 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:35:01,844 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:35:03,855 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:35:05,874 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:35:07,892 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:35:09,924 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:35:11,938 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:35:31,278 WARN L228 SmtUtils]: Spent 5.34s on a formula simplification. DAG size of input: 79 DAG size of output: 64 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 18:35:34,449 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:35:36,961 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:35:38,523 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:35:47,327 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-03-15 18:35:49,337 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-03-15 18:35:51,918 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-03-15 18:35:53,700 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-03-15 18:35:59,872 WARN L228 SmtUtils]: Spent 5.60s on a formula simplification. DAG size of input: 141 DAG size of output: 72 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 18:36:02,149 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:36:03,205 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:36:05,175 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:36:07,932 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:36:10,298 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:36:12,430 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:36:14,465 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:36:17,320 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-15 18:37:15,281 WARN L228 SmtUtils]: Spent 43.77s on a formula simplification. DAG size of input: 91 DAG size of output: 83 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 18:37:27,893 WARN L228 SmtUtils]: Spent 9.32s on a formula simplification. DAG size of input: 137 DAG size of output: 91 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 18:37:35,269 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] Received shutdown request... [2022-03-15 18:37:50,920 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 18:37:50,920 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 18:37:51,840 WARN L244 SmtUtils]: Removed 12 from assertion stack [2022-03-15 18:37:51,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-15 18:37:51,842 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 122 SyntacticMatches, 12 SemanticMatches, 88 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2713 ImplicationChecksByTransitivity, 606.7s TimeCoverageRelationStatistics Valid=1173, Invalid=6585, Unknown=78, NotChecked=174, Total=8010 [2022-03-15 18:37:51,842 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 384 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 792 mSolverCounterSat, 164 mSolverCounterUnsat, 65 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 185.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 792 IncrementalHoareTripleChecker+Invalid, 65 IncrementalHoareTripleChecker+Unknown, 3 IncrementalHoareTripleChecker+Unchecked, 186.2s IncrementalHoareTripleChecker+Time [2022-03-15 18:37:51,843 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [384 Valid, 0 Invalid, 1024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 792 Invalid, 65 Unknown, 3 Unchecked, 186.2s Time] [2022-03-15 18:37:51,843 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-03-15 18:37:51,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-03-15 18:37:51,928 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 [2022-03-15 18:37:52,048 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-03-15 18:37:52,049 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was constructing difference of abstraction (562states) and FLOYD_HOARE automaton (currently 28 states, 58 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 91 for 7989ms.. [2022-03-15 18:37:52,050 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 5 remaining) [2022-03-15 18:37:52,050 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 5 remaining) [2022-03-15 18:37:52,050 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 5 remaining) [2022-03-15 18:37:52,050 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATION (0 of 5 remaining) [2022-03-15 18:37:52,052 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-03-15 18:37:52,053 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 18:37:52,053 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 18:37:52,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 06:37:52 BasicIcfg [2022-03-15 18:37:52,055 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 18:37:52,055 INFO L158 Benchmark]: Toolchain (without parser) took 883160.08ms. Allocated memory was 190.8MB in the beginning and 331.4MB in the end (delta: 140.5MB). Free memory was 140.5MB in the beginning and 125.0MB in the end (delta: 15.5MB). Peak memory consumption was 156.5MB. Max. memory is 8.0GB. [2022-03-15 18:37:52,055 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 190.8MB. Free memory is still 157.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 18:37:52,055 INFO L158 Benchmark]: CACSL2BoogieTranslator took 280.90ms. Allocated memory is still 190.8MB. Free memory was 140.3MB in the beginning and 164.9MB in the end (delta: -24.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-03-15 18:37:52,055 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.80ms. Allocated memory is still 190.8MB. Free memory was 164.9MB in the beginning and 163.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 18:37:52,056 INFO L158 Benchmark]: Boogie Preprocessor took 21.07ms. Allocated memory is still 190.8MB. Free memory was 163.1MB in the beginning and 162.1MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 18:37:52,056 INFO L158 Benchmark]: RCFGBuilder took 356.14ms. Allocated memory is still 190.8MB. Free memory was 161.8MB in the beginning and 148.2MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-03-15 18:37:52,056 INFO L158 Benchmark]: TraceAbstraction took 882462.99ms. Allocated memory was 190.8MB in the beginning and 331.4MB in the end (delta: 140.5MB). Free memory was 147.4MB in the beginning and 125.0MB in the end (delta: 22.3MB). Peak memory consumption was 164.2MB. Max. memory is 8.0GB. [2022-03-15 18:37:52,057 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 190.8MB. Free memory is still 157.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 280.90ms. Allocated memory is still 190.8MB. Free memory was 140.3MB in the beginning and 164.9MB in the end (delta: -24.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 26.80ms. Allocated memory is still 190.8MB. Free memory was 164.9MB in the beginning and 163.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.07ms. Allocated memory is still 190.8MB. Free memory was 163.1MB in the beginning and 162.1MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 356.14ms. Allocated memory is still 190.8MB. Free memory was 161.8MB in the beginning and 148.2MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 882462.99ms. Allocated memory was 190.8MB in the beginning and 331.4MB in the end (delta: 140.5MB). Free memory was 147.4MB in the beginning and 125.0MB in the end (delta: 22.3MB). Peak memory consumption was 164.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.9s, 140 PlacesBefore, 39 PlacesAfterwards, 137 TransitionsBefore, 30 TransitionsAfterwards, 2160 CoEnabledTransitionPairs, 7 FixpointIterations, 66 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 8 ConcurrentYvCompositions, 6 ChoiceCompositions, 122 TotalNumberOfCompositions, 2283 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2283, positive: 2283, positive conditional: 0, positive unconditional: 2283, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1164, positive: 1164, positive conditional: 0, positive unconditional: 1164, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2283, positive: 1119, positive conditional: 0, positive unconditional: 1119, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 1164, unknown conditional: 0, unknown unconditional: 1164] , Statistics on independence cache: Total cache size (in pairs): 62, Positive cache size: 62, Positive conditional cache size: 0, Positive unconditional cache size: 62, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 104]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (562states) and FLOYD_HOARE automaton (currently 28 states, 58 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 91 for 7989ms.. - TimeoutResultAtElement [Line: 97]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (562states) and FLOYD_HOARE automaton (currently 28 states, 58 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 91 for 7989ms.. - TimeoutResultAtElement [Line: 96]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (562states) and FLOYD_HOARE automaton (currently 28 states, 58 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 91 for 7989ms.. - TimeoutResultAtElement [Line: 94]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (562states) and FLOYD_HOARE automaton (currently 28 states, 58 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 91 for 7989ms.. - TimeoutResultAtElement [Line: 95]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (562states) and FLOYD_HOARE automaton (currently 28 states, 58 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 91 for 7989ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 164 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 882.4s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 599.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 65 mSolverCounterUnknown, 1274 SdHoareTripleChecker+Valid, 189.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1274 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 187.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 3 IncrementalHoareTripleChecker+Unchecked, 1445 mSDsCounter, 284 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3395 IncrementalHoareTripleChecker+Invalid, 3747 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 284 mSolverCounterUnsat, 0 mSDtfsCounter, 3395 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 775 GetRequests, 507 SyntacticMatches, 106 SemanticMatches, 161 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3169 ImplicationChecksByTransitivity, 608.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=562occurred in iteration=5, InterpolantAutomatonStates: 47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 674 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 51.1s InterpolantComputationTime, 177 NumberOfCodeBlocks, 177 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 212 ConstructedInterpolants, 0 QuantifiedInterpolants, 6174 SizeOfPredicates, 9 NumberOfNonLiveVariables, 403 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 3/12 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown