/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample FPandBPonlyIfFpWasNotPerfect -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.assert.codeblocks SMT_FEATURE_HEURISTIC --traceabstraction.assert.codeblocks.term.scoring.heuristic NUM_VARIABLES --traceabstraction.assert.codeblocks.term.scoring.heuristic.partitioning.strategy FIXED_NUM_PARTITIONS --traceabstraction.assert.codeblocks.term.scoring.heuristic.number.of.partitions 2 -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/mono-crafted_12.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-d623d84 [2020-07-21 17:13:01,089 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-21 17:13:01,093 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-21 17:13:01,117 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-21 17:13:01,118 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-21 17:13:01,120 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-21 17:13:01,122 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-21 17:13:01,125 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-21 17:13:01,128 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-21 17:13:01,130 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-21 17:13:01,132 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-21 17:13:01,134 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-21 17:13:01,135 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-21 17:13:01,137 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-21 17:13:01,139 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-21 17:13:01,141 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-21 17:13:01,142 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-21 17:13:01,144 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-21 17:13:01,147 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-21 17:13:01,151 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-21 17:13:01,153 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-21 17:13:01,156 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-21 17:13:01,157 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-21 17:13:01,159 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-21 17:13:01,163 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-21 17:13:01,164 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-21 17:13:01,164 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-21 17:13:01,165 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-21 17:13:01,166 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-21 17:13:01,168 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-21 17:13:01,168 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-21 17:13:01,170 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-21 17:13:01,171 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-21 17:13:01,172 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-21 17:13:01,174 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-21 17:13:01,175 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-21 17:13:01,176 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-21 17:13:01,176 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-21 17:13:01,177 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-21 17:13:01,178 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-21 17:13:01,179 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-21 17:13:01,181 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-21 17:13:01,212 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-21 17:13:01,212 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-21 17:13:01,215 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-21 17:13:01,215 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-21 17:13:01,216 INFO L138 SettingsManager]: * Use SBE=true [2020-07-21 17:13:01,216 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-21 17:13:01,216 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-21 17:13:01,217 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-21 17:13:01,217 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-21 17:13:01,217 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-21 17:13:01,217 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-21 17:13:01,218 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-21 17:13:01,218 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-21 17:13:01,218 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-21 17:13:01,218 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-21 17:13:01,218 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-21 17:13:01,219 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-21 17:13:01,219 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-21 17:13:01,219 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-21 17:13:01,219 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-21 17:13:01,220 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-21 17:13:01,220 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-21 17:13:01,220 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-21 17:13:01,220 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-21 17:13:01,221 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-21 17:13:01,221 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-21 17:13:01,221 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:13:01,221 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-21 17:13:01,221 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-21 17:13:01,222 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> FPandBPonlyIfFpWasNotPerfect Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks -> SMT_FEATURE_HEURISTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic -> NUM_VARIABLES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic Partitioning Strategy -> FIXED_NUM_PARTITIONS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic number of partitions -> 2 [2020-07-21 17:13:01,609 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-21 17:13:01,630 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-21 17:13:01,636 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-21 17:13:01,639 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-21 17:13:01,640 INFO L275 PluginConnector]: CDTParser initialized [2020-07-21 17:13:01,642 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/mono-crafted_12.c [2020-07-21 17:13:01,743 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d017fda1/f412799cf34945e3b95915b29a9cfee2/FLAGd30eb91ab [2020-07-21 17:13:02,508 INFO L306 CDTParser]: Found 1 translation units. [2020-07-21 17:13:02,509 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/mono-crafted_12.c [2020-07-21 17:13:02,527 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d017fda1/f412799cf34945e3b95915b29a9cfee2/FLAGd30eb91ab [2020-07-21 17:13:02,749 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d017fda1/f412799cf34945e3b95915b29a9cfee2 [2020-07-21 17:13:02,766 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-21 17:13:02,771 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-21 17:13:02,773 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-21 17:13:02,773 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-21 17:13:02,779 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-21 17:13:02,781 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:13:02" (1/1) ... [2020-07-21 17:13:02,786 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57725e8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:13:02, skipping insertion in model container [2020-07-21 17:13:02,787 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:13:02" (1/1) ... [2020-07-21 17:13:02,799 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-21 17:13:02,823 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-21 17:13:03,061 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-21 17:13:03,071 INFO L203 MainTranslator]: Completed pre-run [2020-07-21 17:13:03,093 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-21 17:13:03,114 INFO L208 MainTranslator]: Completed translation [2020-07-21 17:13:03,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:13:03 WrapperNode [2020-07-21 17:13:03,116 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-21 17:13:03,118 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-21 17:13:03,118 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-21 17:13:03,119 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-21 17:13:03,138 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:13:03" (1/1) ... [2020-07-21 17:13:03,139 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:13:03" (1/1) ... [2020-07-21 17:13:03,148 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:13:03" (1/1) ... [2020-07-21 17:13:03,149 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:13:03" (1/1) ... [2020-07-21 17:13:03,156 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:13:03" (1/1) ... [2020-07-21 17:13:03,165 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:13:03" (1/1) ... [2020-07-21 17:13:03,167 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:13:03" (1/1) ... [2020-07-21 17:13:03,170 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-21 17:13:03,171 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-21 17:13:03,172 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-21 17:13:03,172 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-21 17:13:03,174 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:13:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-21 17:13:03,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-21 17:13:03,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-21 17:13:03,379 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-21 17:13:03,380 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-21 17:13:03,380 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-21 17:13:03,380 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-21 17:13:03,380 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-21 17:13:03,380 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-21 17:13:03,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-21 17:13:03,654 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-21 17:13:03,655 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-21 17:13:03,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:13:03 BoogieIcfgContainer [2020-07-21 17:13:03,662 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-21 17:13:03,665 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-21 17:13:03,665 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-21 17:13:03,670 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-21 17:13:03,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 05:13:02" (1/3) ... [2020-07-21 17:13:03,673 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cff3240 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 05:13:03, skipping insertion in model container [2020-07-21 17:13:03,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:13:03" (2/3) ... [2020-07-21 17:13:03,674 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cff3240 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 05:13:03, skipping insertion in model container [2020-07-21 17:13:03,675 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:13:03" (3/3) ... [2020-07-21 17:13:03,678 INFO L109 eAbstractionObserver]: Analyzing ICFG mono-crafted_12.c [2020-07-21 17:13:03,695 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBPonlyIfFpWasNotPerfect Determinization: PREDICATE_ABSTRACTION [2020-07-21 17:13:03,705 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-21 17:13:03,728 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-21 17:13:03,781 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-21 17:13:03,782 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-21 17:13:03,782 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBPonlyIfFpWasNotPerfect [2020-07-21 17:13:03,783 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-21 17:13:03,784 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-21 17:13:03,784 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-21 17:13:03,784 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-21 17:13:03,784 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-21 17:13:03,835 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2020-07-21 17:13:03,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-21 17:13:03,845 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 17:13:03,848 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 17:13:03,849 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 17:13:03,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 17:13:03,868 INFO L82 PathProgramCache]: Analyzing trace with hash -147882559, now seen corresponding path program 1 times [2020-07-21 17:13:03,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 17:13:03,888 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1211534044] [2020-07-21 17:13:03,889 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:13:03,994 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 17:13:03,995 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 17:13:03,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 1 conjunts are in the unsatisfiable core [2020-07-21 17:13:04,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 17:13:04,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 17:13:04,029 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 17:13:04,030 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1211534044] [2020-07-21 17:13:04,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 17:13:04,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-21 17:13:04,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406610615] [2020-07-21 17:13:04,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-21 17:13:04,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 17:13:04,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-21 17:13:04,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-21 17:13:04,060 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2020-07-21 17:13:04,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 17:13:04,095 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2020-07-21 17:13:04,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-21 17:13:04,097 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-07-21 17:13:04,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 17:13:04,109 INFO L225 Difference]: With dead ends: 32 [2020-07-21 17:13:04,109 INFO L226 Difference]: Without dead ends: 13 [2020-07-21 17:13:04,113 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-21 17:13:04,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2020-07-21 17:13:04,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-07-21 17:13:04,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-21 17:13:04,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2020-07-21 17:13:04,172 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2020-07-21 17:13:04,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 17:13:04,173 INFO L479 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2020-07-21 17:13:04,173 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-21 17:13:04,174 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2020-07-21 17:13:04,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-21 17:13:04,175 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 17:13:04,175 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 17:13:04,389 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:13:04,390 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 17:13:04,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 17:13:04,391 INFO L82 PathProgramCache]: Analyzing trace with hash -158041290, now seen corresponding path program 1 times [2020-07-21 17:13:04,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 17:13:04,392 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [449489567] [2020-07-21 17:13:04,392 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:13:04,444 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 1 check-sat command(s) [2020-07-21 17:13:04,444 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 17:13:04,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-21 17:13:04,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 17:13:04,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 17:13:04,498 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 17:13:04,499 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [449489567] [2020-07-21 17:13:04,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 17:13:04,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 17:13:04,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911235963] [2020-07-21 17:13:04,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 17:13:04,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 17:13:04,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 17:13:04,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 17:13:04,505 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 3 states. [2020-07-21 17:13:04,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 17:13:04,570 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2020-07-21 17:13:04,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 17:13:04,572 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-07-21 17:13:04,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 17:13:04,573 INFO L225 Difference]: With dead ends: 24 [2020-07-21 17:13:04,574 INFO L226 Difference]: Without dead ends: 16 [2020-07-21 17:13:04,576 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 17:13:04,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-07-21 17:13:04,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2020-07-21 17:13:04,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-21 17:13:04,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2020-07-21 17:13:04,587 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2020-07-21 17:13:04,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 17:13:04,588 INFO L479 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2020-07-21 17:13:04,588 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 17:13:04,588 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2020-07-21 17:13:04,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-21 17:13:04,589 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 17:13:04,590 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 17:13:04,806 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:13:04,807 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 17:13:04,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 17:13:04,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1776138601, now seen corresponding path program 1 times [2020-07-21 17:13:04,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 17:13:04,809 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [256692307] [2020-07-21 17:13:04,810 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:13:04,861 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 1 check-sat command(s) [2020-07-21 17:13:04,862 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 17:13:04,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-21 17:13:04,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 17:13:04,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 17:13:04,932 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 17:13:05,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 17:13:05,061 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [256692307] [2020-07-21 17:13:05,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 17:13:05,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2020-07-21 17:13:05,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596412840] [2020-07-21 17:13:05,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-21 17:13:05,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 17:13:05,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-21 17:13:05,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-07-21 17:13:05,066 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 7 states. [2020-07-21 17:13:05,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 17:13:05,246 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2020-07-21 17:13:05,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-21 17:13:05,247 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2020-07-21 17:13:05,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 17:13:05,249 INFO L225 Difference]: With dead ends: 31 [2020-07-21 17:13:05,249 INFO L226 Difference]: Without dead ends: 23 [2020-07-21 17:13:05,250 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2020-07-21 17:13:05,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-21 17:13:05,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-07-21 17:13:05,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-21 17:13:05,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2020-07-21 17:13:05,258 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 13 [2020-07-21 17:13:05,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 17:13:05,259 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2020-07-21 17:13:05,259 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-21 17:13:05,259 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2020-07-21 17:13:05,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-21 17:13:05,260 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 17:13:05,260 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 17:13:05,476 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:13:05,476 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 17:13:05,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 17:13:05,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1289106634, now seen corresponding path program 1 times [2020-07-21 17:13:05,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 17:13:05,478 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1010444214] [2020-07-21 17:13:05,479 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:13:05,515 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 1 check-sat command(s) [2020-07-21 17:13:05,516 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 17:13:05,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-21 17:13:05,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 17:13:05,570 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-21 17:13:05,571 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 17:13:05,651 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-21 17:13:05,652 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1010444214] [2020-07-21 17:13:05,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 17:13:05,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2020-07-21 17:13:05,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829850345] [2020-07-21 17:13:05,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-21 17:13:05,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 17:13:05,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-21 17:13:05,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-07-21 17:13:05,656 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 8 states. [2020-07-21 17:13:08,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 17:13:08,273 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2020-07-21 17:13:08,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-21 17:13:08,274 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-07-21 17:13:08,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 17:13:08,279 INFO L225 Difference]: With dead ends: 43 [2020-07-21 17:13:08,279 INFO L226 Difference]: Without dead ends: 33 [2020-07-21 17:13:08,280 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-07-21 17:13:08,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-21 17:13:08,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2020-07-21 17:13:08,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-21 17:13:08,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2020-07-21 17:13:08,294 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 22 [2020-07-21 17:13:08,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 17:13:08,294 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2020-07-21 17:13:08,295 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-21 17:13:08,295 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2020-07-21 17:13:08,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-21 17:13:08,296 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 17:13:08,297 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 17:13:08,507 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:13:08,509 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 17:13:08,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 17:13:08,511 INFO L82 PathProgramCache]: Analyzing trace with hash 92873718, now seen corresponding path program 2 times [2020-07-21 17:13:08,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 17:13:08,511 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [634311108] [2020-07-21 17:13:08,512 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:13:08,545 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 1 check-sat command(s) [2020-07-21 17:13:08,546 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 17:13:08,547 WARN L261 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-21 17:13:08,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 17:13:08,694 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 17:13:08,694 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 17:13:09,030 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 17:13:09,031 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [634311108] [2020-07-21 17:13:09,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 17:13:09,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2020-07-21 17:13:09,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45100921] [2020-07-21 17:13:09,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-21 17:13:09,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 17:13:09,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-21 17:13:09,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2020-07-21 17:13:09,035 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 13 states. [2020-07-21 17:13:11,860 WARN L193 SmtUtils]: Spent 2.53 s on a formula simplification. DAG size of input: 42 DAG size of output: 28 [2020-07-21 17:13:14,204 WARN L193 SmtUtils]: Spent 2.23 s on a formula simplification. DAG size of input: 33 DAG size of output: 23 [2020-07-21 17:13:16,600 WARN L193 SmtUtils]: Spent 2.15 s on a formula simplification. DAG size of input: 24 DAG size of output: 18 [2020-07-21 17:13:16,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 17:13:16,809 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2020-07-21 17:13:16,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-21 17:13:16,812 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2020-07-21 17:13:16,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 17:13:16,813 INFO L225 Difference]: With dead ends: 46 [2020-07-21 17:13:16,813 INFO L226 Difference]: Without dead ends: 41 [2020-07-21 17:13:16,814 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=106, Invalid=166, Unknown=0, NotChecked=0, Total=272 [2020-07-21 17:13:16,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-07-21 17:13:16,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2020-07-21 17:13:16,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-21 17:13:16,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2020-07-21 17:13:16,830 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 22 [2020-07-21 17:13:16,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 17:13:16,831 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2020-07-21 17:13:16,831 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-21 17:13:16,831 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2020-07-21 17:13:16,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-21 17:13:16,832 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 17:13:16,833 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 17:13:17,047 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:13:17,048 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 17:13:17,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 17:13:17,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1362713706, now seen corresponding path program 2 times [2020-07-21 17:13:17,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 17:13:17,050 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1061474834] [2020-07-21 17:13:17,050 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:13:17,088 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 1 check-sat command(s) [2020-07-21 17:13:17,089 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 17:13:17,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 15 conjunts are in the unsatisfiable core [2020-07-21 17:13:17,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 17:13:17,213 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 73 proven. 57 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-07-21 17:13:17,214 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 17:13:19,612 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 73 proven. 54 refuted. 3 times theorem prover too weak. 15 trivial. 0 not checked. [2020-07-21 17:13:19,613 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1061474834] [2020-07-21 17:13:19,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 17:13:19,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2020-07-21 17:13:19,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128216062] [2020-07-21 17:13:19,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-21 17:13:19,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 17:13:19,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-21 17:13:19,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=161, Unknown=1, NotChecked=0, Total=240 [2020-07-21 17:13:19,617 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 16 states. [2020-07-21 17:13:20,125 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 11 [2020-07-21 17:13:20,967 WARN L193 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 11 [2020-07-21 17:13:21,913 WARN L193 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 11 [2020-07-21 17:13:25,095 WARN L193 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 21 DAG size of output: 11 [2020-07-21 17:13:31,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 17:13:31,222 INFO L93 Difference]: Finished difference Result 75 states and 91 transitions. [2020-07-21 17:13:31,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-21 17:13:31,225 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 40 [2020-07-21 17:13:31,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 17:13:31,228 INFO L225 Difference]: With dead ends: 75 [2020-07-21 17:13:31,228 INFO L226 Difference]: Without dead ends: 59 [2020-07-21 17:13:31,230 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=173, Invalid=287, Unknown=2, NotChecked=0, Total=462 [2020-07-21 17:13:31,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-07-21 17:13:31,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 54. [2020-07-21 17:13:31,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-07-21 17:13:31,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2020-07-21 17:13:31,245 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 40 [2020-07-21 17:13:31,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 17:13:31,245 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2020-07-21 17:13:31,246 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-21 17:13:31,246 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2020-07-21 17:13:31,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-21 17:13:31,247 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 17:13:31,248 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 17:13:31,462 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:13:31,463 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 17:13:31,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 17:13:31,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1588607722, now seen corresponding path program 3 times [2020-07-21 17:13:31,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 17:13:31,465 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [734320676] [2020-07-21 17:13:31,465 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:13:31,509 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 17:13:31,509 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 17:13:31,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 26 conjunts are in the unsatisfiable core [2020-07-21 17:13:31,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 17:13:31,717 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 17:13:31,718 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 17:13:32,436 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 17:13:32,437 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [734320676] [2020-07-21 17:13:32,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 17:13:32,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2020-07-21 17:13:32,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286996192] [2020-07-21 17:13:32,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-07-21 17:13:32,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 17:13:32,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-07-21 17:13:32,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=420, Unknown=0, NotChecked=0, Total=600 [2020-07-21 17:13:32,441 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 25 states. [2020-07-21 17:13:34,886 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~y~0 4294967296))) (and (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod c_main_~x~0 4294967296) .cse0) (< (mod (+ c_main_~x~0 10) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 3) 4294967296) .cse0))) is different from false [2020-07-21 17:13:36,902 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~y~0 4294967296))) (and (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod (+ c_main_~x~0 10) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 3) 4294967296) .cse0))) is different from false [2020-07-21 17:13:38,914 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~y~0 4294967296))) (and (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod c_main_~x~0 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 3) 4294967296) .cse0))) is different from false [2020-07-21 17:13:40,928 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~y~0 4294967296))) (and (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 3) 4294967296) .cse0))) is different from false [2020-07-21 17:14:03,360 WARN L193 SmtUtils]: Spent 14.92 s on a formula simplification that was a NOOP. DAG size: 48 [2020-07-21 17:14:07,213 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~y~0 4294967296))) (and (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod c_main_~x~0 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 3) 4294967296) .cse0))) is different from false [2020-07-21 17:14:16,576 WARN L193 SmtUtils]: Spent 7.12 s on a formula simplification that was a NOOP. DAG size: 40 [2020-07-21 17:14:26,328 WARN L193 SmtUtils]: Spent 6.22 s on a formula simplification that was a NOOP. DAG size: 38 [2020-07-21 17:14:34,649 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~y~0 4294967296))) (and (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod c_main_~x~0 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 3) 4294967296) .cse0))) is different from false [2020-07-21 17:14:35,346 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2020-07-21 17:14:39,332 WARN L193 SmtUtils]: Spent 293.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2020-07-21 17:14:42,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 17:14:42,699 INFO L93 Difference]: Finished difference Result 83 states and 102 transitions. [2020-07-21 17:14:42,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-07-21 17:14:42,700 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 40 [2020-07-21 17:14:42,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 17:14:42,702 INFO L225 Difference]: With dead ends: 83 [2020-07-21 17:14:42,702 INFO L226 Difference]: Without dead ends: 78 [2020-07-21 17:14:42,704 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 57.5s TimeCoverageRelationStatistics Valid=357, Invalid=714, Unknown=9, NotChecked=402, Total=1482 [2020-07-21 17:14:42,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-07-21 17:14:42,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2020-07-21 17:14:42,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-07-21 17:14:42,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2020-07-21 17:14:42,720 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 40 [2020-07-21 17:14:42,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 17:14:42,721 INFO L479 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2020-07-21 17:14:42,721 INFO L480 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-07-21 17:14:42,721 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2020-07-21 17:14:42,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-07-21 17:14:42,722 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 17:14:42,723 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 17:14:42,923 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:14:42,924 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 17:14:42,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 17:14:42,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1251792523, now seen corresponding path program 3 times [2020-07-21 17:14:42,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 17:14:42,926 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1191346907] [2020-07-21 17:14:42,926 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:14:42,968 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 17:14:42,968 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 17:14:42,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 31 conjunts are in the unsatisfiable core [2020-07-21 17:14:42,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 17:14:43,125 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 29 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 17:14:43,126 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 17:14:47,980 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 29 proven. 298 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 17:14:47,981 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1191346907] [2020-07-21 17:14:47,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 17:14:47,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2020-07-21 17:14:47,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99835436] [2020-07-21 17:14:47,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2020-07-21 17:14:47,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 17:14:47,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2020-07-21 17:14:47,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=704, Unknown=2, NotChecked=0, Total=992 [2020-07-21 17:14:47,984 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand 32 states. [2020-07-21 17:14:56,999 WARN L193 SmtUtils]: Spent 4.55 s on a formula simplification. DAG size of input: 76 DAG size of output: 11 [2020-07-21 17:15:04,264 WARN L193 SmtUtils]: Spent 932.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 11 [2020-07-21 17:15:11,245 WARN L193 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 66 DAG size of output: 11 [2020-07-21 17:15:23,753 WARN L193 SmtUtils]: Spent 3.60 s on a formula simplification. DAG size of input: 61 DAG size of output: 11 [2020-07-21 17:15:35,370 WARN L193 SmtUtils]: Spent 2.24 s on a formula simplification. DAG size of input: 56 DAG size of output: 11 [2020-07-21 17:15:54,445 WARN L193 SmtUtils]: Spent 2.02 s on a formula simplification. DAG size of input: 51 DAG size of output: 11 [2020-07-21 17:16:00,097 WARN L193 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 11 [2020-07-21 17:16:07,492 WARN L193 SmtUtils]: Spent 2.17 s on a formula simplification. DAG size of input: 41 DAG size of output: 11 [2020-07-21 17:16:19,307 WARN L193 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 11 [2020-07-21 17:16:35,473 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 11 [2020-07-21 17:16:46,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 17:16:46,487 INFO L93 Difference]: Finished difference Result 136 states and 167 transitions. [2020-07-21 17:16:46,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2020-07-21 17:16:46,487 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 55 [2020-07-21 17:16:46,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 17:16:46,489 INFO L225 Difference]: With dead ends: 136 [2020-07-21 17:16:46,489 INFO L226 Difference]: Without dead ends: 111 [2020-07-21 17:16:46,491 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 118.5s TimeCoverageRelationStatistics Valid=727, Invalid=1323, Unknown=20, NotChecked=0, Total=2070 [2020-07-21 17:16:46,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2020-07-21 17:16:46,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 102. [2020-07-21 17:16:46,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2020-07-21 17:16:46,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 111 transitions. [2020-07-21 17:16:46,503 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 111 transitions. Word has length 55 [2020-07-21 17:16:46,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 17:16:46,504 INFO L479 AbstractCegarLoop]: Abstraction has 102 states and 111 transitions. [2020-07-21 17:16:46,504 INFO L480 AbstractCegarLoop]: Interpolant automaton has 32 states. [2020-07-21 17:16:46,504 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 111 transitions. [2020-07-21 17:16:46,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-07-21 17:16:46,507 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 17:16:46,507 INFO L422 BasicCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 17:16:46,720 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:16:46,721 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 17:16:46,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 17:16:46,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1507791018, now seen corresponding path program 4 times [2020-07-21 17:16:46,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 17:16:46,722 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [416762175] [2020-07-21 17:16:46,723 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 17:16:46,782 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 17:16:46,782 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 17:16:46,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 50 conjunts are in the unsatisfiable core [2020-07-21 17:16:46,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 17:16:47,353 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 17:16:47,353 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 17:17:13,695 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 700 refuted. 15 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 17:17:13,696 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [416762175] [2020-07-21 17:17:13,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 17:17:13,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 49 [2020-07-21 17:17:13,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648667236] [2020-07-21 17:17:13,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2020-07-21 17:17:13,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 17:17:13,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2020-07-21 17:17:13,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=648, Invalid=1693, Unknown=11, NotChecked=0, Total=2352 [2020-07-21 17:17:13,699 INFO L87 Difference]: Start difference. First operand 102 states and 111 transitions. Second operand 49 states. [2020-07-21 17:17:16,890 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_main_~x~0 4)) (.cse4 (+ c_main_~x~0 15)) (.cse9 (+ c_main_~x~0 10)) (.cse11 (+ c_main_~x~0 6)) (.cse12 (+ c_main_~x~0 7)) (.cse8 (+ c_main_~x~0 3)) (.cse5 (+ c_main_~x~0 11)) (.cse13 (+ c_main_~x~0 14)) (.cse10 (+ c_main_~x~0 13)) (.cse15 (+ c_main_~x~0 5)) (.cse6 (+ c_main_~x~0 2)) (.cse7 (+ c_main_~x~0 9)) (.cse16 (+ c_main_~x~0 12)) (.cse3 (+ c_main_~x~0 8)) (.cse1 (mod c_main_~y~0 4294967296)) (.cse2 (mod c_main_~y~0 4294967296)) (.cse14 (+ c_main_~x~0 1))) (and (< (mod .cse0 4294967296) .cse1) (< (mod c_main_~x~0 4294967296) .cse1) (or (<= .cse2 (mod .cse3 4294967296)) (< (mod .cse4 4294967296) .cse1)) (or (< (mod .cse5 4294967296) .cse1) (<= .cse2 (mod .cse0 4294967296))) (< (mod .cse6 4294967296) .cse1) (or (< (mod (+ c_main_~x~0 16) 4294967296) .cse1) (<= .cse2 (mod .cse7 4294967296))) (or (<= .cse2 (mod .cse8 4294967296)) (< (mod .cse9 4294967296) .cse1)) (or (< (mod .cse10 4294967296) .cse1) (<= .cse2 (mod .cse11 4294967296))) (or (<= .cse2 (mod .cse4 4294967296)) (< (mod (+ c_main_~x~0 22) 4294967296) .cse1)) (or (<= .cse2 (mod .cse12 4294967296)) (< (mod .cse13 4294967296) .cse1)) (or (< (mod (+ c_main_~x~0 17) 4294967296) .cse1) (<= .cse2 (mod .cse9 4294967296))) (< (mod .cse11 4294967296) .cse1) (< (mod .cse14 4294967296) .cse1) (< (mod .cse12 4294967296) .cse1) (< (mod .cse8 4294967296) .cse1) (or (< (mod (+ c_main_~x~0 18) 4294967296) .cse1) (<= .cse2 (mod .cse5 4294967296))) (or (< (mod (+ c_main_~x~0 21) 4294967296) .cse1) (<= .cse2 (mod .cse13 4294967296))) (or (< (mod (+ c_main_~x~0 20) 4294967296) .cse1) (<= .cse2 (mod .cse10 4294967296))) (< (mod .cse15 4294967296) .cse1) (or (< (mod .cse16 4294967296) .cse1) (<= .cse2 (mod .cse15 4294967296))) (or (<= .cse2 (mod .cse6 4294967296)) (< (mod .cse7 4294967296) .cse1)) (or (<= .cse2 (mod .cse16 4294967296)) (< (mod (+ c_main_~x~0 19) 4294967296) .cse1)) (or (< (mod .cse3 4294967296) .cse1) (<= .cse2 (mod .cse14 4294967296))))) is different from false [2020-07-21 17:17:18,908 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_main_~x~0 4)) (.cse4 (+ c_main_~x~0 15)) (.cse9 (+ c_main_~x~0 10)) (.cse11 (+ c_main_~x~0 6)) (.cse12 (+ c_main_~x~0 7)) (.cse8 (+ c_main_~x~0 3)) (.cse5 (+ c_main_~x~0 11)) (.cse13 (+ c_main_~x~0 14)) (.cse10 (+ c_main_~x~0 13)) (.cse15 (+ c_main_~x~0 5)) (.cse6 (+ c_main_~x~0 2)) (.cse7 (+ c_main_~x~0 9)) (.cse16 (+ c_main_~x~0 12)) (.cse3 (+ c_main_~x~0 8)) (.cse1 (mod c_main_~y~0 4294967296)) (.cse2 (mod c_main_~y~0 4294967296)) (.cse14 (+ c_main_~x~0 1))) (and (< (mod .cse0 4294967296) .cse1) (or (<= .cse2 (mod .cse3 4294967296)) (< (mod .cse4 4294967296) .cse1)) (or (< (mod .cse5 4294967296) .cse1) (<= .cse2 (mod .cse0 4294967296))) (< (mod .cse6 4294967296) .cse1) (or (< (mod (+ c_main_~x~0 16) 4294967296) .cse1) (<= .cse2 (mod .cse7 4294967296))) (or (<= .cse2 (mod .cse8 4294967296)) (< (mod .cse9 4294967296) .cse1)) (or (< (mod .cse10 4294967296) .cse1) (<= .cse2 (mod .cse11 4294967296))) (or (<= .cse2 (mod .cse4 4294967296)) (< (mod (+ c_main_~x~0 22) 4294967296) .cse1)) (or (<= .cse2 (mod .cse12 4294967296)) (< (mod .cse13 4294967296) .cse1)) (or (< (mod (+ c_main_~x~0 17) 4294967296) .cse1) (<= .cse2 (mod .cse9 4294967296))) (< (mod .cse11 4294967296) .cse1) (< (mod .cse14 4294967296) .cse1) (< (mod .cse12 4294967296) .cse1) (< (mod .cse8 4294967296) .cse1) (or (< (mod (+ c_main_~x~0 18) 4294967296) .cse1) (<= .cse2 (mod .cse5 4294967296))) (or (< (mod (+ c_main_~x~0 21) 4294967296) .cse1) (<= .cse2 (mod .cse13 4294967296))) (or (< (mod (+ c_main_~x~0 20) 4294967296) .cse1) (<= .cse2 (mod .cse10 4294967296))) (< (mod .cse15 4294967296) .cse1) (or (< (mod .cse16 4294967296) .cse1) (<= .cse2 (mod .cse15 4294967296))) (or (<= .cse2 (mod .cse6 4294967296)) (< (mod .cse7 4294967296) .cse1)) (or (<= .cse2 (mod .cse16 4294967296)) (< (mod (+ c_main_~x~0 19) 4294967296) .cse1)) (or (< (mod .cse3 4294967296) .cse1) (<= .cse2 (mod .cse14 4294967296))))) is different from false [2020-07-21 17:17:20,926 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_main_~x~0 4)) (.cse8 (+ c_main_~x~0 10)) (.cse10 (+ c_main_~x~0 6)) (.cse7 (+ c_main_~x~0 3)) (.cse4 (+ c_main_~x~0 11)) (.cse12 (+ c_main_~x~0 14)) (.cse11 (+ c_main_~x~0 7)) (.cse9 (+ c_main_~x~0 13)) (.cse14 (+ c_main_~x~0 5)) (.cse5 (+ c_main_~x~0 2)) (.cse6 (+ c_main_~x~0 9)) (.cse15 (+ c_main_~x~0 12)) (.cse3 (+ c_main_~x~0 8)) (.cse1 (mod c_main_~y~0 4294967296)) (.cse2 (mod c_main_~y~0 4294967296)) (.cse13 (+ c_main_~x~0 1))) (and (< (mod .cse0 4294967296) .cse1) (< (mod c_main_~x~0 4294967296) .cse1) (or (<= .cse2 (mod .cse3 4294967296)) (< (mod (+ c_main_~x~0 15) 4294967296) .cse1)) (or (< (mod .cse4 4294967296) .cse1) (<= .cse2 (mod .cse0 4294967296))) (< (mod .cse5 4294967296) .cse1) (or (< (mod (+ c_main_~x~0 16) 4294967296) .cse1) (<= .cse2 (mod .cse6 4294967296))) (or (<= .cse2 (mod .cse7 4294967296)) (< (mod .cse8 4294967296) .cse1)) (or (< (mod .cse9 4294967296) .cse1) (<= .cse2 (mod .cse10 4294967296))) (or (<= .cse2 (mod .cse11 4294967296)) (< (mod .cse12 4294967296) .cse1)) (or (< (mod (+ c_main_~x~0 17) 4294967296) .cse1) (<= .cse2 (mod .cse8 4294967296))) (< (mod .cse10 4294967296) .cse1) (< (mod .cse13 4294967296) .cse1) (< (mod .cse7 4294967296) .cse1) (or (< (mod (+ c_main_~x~0 18) 4294967296) .cse1) (<= .cse2 (mod .cse4 4294967296))) (or (< (mod (+ c_main_~x~0 21) 4294967296) .cse1) (<= .cse2 (mod .cse12 4294967296))) (or (< (mod .cse11 4294967296) .cse1) (<= .cse2 (mod c_main_~x~0 4294967296))) (or (< (mod (+ c_main_~x~0 20) 4294967296) .cse1) (<= .cse2 (mod .cse9 4294967296))) (< (mod .cse14 4294967296) .cse1) (or (< (mod .cse15 4294967296) .cse1) (<= .cse2 (mod .cse14 4294967296))) (or (<= .cse2 (mod .cse5 4294967296)) (< (mod .cse6 4294967296) .cse1)) (or (<= .cse2 (mod .cse15 4294967296)) (< (mod (+ c_main_~x~0 19) 4294967296) .cse1)) (or (< (mod .cse3 4294967296) .cse1) (<= .cse2 (mod .cse13 4294967296))))) is different from false [2020-07-21 17:21:18,714 WARN L193 SmtUtils]: Spent 3.77 m on a formula simplification. DAG size of input: 168 DAG size of output: 110 [2020-07-21 17:21:21,331 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_main_~x~0 4)) (.cse8 (+ c_main_~x~0 10)) (.cse10 (+ c_main_~x~0 6)) (.cse11 (+ c_main_~x~0 7)) (.cse7 (+ c_main_~x~0 3)) (.cse4 (+ c_main_~x~0 11)) (.cse12 (+ c_main_~x~0 14)) (.cse9 (+ c_main_~x~0 13)) (.cse14 (+ c_main_~x~0 5)) (.cse5 (+ c_main_~x~0 2)) (.cse6 (+ c_main_~x~0 9)) (.cse15 (+ c_main_~x~0 12)) (.cse3 (+ c_main_~x~0 8)) (.cse1 (mod c_main_~y~0 4294967296)) (.cse2 (mod c_main_~y~0 4294967296)) (.cse13 (+ c_main_~x~0 1))) (and (< (mod .cse0 4294967296) .cse1) (< (mod c_main_~x~0 4294967296) .cse1) (or (<= .cse2 (mod .cse3 4294967296)) (< (mod (+ c_main_~x~0 15) 4294967296) .cse1)) (or (< (mod .cse4 4294967296) .cse1) (<= .cse2 (mod .cse0 4294967296))) (< (mod .cse5 4294967296) .cse1) (or (< (mod (+ c_main_~x~0 16) 4294967296) .cse1) (<= .cse2 (mod .cse6 4294967296))) (or (<= .cse2 (mod .cse7 4294967296)) (< (mod .cse8 4294967296) .cse1)) (or (< (mod .cse9 4294967296) .cse1) (<= .cse2 (mod .cse10 4294967296))) (or (<= .cse2 (mod .cse11 4294967296)) (< (mod .cse12 4294967296) .cse1)) (or (< (mod (+ c_main_~x~0 17) 4294967296) .cse1) (<= .cse2 (mod .cse8 4294967296))) (< (mod .cse10 4294967296) .cse1) (< (mod .cse13 4294967296) .cse1) (< (mod .cse11 4294967296) .cse1) (< (mod .cse7 4294967296) .cse1) (or (< (mod (+ c_main_~x~0 18) 4294967296) .cse1) (<= .cse2 (mod .cse4 4294967296))) (or (< (mod (+ c_main_~x~0 21) 4294967296) .cse1) (<= .cse2 (mod .cse12 4294967296))) (or (< (mod (+ c_main_~x~0 20) 4294967296) .cse1) (<= .cse2 (mod .cse9 4294967296))) (< (mod .cse14 4294967296) .cse1) (or (< (mod .cse15 4294967296) .cse1) (<= .cse2 (mod .cse14 4294967296))) (or (<= .cse2 (mod .cse5 4294967296)) (< (mod .cse6 4294967296) .cse1)) (or (<= .cse2 (mod .cse15 4294967296)) (< (mod (+ c_main_~x~0 19) 4294967296) .cse1)) (or (< (mod .cse3 4294967296) .cse1) (<= .cse2 (mod .cse13 4294967296))))) is different from false [2020-07-21 17:21:23,350 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_main_~x~0 4)) (.cse8 (+ c_main_~x~0 10)) (.cse10 (+ c_main_~x~0 6)) (.cse7 (+ c_main_~x~0 3)) (.cse4 (+ c_main_~x~0 11)) (.cse11 (+ c_main_~x~0 7)) (.cse9 (+ c_main_~x~0 13)) (.cse13 (+ c_main_~x~0 5)) (.cse5 (+ c_main_~x~0 2)) (.cse6 (+ c_main_~x~0 9)) (.cse14 (+ c_main_~x~0 12)) (.cse3 (+ c_main_~x~0 8)) (.cse1 (mod c_main_~y~0 4294967296)) (.cse2 (mod c_main_~y~0 4294967296)) (.cse12 (+ c_main_~x~0 1))) (and (< (mod .cse0 4294967296) .cse1) (< (mod c_main_~x~0 4294967296) .cse1) (or (<= .cse2 (mod .cse3 4294967296)) (< (mod (+ c_main_~x~0 15) 4294967296) .cse1)) (or (< (mod .cse4 4294967296) .cse1) (<= .cse2 (mod .cse0 4294967296))) (< (mod .cse5 4294967296) .cse1) (or (< (mod (+ c_main_~x~0 16) 4294967296) .cse1) (<= .cse2 (mod .cse6 4294967296))) (or (<= .cse2 (mod .cse7 4294967296)) (< (mod .cse8 4294967296) .cse1)) (or (< (mod .cse9 4294967296) .cse1) (<= .cse2 (mod .cse10 4294967296))) (or (<= .cse2 (mod .cse11 4294967296)) (< (mod (+ c_main_~x~0 14) 4294967296) .cse1)) (or (< (mod (+ c_main_~x~0 17) 4294967296) .cse1) (<= .cse2 (mod .cse8 4294967296))) (< (mod .cse10 4294967296) .cse1) (< (mod .cse12 4294967296) .cse1) (< (mod .cse7 4294967296) .cse1) (or (< (mod (+ c_main_~x~0 18) 4294967296) .cse1) (<= .cse2 (mod .cse4 4294967296))) (or (< (mod .cse11 4294967296) .cse1) (<= .cse2 (mod c_main_~x~0 4294967296))) (or (< (mod (+ c_main_~x~0 20) 4294967296) .cse1) (<= .cse2 (mod .cse9 4294967296))) (< (mod .cse13 4294967296) .cse1) (or (< (mod .cse14 4294967296) .cse1) (<= .cse2 (mod .cse13 4294967296))) (or (<= .cse2 (mod .cse5 4294967296)) (< (mod .cse6 4294967296) .cse1)) (or (<= .cse2 (mod .cse14 4294967296)) (< (mod (+ c_main_~x~0 19) 4294967296) .cse1)) (or (< (mod .cse3 4294967296) .cse1) (<= .cse2 (mod .cse12 4294967296))))) is different from false [2020-07-21 17:21:25,498 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_main_~x~0 4)) (.cse8 (+ c_main_~x~0 10)) (.cse10 (+ c_main_~x~0 6)) (.cse11 (+ c_main_~x~0 7)) (.cse7 (+ c_main_~x~0 3)) (.cse4 (+ c_main_~x~0 11)) (.cse9 (+ c_main_~x~0 13)) (.cse13 (+ c_main_~x~0 5)) (.cse5 (+ c_main_~x~0 2)) (.cse6 (+ c_main_~x~0 9)) (.cse14 (+ c_main_~x~0 12)) (.cse3 (+ c_main_~x~0 8)) (.cse1 (mod c_main_~y~0 4294967296)) (.cse2 (mod c_main_~y~0 4294967296)) (.cse12 (+ c_main_~x~0 1))) (and (< (mod .cse0 4294967296) .cse1) (or (<= .cse2 (mod .cse3 4294967296)) (< (mod (+ c_main_~x~0 15) 4294967296) .cse1)) (or (< (mod .cse4 4294967296) .cse1) (<= .cse2 (mod .cse0 4294967296))) (< (mod .cse5 4294967296) .cse1) (or (< (mod (+ c_main_~x~0 16) 4294967296) .cse1) (<= .cse2 (mod .cse6 4294967296))) (or (<= .cse2 (mod .cse7 4294967296)) (< (mod .cse8 4294967296) .cse1)) (or (< (mod .cse9 4294967296) .cse1) (<= .cse2 (mod .cse10 4294967296))) (or (<= .cse2 (mod .cse11 4294967296)) (< (mod (+ c_main_~x~0 14) 4294967296) .cse1)) (or (< (mod (+ c_main_~x~0 17) 4294967296) .cse1) (<= .cse2 (mod .cse8 4294967296))) (< (mod .cse10 4294967296) .cse1) (< (mod .cse12 4294967296) .cse1) (< (mod .cse11 4294967296) .cse1) (< (mod .cse7 4294967296) .cse1) (or (< (mod (+ c_main_~x~0 18) 4294967296) .cse1) (<= .cse2 (mod .cse4 4294967296))) (or (< (mod (+ c_main_~x~0 20) 4294967296) .cse1) (<= .cse2 (mod .cse9 4294967296))) (< (mod .cse13 4294967296) .cse1) (or (< (mod .cse14 4294967296) .cse1) (<= .cse2 (mod .cse13 4294967296))) (or (<= .cse2 (mod .cse5 4294967296)) (< (mod .cse6 4294967296) .cse1)) (or (<= .cse2 (mod .cse14 4294967296)) (< (mod (+ c_main_~x~0 19) 4294967296) .cse1)) (or (< (mod .cse3 4294967296) .cse1) (<= .cse2 (mod .cse12 4294967296))))) is different from false [2020-07-21 17:21:27,536 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_main_~x~0 4)) (.cse8 (+ c_main_~x~0 10)) (.cse9 (+ c_main_~x~0 6)) (.cse7 (+ c_main_~x~0 3)) (.cse4 (+ c_main_~x~0 11)) (.cse10 (+ c_main_~x~0 7)) (.cse12 (+ c_main_~x~0 5)) (.cse5 (+ c_main_~x~0 2)) (.cse6 (+ c_main_~x~0 9)) (.cse13 (+ c_main_~x~0 12)) (.cse3 (+ c_main_~x~0 8)) (.cse1 (mod c_main_~y~0 4294967296)) (.cse2 (mod c_main_~y~0 4294967296)) (.cse11 (+ c_main_~x~0 1))) (and (< (mod .cse0 4294967296) .cse1) (< (mod c_main_~x~0 4294967296) .cse1) (or (<= .cse2 (mod .cse3 4294967296)) (< (mod (+ c_main_~x~0 15) 4294967296) .cse1)) (or (< (mod .cse4 4294967296) .cse1) (<= .cse2 (mod .cse0 4294967296))) (< (mod .cse5 4294967296) .cse1) (or (< (mod (+ c_main_~x~0 16) 4294967296) .cse1) (<= .cse2 (mod .cse6 4294967296))) (or (<= .cse2 (mod .cse7 4294967296)) (< (mod .cse8 4294967296) .cse1)) (or (< (mod (+ c_main_~x~0 13) 4294967296) .cse1) (<= .cse2 (mod .cse9 4294967296))) (or (<= .cse2 (mod .cse10 4294967296)) (< (mod (+ c_main_~x~0 14) 4294967296) .cse1)) (or (< (mod (+ c_main_~x~0 17) 4294967296) .cse1) (<= .cse2 (mod .cse8 4294967296))) (< (mod .cse9 4294967296) .cse1) (< (mod .cse11 4294967296) .cse1) (< (mod .cse7 4294967296) .cse1) (or (< (mod (+ c_main_~x~0 18) 4294967296) .cse1) (<= .cse2 (mod .cse4 4294967296))) (or (< (mod .cse10 4294967296) .cse1) (<= .cse2 (mod c_main_~x~0 4294967296))) (< (mod .cse12 4294967296) .cse1) (or (< (mod .cse13 4294967296) .cse1) (<= .cse2 (mod .cse12 4294967296))) (or (<= .cse2 (mod .cse5 4294967296)) (< (mod .cse6 4294967296) .cse1)) (or (<= .cse2 (mod .cse13 4294967296)) (< (mod (+ c_main_~x~0 19) 4294967296) .cse1)) (or (< (mod .cse3 4294967296) .cse1) (<= .cse2 (mod .cse11 4294967296))))) is different from false [2020-07-21 17:21:29,550 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_main_~x~0 4)) (.cse8 (+ c_main_~x~0 10)) (.cse9 (+ c_main_~x~0 6)) (.cse10 (+ c_main_~x~0 7)) (.cse7 (+ c_main_~x~0 3)) (.cse4 (+ c_main_~x~0 11)) (.cse12 (+ c_main_~x~0 5)) (.cse5 (+ c_main_~x~0 2)) (.cse6 (+ c_main_~x~0 9)) (.cse13 (+ c_main_~x~0 12)) (.cse3 (+ c_main_~x~0 8)) (.cse1 (mod c_main_~y~0 4294967296)) (.cse2 (mod c_main_~y~0 4294967296)) (.cse11 (+ c_main_~x~0 1))) (and (< (mod .cse0 4294967296) .cse1) (or (<= .cse2 (mod .cse3 4294967296)) (< (mod (+ c_main_~x~0 15) 4294967296) .cse1)) (or (< (mod .cse4 4294967296) .cse1) (<= .cse2 (mod .cse0 4294967296))) (< (mod .cse5 4294967296) .cse1) (or (< (mod (+ c_main_~x~0 16) 4294967296) .cse1) (<= .cse2 (mod .cse6 4294967296))) (or (<= .cse2 (mod .cse7 4294967296)) (< (mod .cse8 4294967296) .cse1)) (or (< (mod (+ c_main_~x~0 13) 4294967296) .cse1) (<= .cse2 (mod .cse9 4294967296))) (or (<= .cse2 (mod .cse10 4294967296)) (< (mod (+ c_main_~x~0 14) 4294967296) .cse1)) (or (< (mod (+ c_main_~x~0 17) 4294967296) .cse1) (<= .cse2 (mod .cse8 4294967296))) (< (mod .cse9 4294967296) .cse1) (< (mod .cse11 4294967296) .cse1) (< (mod .cse10 4294967296) .cse1) (< (mod .cse7 4294967296) .cse1) (or (< (mod (+ c_main_~x~0 18) 4294967296) .cse1) (<= .cse2 (mod .cse4 4294967296))) (< (mod .cse12 4294967296) .cse1) (or (< (mod .cse13 4294967296) .cse1) (<= .cse2 (mod .cse12 4294967296))) (or (<= .cse2 (mod .cse5 4294967296)) (< (mod .cse6 4294967296) .cse1)) (or (<= .cse2 (mod .cse13 4294967296)) (< (mod (+ c_main_~x~0 19) 4294967296) .cse1)) (or (< (mod .cse3 4294967296) .cse1) (<= .cse2 (mod .cse11 4294967296))))) is different from false [2020-07-21 17:21:31,585 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_main_~x~0 4)) (.cse8 (+ c_main_~x~0 10)) (.cse9 (+ c_main_~x~0 6)) (.cse7 (+ c_main_~x~0 3)) (.cse4 (+ c_main_~x~0 11)) (.cse10 (+ c_main_~x~0 7)) (.cse12 (+ c_main_~x~0 5)) (.cse5 (+ c_main_~x~0 2)) (.cse6 (+ c_main_~x~0 9)) (.cse3 (+ c_main_~x~0 8)) (.cse1 (mod c_main_~y~0 4294967296)) (.cse2 (mod c_main_~y~0 4294967296)) (.cse11 (+ c_main_~x~0 1))) (and (< (mod .cse0 4294967296) .cse1) (< (mod c_main_~x~0 4294967296) .cse1) (or (<= .cse2 (mod .cse3 4294967296)) (< (mod (+ c_main_~x~0 15) 4294967296) .cse1)) (or (< (mod .cse4 4294967296) .cse1) (<= .cse2 (mod .cse0 4294967296))) (< (mod .cse5 4294967296) .cse1) (or (< (mod (+ c_main_~x~0 16) 4294967296) .cse1) (<= .cse2 (mod .cse6 4294967296))) (or (<= .cse2 (mod .cse7 4294967296)) (< (mod .cse8 4294967296) .cse1)) (or (< (mod (+ c_main_~x~0 13) 4294967296) .cse1) (<= .cse2 (mod .cse9 4294967296))) (or (<= .cse2 (mod .cse10 4294967296)) (< (mod (+ c_main_~x~0 14) 4294967296) .cse1)) (or (< (mod (+ c_main_~x~0 17) 4294967296) .cse1) (<= .cse2 (mod .cse8 4294967296))) (< (mod .cse9 4294967296) .cse1) (< (mod .cse11 4294967296) .cse1) (< (mod .cse7 4294967296) .cse1) (or (< (mod (+ c_main_~x~0 18) 4294967296) .cse1) (<= .cse2 (mod .cse4 4294967296))) (or (< (mod .cse10 4294967296) .cse1) (<= .cse2 (mod c_main_~x~0 4294967296))) (< (mod .cse12 4294967296) .cse1) (or (< (mod (+ c_main_~x~0 12) 4294967296) .cse1) (<= .cse2 (mod .cse12 4294967296))) (or (<= .cse2 (mod .cse5 4294967296)) (< (mod .cse6 4294967296) .cse1)) (or (< (mod .cse3 4294967296) .cse1) (<= .cse2 (mod .cse11 4294967296))))) is different from false [2020-07-21 17:21:33,601 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_main_~x~0 4)) (.cse8 (+ c_main_~x~0 10)) (.cse9 (+ c_main_~x~0 6)) (.cse10 (+ c_main_~x~0 7)) (.cse7 (+ c_main_~x~0 3)) (.cse4 (+ c_main_~x~0 11)) (.cse12 (+ c_main_~x~0 5)) (.cse5 (+ c_main_~x~0 2)) (.cse6 (+ c_main_~x~0 9)) (.cse3 (+ c_main_~x~0 8)) (.cse1 (mod c_main_~y~0 4294967296)) (.cse2 (mod c_main_~y~0 4294967296)) (.cse11 (+ c_main_~x~0 1))) (and (< (mod .cse0 4294967296) .cse1) (or (<= .cse2 (mod .cse3 4294967296)) (< (mod (+ c_main_~x~0 15) 4294967296) .cse1)) (or (< (mod .cse4 4294967296) .cse1) (<= .cse2 (mod .cse0 4294967296))) (< (mod .cse5 4294967296) .cse1) (or (< (mod (+ c_main_~x~0 16) 4294967296) .cse1) (<= .cse2 (mod .cse6 4294967296))) (or (<= .cse2 (mod .cse7 4294967296)) (< (mod .cse8 4294967296) .cse1)) (or (< (mod (+ c_main_~x~0 13) 4294967296) .cse1) (<= .cse2 (mod .cse9 4294967296))) (or (<= .cse2 (mod .cse10 4294967296)) (< (mod (+ c_main_~x~0 14) 4294967296) .cse1)) (or (< (mod (+ c_main_~x~0 17) 4294967296) .cse1) (<= .cse2 (mod .cse8 4294967296))) (< (mod .cse9 4294967296) .cse1) (< (mod .cse11 4294967296) .cse1) (< (mod .cse10 4294967296) .cse1) (< (mod .cse7 4294967296) .cse1) (or (< (mod (+ c_main_~x~0 18) 4294967296) .cse1) (<= .cse2 (mod .cse4 4294967296))) (< (mod .cse12 4294967296) .cse1) (or (< (mod (+ c_main_~x~0 12) 4294967296) .cse1) (<= .cse2 (mod .cse12 4294967296))) (or (<= .cse2 (mod .cse5 4294967296)) (< (mod .cse6 4294967296) .cse1)) (or (< (mod .cse3 4294967296) .cse1) (<= .cse2 (mod .cse11 4294967296))))) is different from false [2020-07-21 17:21:35,630 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_main_~x~0 4)) (.cse7 (+ c_main_~x~0 10)) (.cse8 (+ c_main_~x~0 6)) (.cse6 (+ c_main_~x~0 3)) (.cse9 (+ c_main_~x~0 7)) (.cse11 (+ c_main_~x~0 5)) (.cse4 (+ c_main_~x~0 2)) (.cse5 (+ c_main_~x~0 9)) (.cse3 (+ c_main_~x~0 8)) (.cse1 (mod c_main_~y~0 4294967296)) (.cse2 (mod c_main_~y~0 4294967296)) (.cse10 (+ c_main_~x~0 1))) (and (< (mod .cse0 4294967296) .cse1) (< (mod c_main_~x~0 4294967296) .cse1) (or (<= .cse2 (mod .cse3 4294967296)) (< (mod (+ c_main_~x~0 15) 4294967296) .cse1)) (or (< (mod (+ c_main_~x~0 11) 4294967296) .cse1) (<= .cse2 (mod .cse0 4294967296))) (< (mod .cse4 4294967296) .cse1) (or (< (mod (+ c_main_~x~0 16) 4294967296) .cse1) (<= .cse2 (mod .cse5 4294967296))) (or (<= .cse2 (mod .cse6 4294967296)) (< (mod .cse7 4294967296) .cse1)) (or (< (mod (+ c_main_~x~0 13) 4294967296) .cse1) (<= .cse2 (mod .cse8 4294967296))) (or (<= .cse2 (mod .cse9 4294967296)) (< (mod (+ c_main_~x~0 14) 4294967296) .cse1)) (or (< (mod (+ c_main_~x~0 17) 4294967296) .cse1) (<= .cse2 (mod .cse7 4294967296))) (< (mod .cse8 4294967296) .cse1) (< (mod .cse10 4294967296) .cse1) (< (mod .cse6 4294967296) .cse1) (or (< (mod .cse9 4294967296) .cse1) (<= .cse2 (mod c_main_~x~0 4294967296))) (< (mod .cse11 4294967296) .cse1) (or (< (mod (+ c_main_~x~0 12) 4294967296) .cse1) (<= .cse2 (mod .cse11 4294967296))) (or (<= .cse2 (mod .cse4 4294967296)) (< (mod .cse5 4294967296) .cse1)) (or (< (mod .cse3 4294967296) .cse1) (<= .cse2 (mod .cse10 4294967296))))) is different from false [2020-07-21 17:21:37,640 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_main_~x~0 4)) (.cse7 (+ c_main_~x~0 10)) (.cse8 (+ c_main_~x~0 6)) (.cse9 (+ c_main_~x~0 7)) (.cse6 (+ c_main_~x~0 3)) (.cse11 (+ c_main_~x~0 5)) (.cse4 (+ c_main_~x~0 2)) (.cse5 (+ c_main_~x~0 9)) (.cse3 (+ c_main_~x~0 8)) (.cse1 (mod c_main_~y~0 4294967296)) (.cse2 (mod c_main_~y~0 4294967296)) (.cse10 (+ c_main_~x~0 1))) (and (< (mod .cse0 4294967296) .cse1) (or (<= .cse2 (mod .cse3 4294967296)) (< (mod (+ c_main_~x~0 15) 4294967296) .cse1)) (or (< (mod (+ c_main_~x~0 11) 4294967296) .cse1) (<= .cse2 (mod .cse0 4294967296))) (< (mod .cse4 4294967296) .cse1) (or (< (mod (+ c_main_~x~0 16) 4294967296) .cse1) (<= .cse2 (mod .cse5 4294967296))) (or (<= .cse2 (mod .cse6 4294967296)) (< (mod .cse7 4294967296) .cse1)) (or (< (mod (+ c_main_~x~0 13) 4294967296) .cse1) (<= .cse2 (mod .cse8 4294967296))) (or (<= .cse2 (mod .cse9 4294967296)) (< (mod (+ c_main_~x~0 14) 4294967296) .cse1)) (or (< (mod (+ c_main_~x~0 17) 4294967296) .cse1) (<= .cse2 (mod .cse7 4294967296))) (< (mod .cse8 4294967296) .cse1) (< (mod .cse10 4294967296) .cse1) (< (mod .cse9 4294967296) .cse1) (< (mod .cse6 4294967296) .cse1) (< (mod .cse11 4294967296) .cse1) (or (< (mod (+ c_main_~x~0 12) 4294967296) .cse1) (<= .cse2 (mod .cse11 4294967296))) (or (<= .cse2 (mod .cse4 4294967296)) (< (mod .cse5 4294967296) .cse1)) (or (< (mod .cse3 4294967296) .cse1) (<= .cse2 (mod .cse10 4294967296))))) is different from false [2020-07-21 17:24:43,532 WARN L193 SmtUtils]: Spent 2.90 m on a formula simplification. DAG size of input: 130 DAG size of output: 88 [2020-07-21 17:24:57,634 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_main_~x~0 4)) (.cse7 (+ c_main_~x~0 6)) (.cse8 (+ c_main_~x~0 7)) (.cse6 (+ c_main_~x~0 3)) (.cse10 (+ c_main_~x~0 5)) (.cse4 (+ c_main_~x~0 2)) (.cse5 (+ c_main_~x~0 9)) (.cse3 (+ c_main_~x~0 8)) (.cse1 (mod c_main_~y~0 4294967296)) (.cse2 (mod c_main_~y~0 4294967296)) (.cse9 (+ c_main_~x~0 1))) (and (< (mod .cse0 4294967296) .cse1) (< (mod c_main_~x~0 4294967296) .cse1) (or (<= .cse2 (mod .cse3 4294967296)) (< (mod (+ c_main_~x~0 15) 4294967296) .cse1)) (or (< (mod (+ c_main_~x~0 11) 4294967296) .cse1) (<= .cse2 (mod .cse0 4294967296))) (< (mod .cse4 4294967296) .cse1) (or (< (mod (+ c_main_~x~0 16) 4294967296) .cse1) (<= .cse2 (mod .cse5 4294967296))) (or (<= .cse2 (mod .cse6 4294967296)) (< (mod (+ c_main_~x~0 10) 4294967296) .cse1)) (or (< (mod (+ c_main_~x~0 13) 4294967296) .cse1) (<= .cse2 (mod .cse7 4294967296))) (or (<= .cse2 (mod .cse8 4294967296)) (< (mod (+ c_main_~x~0 14) 4294967296) .cse1)) (< (mod .cse7 4294967296) .cse1) (< (mod .cse9 4294967296) .cse1) (< (mod .cse8 4294967296) .cse1) (< (mod .cse6 4294967296) .cse1) (< (mod .cse10 4294967296) .cse1) (or (< (mod (+ c_main_~x~0 12) 4294967296) .cse1) (<= .cse2 (mod .cse10 4294967296))) (or (<= .cse2 (mod .cse4 4294967296)) (< (mod .cse5 4294967296) .cse1)) (or (< (mod .cse3 4294967296) .cse1) (<= .cse2 (mod .cse9 4294967296))))) is different from false [2020-07-21 17:24:59,761 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_main_~x~0 4)) (.cse7 (+ c_main_~x~0 6)) (.cse8 (+ c_main_~x~0 7)) (.cse6 (+ c_main_~x~0 3)) (.cse10 (+ c_main_~x~0 5)) (.cse4 (+ c_main_~x~0 2)) (.cse5 (+ c_main_~x~0 9)) (.cse3 (+ c_main_~x~0 8)) (.cse1 (mod c_main_~y~0 4294967296)) (.cse2 (mod c_main_~y~0 4294967296)) (.cse9 (+ c_main_~x~0 1))) (and (< (mod .cse0 4294967296) .cse1) (or (<= .cse2 (mod .cse3 4294967296)) (< (mod (+ c_main_~x~0 15) 4294967296) .cse1)) (or (< (mod (+ c_main_~x~0 11) 4294967296) .cse1) (<= .cse2 (mod .cse0 4294967296))) (< (mod .cse4 4294967296) .cse1) (or (< (mod (+ c_main_~x~0 16) 4294967296) .cse1) (<= .cse2 (mod .cse5 4294967296))) (or (<= .cse2 (mod .cse6 4294967296)) (< (mod (+ c_main_~x~0 10) 4294967296) .cse1)) (or (< (mod (+ c_main_~x~0 13) 4294967296) .cse1) (<= .cse2 (mod .cse7 4294967296))) (or (<= .cse2 (mod .cse8 4294967296)) (< (mod (+ c_main_~x~0 14) 4294967296) .cse1)) (< (mod .cse7 4294967296) .cse1) (< (mod .cse9 4294967296) .cse1) (< (mod .cse8 4294967296) .cse1) (< (mod .cse6 4294967296) .cse1) (< (mod .cse10 4294967296) .cse1) (or (< (mod (+ c_main_~x~0 12) 4294967296) .cse1) (<= .cse2 (mod .cse10 4294967296))) (or (<= .cse2 (mod .cse4 4294967296)) (< (mod .cse5 4294967296) .cse1)) (or (< (mod .cse3 4294967296) .cse1) (<= .cse2 (mod .cse9 4294967296))))) is different from false [2020-07-21 17:25:01,772 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_main_~x~0 4)) (.cse6 (+ c_main_~x~0 6)) (.cse5 (+ c_main_~x~0 3)) (.cse7 (+ c_main_~x~0 7)) (.cse9 (+ c_main_~x~0 5)) (.cse4 (+ c_main_~x~0 2)) (.cse3 (+ c_main_~x~0 8)) (.cse1 (mod c_main_~y~0 4294967296)) (.cse2 (mod c_main_~y~0 4294967296)) (.cse8 (+ c_main_~x~0 1))) (and (< (mod .cse0 4294967296) .cse1) (< (mod c_main_~x~0 4294967296) .cse1) (or (<= .cse2 (mod .cse3 4294967296)) (< (mod (+ c_main_~x~0 15) 4294967296) .cse1)) (or (< (mod (+ c_main_~x~0 11) 4294967296) .cse1) (<= .cse2 (mod .cse0 4294967296))) (< (mod .cse4 4294967296) .cse1) (or (<= .cse2 (mod .cse5 4294967296)) (< (mod (+ c_main_~x~0 10) 4294967296) .cse1)) (or (< (mod (+ c_main_~x~0 13) 4294967296) .cse1) (<= .cse2 (mod .cse6 4294967296))) (or (<= .cse2 (mod .cse7 4294967296)) (< (mod (+ c_main_~x~0 14) 4294967296) .cse1)) (< (mod .cse6 4294967296) .cse1) (< (mod .cse8 4294967296) .cse1) (< (mod .cse5 4294967296) .cse1) (or (< (mod .cse7 4294967296) .cse1) (<= .cse2 (mod c_main_~x~0 4294967296))) (< (mod .cse9 4294967296) .cse1) (or (< (mod (+ c_main_~x~0 12) 4294967296) .cse1) (<= .cse2 (mod .cse9 4294967296))) (or (<= .cse2 (mod .cse4 4294967296)) (< (mod (+ c_main_~x~0 9) 4294967296) .cse1)) (or (< (mod .cse3 4294967296) .cse1) (<= .cse2 (mod .cse8 4294967296))))) is different from false [2020-07-21 17:25:03,789 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_main_~x~0 4)) (.cse6 (+ c_main_~x~0 6)) (.cse7 (+ c_main_~x~0 7)) (.cse5 (+ c_main_~x~0 3)) (.cse9 (+ c_main_~x~0 5)) (.cse4 (+ c_main_~x~0 2)) (.cse3 (+ c_main_~x~0 8)) (.cse1 (mod c_main_~y~0 4294967296)) (.cse2 (mod c_main_~y~0 4294967296)) (.cse8 (+ c_main_~x~0 1))) (and (< (mod .cse0 4294967296) .cse1) (or (<= .cse2 (mod .cse3 4294967296)) (< (mod (+ c_main_~x~0 15) 4294967296) .cse1)) (or (< (mod (+ c_main_~x~0 11) 4294967296) .cse1) (<= .cse2 (mod .cse0 4294967296))) (< (mod .cse4 4294967296) .cse1) (or (<= .cse2 (mod .cse5 4294967296)) (< (mod (+ c_main_~x~0 10) 4294967296) .cse1)) (or (< (mod (+ c_main_~x~0 13) 4294967296) .cse1) (<= .cse2 (mod .cse6 4294967296))) (or (<= .cse2 (mod .cse7 4294967296)) (< (mod (+ c_main_~x~0 14) 4294967296) .cse1)) (< (mod .cse6 4294967296) .cse1) (< (mod .cse8 4294967296) .cse1) (< (mod .cse7 4294967296) .cse1) (< (mod .cse5 4294967296) .cse1) (< (mod .cse9 4294967296) .cse1) (or (< (mod (+ c_main_~x~0 12) 4294967296) .cse1) (<= .cse2 (mod .cse9 4294967296))) (or (<= .cse2 (mod .cse4 4294967296)) (< (mod (+ c_main_~x~0 9) 4294967296) .cse1)) (or (< (mod .cse3 4294967296) .cse1) (<= .cse2 (mod .cse8 4294967296))))) is different from false [2020-07-21 17:27:14,956 WARN L193 SmtUtils]: Spent 1.88 m on a formula simplification. DAG size of input: 112 DAG size of output: 78 [2020-07-21 17:27:29,655 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_main_~x~0 4)) (.cse5 (+ c_main_~x~0 6)) (.cse6 (+ c_main_~x~0 7)) (.cse4 (+ c_main_~x~0 3)) (.cse8 (+ c_main_~x~0 5)) (.cse3 (+ c_main_~x~0 2)) (.cse1 (mod c_main_~y~0 4294967296)) (.cse2 (mod c_main_~y~0 4294967296)) (.cse7 (+ c_main_~x~0 1))) (and (< (mod .cse0 4294967296) .cse1) (< (mod c_main_~x~0 4294967296) .cse1) (or (< (mod (+ c_main_~x~0 11) 4294967296) .cse1) (<= .cse2 (mod .cse0 4294967296))) (< (mod .cse3 4294967296) .cse1) (or (<= .cse2 (mod .cse4 4294967296)) (< (mod (+ c_main_~x~0 10) 4294967296) .cse1)) (or (< (mod (+ c_main_~x~0 13) 4294967296) .cse1) (<= .cse2 (mod .cse5 4294967296))) (or (<= .cse2 (mod .cse6 4294967296)) (< (mod (+ c_main_~x~0 14) 4294967296) .cse1)) (< (mod .cse5 4294967296) .cse1) (< (mod .cse7 4294967296) .cse1) (< (mod .cse6 4294967296) .cse1) (< (mod .cse4 4294967296) .cse1) (< (mod .cse8 4294967296) .cse1) (or (< (mod (+ c_main_~x~0 12) 4294967296) .cse1) (<= .cse2 (mod .cse8 4294967296))) (or (<= .cse2 (mod .cse3 4294967296)) (< (mod (+ c_main_~x~0 9) 4294967296) .cse1)) (or (< (mod (+ c_main_~x~0 8) 4294967296) .cse1) (<= .cse2 (mod .cse7 4294967296))))) is different from false [2020-07-21 17:27:31,881 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_main_~x~0 4)) (.cse5 (+ c_main_~x~0 6)) (.cse6 (+ c_main_~x~0 7)) (.cse4 (+ c_main_~x~0 3)) (.cse8 (+ c_main_~x~0 5)) (.cse3 (+ c_main_~x~0 2)) (.cse1 (mod c_main_~y~0 4294967296)) (.cse2 (mod c_main_~y~0 4294967296)) (.cse7 (+ c_main_~x~0 1))) (and (< (mod .cse0 4294967296) .cse1) (or (< (mod (+ c_main_~x~0 11) 4294967296) .cse1) (<= .cse2 (mod .cse0 4294967296))) (< (mod .cse3 4294967296) .cse1) (or (<= .cse2 (mod .cse4 4294967296)) (< (mod (+ c_main_~x~0 10) 4294967296) .cse1)) (or (< (mod (+ c_main_~x~0 13) 4294967296) .cse1) (<= .cse2 (mod .cse5 4294967296))) (or (<= .cse2 (mod .cse6 4294967296)) (< (mod (+ c_main_~x~0 14) 4294967296) .cse1)) (< (mod .cse5 4294967296) .cse1) (< (mod .cse7 4294967296) .cse1) (< (mod .cse6 4294967296) .cse1) (< (mod .cse4 4294967296) .cse1) (< (mod .cse8 4294967296) .cse1) (or (< (mod (+ c_main_~x~0 12) 4294967296) .cse1) (<= .cse2 (mod .cse8 4294967296))) (or (<= .cse2 (mod .cse3 4294967296)) (< (mod (+ c_main_~x~0 9) 4294967296) .cse1)) (or (< (mod (+ c_main_~x~0 8) 4294967296) .cse1) (<= .cse2 (mod .cse7 4294967296))))) is different from false [2020-07-21 17:27:36,036 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_main_~x~0 4)) (.cse5 (+ c_main_~x~0 6)) (.cse4 (+ c_main_~x~0 3)) (.cse7 (+ c_main_~x~0 5)) (.cse3 (+ c_main_~x~0 2)) (.cse1 (mod c_main_~y~0 4294967296)) (.cse2 (mod c_main_~y~0 4294967296)) (.cse6 (+ c_main_~x~0 1))) (and (< (mod .cse0 4294967296) .cse1) (< (mod c_main_~x~0 4294967296) .cse1) (or (< (mod (+ c_main_~x~0 11) 4294967296) .cse1) (<= .cse2 (mod .cse0 4294967296))) (< (mod .cse3 4294967296) .cse1) (or (<= .cse2 (mod .cse4 4294967296)) (< (mod (+ c_main_~x~0 10) 4294967296) .cse1)) (or (< (mod (+ c_main_~x~0 13) 4294967296) .cse1) (<= .cse2 (mod .cse5 4294967296))) (< (mod .cse5 4294967296) .cse1) (< (mod .cse6 4294967296) .cse1) (< (mod .cse4 4294967296) .cse1) (or (< (mod (+ c_main_~x~0 7) 4294967296) .cse1) (<= .cse2 (mod c_main_~x~0 4294967296))) (< (mod .cse7 4294967296) .cse1) (or (< (mod (+ c_main_~x~0 12) 4294967296) .cse1) (<= .cse2 (mod .cse7 4294967296))) (or (<= .cse2 (mod .cse3 4294967296)) (< (mod (+ c_main_~x~0 9) 4294967296) .cse1)) (or (< (mod (+ c_main_~x~0 8) 4294967296) .cse1) (<= .cse2 (mod .cse6 4294967296))))) is different from false [2020-07-21 17:27:38,049 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_main_~x~0 4)) (.cse5 (+ c_main_~x~0 6)) (.cse4 (+ c_main_~x~0 3)) (.cse7 (+ c_main_~x~0 5)) (.cse3 (+ c_main_~x~0 2)) (.cse1 (mod c_main_~y~0 4294967296)) (.cse2 (mod c_main_~y~0 4294967296)) (.cse6 (+ c_main_~x~0 1))) (and (< (mod .cse0 4294967296) .cse1) (< (mod c_main_~x~0 4294967296) .cse1) (or (< (mod (+ c_main_~x~0 11) 4294967296) .cse1) (<= .cse2 (mod .cse0 4294967296))) (< (mod .cse3 4294967296) .cse1) (or (<= .cse2 (mod .cse4 4294967296)) (< (mod (+ c_main_~x~0 10) 4294967296) .cse1)) (or (< (mod (+ c_main_~x~0 13) 4294967296) .cse1) (<= .cse2 (mod .cse5 4294967296))) (< (mod .cse5 4294967296) .cse1) (< (mod .cse6 4294967296) .cse1) (< (mod (+ c_main_~x~0 7) 4294967296) .cse1) (< (mod .cse4 4294967296) .cse1) (< (mod .cse7 4294967296) .cse1) (or (< (mod (+ c_main_~x~0 12) 4294967296) .cse1) (<= .cse2 (mod .cse7 4294967296))) (or (<= .cse2 (mod .cse3 4294967296)) (< (mod (+ c_main_~x~0 9) 4294967296) .cse1)) (or (< (mod (+ c_main_~x~0 8) 4294967296) .cse1) (<= .cse2 (mod .cse6 4294967296))))) is different from false [2020-07-21 17:27:40,062 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_main_~x~0 4)) (.cse5 (+ c_main_~x~0 6)) (.cse4 (+ c_main_~x~0 3)) (.cse7 (+ c_main_~x~0 5)) (.cse3 (+ c_main_~x~0 2)) (.cse1 (mod c_main_~y~0 4294967296)) (.cse2 (mod c_main_~y~0 4294967296)) (.cse6 (+ c_main_~x~0 1))) (and (< (mod .cse0 4294967296) .cse1) (or (< (mod (+ c_main_~x~0 11) 4294967296) .cse1) (<= .cse2 (mod .cse0 4294967296))) (< (mod .cse3 4294967296) .cse1) (or (<= .cse2 (mod .cse4 4294967296)) (< (mod (+ c_main_~x~0 10) 4294967296) .cse1)) (or (< (mod (+ c_main_~x~0 13) 4294967296) .cse1) (<= .cse2 (mod .cse5 4294967296))) (< (mod .cse5 4294967296) .cse1) (< (mod .cse6 4294967296) .cse1) (< (mod (+ c_main_~x~0 7) 4294967296) .cse1) (< (mod .cse4 4294967296) .cse1) (< (mod .cse7 4294967296) .cse1) (or (< (mod (+ c_main_~x~0 12) 4294967296) .cse1) (<= .cse2 (mod .cse7 4294967296))) (or (<= .cse2 (mod .cse3 4294967296)) (< (mod (+ c_main_~x~0 9) 4294967296) .cse1)) (or (< (mod (+ c_main_~x~0 8) 4294967296) .cse1) (<= .cse2 (mod .cse6 4294967296))))) is different from false [2020-07-21 17:27:42,100 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_main_~x~0 4)) (.cse4 (+ c_main_~x~0 3)) (.cse6 (+ c_main_~x~0 5)) (.cse3 (+ c_main_~x~0 2)) (.cse1 (mod c_main_~y~0 4294967296)) (.cse2 (mod c_main_~y~0 4294967296)) (.cse5 (+ c_main_~x~0 1))) (and (< (mod .cse0 4294967296) .cse1) (< (mod c_main_~x~0 4294967296) .cse1) (or (< (mod (+ c_main_~x~0 11) 4294967296) .cse1) (<= .cse2 (mod .cse0 4294967296))) (< (mod .cse3 4294967296) .cse1) (or (<= .cse2 (mod .cse4 4294967296)) (< (mod (+ c_main_~x~0 10) 4294967296) .cse1)) (< (mod (+ c_main_~x~0 6) 4294967296) .cse1) (< (mod .cse5 4294967296) .cse1) (< (mod .cse4 4294967296) .cse1) (or (< (mod (+ c_main_~x~0 7) 4294967296) .cse1) (<= .cse2 (mod c_main_~x~0 4294967296))) (< (mod .cse6 4294967296) .cse1) (or (< (mod (+ c_main_~x~0 12) 4294967296) .cse1) (<= .cse2 (mod .cse6 4294967296))) (or (<= .cse2 (mod .cse3 4294967296)) (< (mod (+ c_main_~x~0 9) 4294967296) .cse1)) (or (< (mod (+ c_main_~x~0 8) 4294967296) .cse1) (<= .cse2 (mod .cse5 4294967296))))) is different from false [2020-07-21 17:27:44,127 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_main_~x~0 4)) (.cse4 (+ c_main_~x~0 3)) (.cse6 (+ c_main_~x~0 5)) (.cse3 (+ c_main_~x~0 2)) (.cse1 (mod c_main_~y~0 4294967296)) (.cse2 (mod c_main_~y~0 4294967296)) (.cse5 (+ c_main_~x~0 1))) (and (< (mod .cse0 4294967296) .cse1) (< (mod c_main_~x~0 4294967296) .cse1) (or (< (mod (+ c_main_~x~0 11) 4294967296) .cse1) (<= .cse2 (mod .cse0 4294967296))) (< (mod .cse3 4294967296) .cse1) (or (<= .cse2 (mod .cse4 4294967296)) (< (mod (+ c_main_~x~0 10) 4294967296) .cse1)) (< (mod (+ c_main_~x~0 6) 4294967296) .cse1) (< (mod .cse5 4294967296) .cse1) (< (mod (+ c_main_~x~0 7) 4294967296) .cse1) (< (mod .cse4 4294967296) .cse1) (< (mod .cse6 4294967296) .cse1) (or (< (mod (+ c_main_~x~0 12) 4294967296) .cse1) (<= .cse2 (mod .cse6 4294967296))) (or (<= .cse2 (mod .cse3 4294967296)) (< (mod (+ c_main_~x~0 9) 4294967296) .cse1)) (or (< (mod (+ c_main_~x~0 8) 4294967296) .cse1) (<= .cse2 (mod .cse5 4294967296))))) is different from false [2020-07-21 17:27:46,142 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_main_~x~0 4)) (.cse6 (+ c_main_~x~0 5)) (.cse5 (+ c_main_~x~0 2)) (.cse3 (+ c_main_~x~0 3)) (.cse1 (mod c_main_~y~0 4294967296)) (.cse4 (mod c_main_~y~0 4294967296)) (.cse2 (+ c_main_~x~0 1))) (and (< (mod .cse0 4294967296) .cse1) (< (mod (+ c_main_~x~0 6) 4294967296) .cse1) (< (mod .cse2 4294967296) .cse1) (< (mod (+ c_main_~x~0 7) 4294967296) .cse1) (< (mod .cse3 4294967296) .cse1) (or (< (mod (+ c_main_~x~0 11) 4294967296) .cse1) (<= .cse4 (mod .cse0 4294967296))) (< (mod .cse5 4294967296) .cse1) (< (mod .cse6 4294967296) .cse1) (or (< (mod (+ c_main_~x~0 12) 4294967296) .cse1) (<= .cse4 (mod .cse6 4294967296))) (or (<= .cse4 (mod .cse5 4294967296)) (< (mod (+ c_main_~x~0 9) 4294967296) .cse1)) (or (<= .cse4 (mod .cse3 4294967296)) (< (mod (+ c_main_~x~0 10) 4294967296) .cse1)) (or (< (mod (+ c_main_~x~0 8) 4294967296) .cse1) (<= .cse4 (mod .cse2 4294967296))))) is different from false [2020-07-21 17:27:48,187 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_main_~x~0 4)) (.cse5 (+ c_main_~x~0 2)) (.cse3 (+ c_main_~x~0 3)) (.cse1 (mod c_main_~y~0 4294967296)) (.cse4 (mod c_main_~y~0 4294967296)) (.cse2 (+ c_main_~x~0 1))) (and (< (mod .cse0 4294967296) .cse1) (< (mod (+ c_main_~x~0 6) 4294967296) .cse1) (< (mod .cse2 4294967296) .cse1) (< (mod c_main_~x~0 4294967296) .cse1) (< (mod .cse3 4294967296) .cse1) (or (< (mod (+ c_main_~x~0 11) 4294967296) .cse1) (<= .cse4 (mod .cse0 4294967296))) (< (mod .cse5 4294967296) .cse1) (or (< (mod (+ c_main_~x~0 7) 4294967296) .cse1) (<= .cse4 (mod c_main_~x~0 4294967296))) (< (mod (+ c_main_~x~0 5) 4294967296) .cse1) (or (<= .cse4 (mod .cse5 4294967296)) (< (mod (+ c_main_~x~0 9) 4294967296) .cse1)) (or (<= .cse4 (mod .cse3 4294967296)) (< (mod (+ c_main_~x~0 10) 4294967296) .cse1)) (or (< (mod (+ c_main_~x~0 8) 4294967296) .cse1) (<= .cse4 (mod .cse2 4294967296))))) is different from false