/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_FUNCTIONS --traceabstraction.assert.codeblocks.term.scoring.heuristic.partitioning.strategy FIXED_NUM_PARTITIONS --traceabstraction.assert.codeblocks.term.scoring.heuristic.number.of.partitions 4 -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-20 14:48:51,534 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-20 14:48:51,537 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-20 14:48:51,553 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-20 14:48:51,554 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-20 14:48:51,556 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-20 14:48:51,557 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-20 14:48:51,559 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-20 14:48:51,562 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-20 14:48:51,562 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-20 14:48:51,564 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-20 14:48:51,565 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-20 14:48:51,565 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-20 14:48:51,566 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-20 14:48:51,568 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-20 14:48:51,569 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-20 14:48:51,570 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-20 14:48:51,571 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-20 14:48:51,573 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-20 14:48:51,575 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-20 14:48:51,576 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-20 14:48:51,578 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-20 14:48:51,579 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-20 14:48:51,580 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-20 14:48:51,583 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-20 14:48:51,584 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-20 14:48:51,584 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-20 14:48:51,585 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-20 14:48:51,586 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-20 14:48:51,587 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-20 14:48:51,587 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-20 14:48:51,589 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-20 14:48:51,590 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-20 14:48:51,591 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-20 14:48:51,592 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-20 14:48:51,592 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-20 14:48:51,593 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-20 14:48:51,593 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-20 14:48:51,594 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-20 14:48:51,595 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-20 14:48:51,596 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-20 14:48:51,597 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-20 14:48:51,623 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-20 14:48:51,623 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-20 14:48:51,626 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-20 14:48:51,626 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-20 14:48:51,626 INFO L138 SettingsManager]: * Use SBE=true [2020-07-20 14:48:51,626 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-20 14:48:51,627 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-20 14:48:51,627 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-20 14:48:51,627 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-20 14:48:51,627 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-20 14:48:51,628 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-20 14:48:51,628 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-20 14:48:51,629 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-20 14:48:51,629 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-20 14:48:51,629 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-20 14:48:51,630 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-20 14:48:51,630 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-20 14:48:51,630 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-20 14:48:51,630 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-20 14:48:51,630 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-20 14:48:51,631 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-20 14:48:51,631 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-20 14:48:51,631 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-20 14:48:51,631 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-20 14:48:51,631 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-20 14:48:51,632 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-20 14:48:51,632 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 14:48:51,632 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-20 14:48:51,632 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-20 14:48:51,632 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_FUNCTIONS 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 -> 4 [2020-07-20 14:48:52,027 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-20 14:48:52,044 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-20 14:48:52,048 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-20 14:48:52,050 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-20 14:48:52,051 INFO L275 PluginConnector]: CDTParser initialized [2020-07-20 14:48:52,051 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-20 14:48:52,130 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80ff9afe8/cf3f668a149a4fd6bcdb311759eb5310/FLAGb744a3428 [2020-07-20 14:48:52,644 INFO L306 CDTParser]: Found 1 translation units. [2020-07-20 14:48:52,645 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/mono-crafted_12.c [2020-07-20 14:48:52,656 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80ff9afe8/cf3f668a149a4fd6bcdb311759eb5310/FLAGb744a3428 [2020-07-20 14:48:52,985 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80ff9afe8/cf3f668a149a4fd6bcdb311759eb5310 [2020-07-20 14:48:53,000 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-20 14:48:53,004 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-20 14:48:53,005 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-20 14:48:53,005 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-20 14:48:53,010 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-20 14:48:53,011 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 02:48:52" (1/1) ... [2020-07-20 14:48:53,015 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43933f30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:48:53, skipping insertion in model container [2020-07-20 14:48:53,015 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 02:48:52" (1/1) ... [2020-07-20 14:48:53,024 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-20 14:48:53,047 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-20 14:48:53,299 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 14:48:53,305 INFO L203 MainTranslator]: Completed pre-run [2020-07-20 14:48:53,325 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 14:48:53,343 INFO L208 MainTranslator]: Completed translation [2020-07-20 14:48:53,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:48:53 WrapperNode [2020-07-20 14:48:53,344 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-20 14:48:53,345 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-20 14:48:53,345 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-20 14:48:53,345 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-20 14:48:53,361 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:48:53" (1/1) ... [2020-07-20 14:48:53,361 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:48:53" (1/1) ... [2020-07-20 14:48:53,367 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:48:53" (1/1) ... [2020-07-20 14:48:53,367 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:48:53" (1/1) ... [2020-07-20 14:48:53,529 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:48:53" (1/1) ... [2020-07-20 14:48:53,536 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:48:53" (1/1) ... [2020-07-20 14:48:53,537 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:48:53" (1/1) ... [2020-07-20 14:48:53,539 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-20 14:48:53,540 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-20 14:48:53,540 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-20 14:48:53,540 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-20 14:48:53,542 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:48:53" (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-20 14:48:53,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-20 14:48:53,621 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-20 14:48:53,621 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-20 14:48:53,621 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-20 14:48:53,622 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-20 14:48:53,622 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-20 14:48:53,622 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-20 14:48:53,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-20 14:48:53,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-20 14:48:53,830 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-20 14:48:53,831 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-20 14:48:53,835 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 02:48:53 BoogieIcfgContainer [2020-07-20 14:48:53,836 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-20 14:48:53,837 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-20 14:48:53,837 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-20 14:48:53,841 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-20 14:48:53,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 02:48:52" (1/3) ... [2020-07-20 14:48:53,843 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45b82856 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 02:48:53, skipping insertion in model container [2020-07-20 14:48:53,843 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 02:48:53" (2/3) ... [2020-07-20 14:48:53,844 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45b82856 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 02:48:53, skipping insertion in model container [2020-07-20 14:48:53,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 02:48:53" (3/3) ... [2020-07-20 14:48:53,846 INFO L109 eAbstractionObserver]: Analyzing ICFG mono-crafted_12.c [2020-07-20 14:48:53,859 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBPonlyIfFpWasNotPerfect Determinization: PREDICATE_ABSTRACTION [2020-07-20 14:48:53,867 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-20 14:48:53,884 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-20 14:48:53,912 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-20 14:48:53,913 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-20 14:48:53,913 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBPonlyIfFpWasNotPerfect [2020-07-20 14:48:53,913 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-20 14:48:53,913 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-20 14:48:53,914 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-20 14:48:53,914 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-20 14:48:53,914 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-20 14:48:53,936 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2020-07-20 14:48:53,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-20 14:48:53,944 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 14:48:53,945 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 14:48:53,946 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 14:48:53,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 14:48:53,953 INFO L82 PathProgramCache]: Analyzing trace with hash -147882559, now seen corresponding path program 1 times [2020-07-20 14:48:53,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 14:48:53,964 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1057812605] [2020-07-20 14:48:53,965 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 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-20 14:48:54,045 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 14:48:54,046 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 14:48:54,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 1 conjunts are in the unsatisfiable core [2020-07-20 14:48:54,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 14:48:54,081 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-20 14:48:54,082 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 14:48:54,083 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1057812605] [2020-07-20 14:48:54,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 14:48:54,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-20 14:48:54,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449301855] [2020-07-20 14:48:54,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-20 14:48:54,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 14:48:54,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-20 14:48:54,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-20 14:48:54,111 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2020-07-20 14:48:54,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 14:48:54,134 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2020-07-20 14:48:54,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-20 14:48:54,135 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-07-20 14:48:54,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 14:48:54,143 INFO L225 Difference]: With dead ends: 32 [2020-07-20 14:48:54,143 INFO L226 Difference]: Without dead ends: 13 [2020-07-20 14:48:54,147 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-20 14:48:54,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2020-07-20 14:48:54,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-07-20 14:48:54,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-20 14:48:54,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2020-07-20 14:48:54,183 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2020-07-20 14:48:54,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 14:48:54,184 INFO L479 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2020-07-20 14:48:54,184 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-20 14:48:54,184 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2020-07-20 14:48:54,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-20 14:48:54,185 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 14:48:54,185 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 14:48:54,400 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 14:48:54,401 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 14:48:54,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 14:48:54,402 INFO L82 PathProgramCache]: Analyzing trace with hash -158041290, now seen corresponding path program 1 times [2020-07-20 14:48:54,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 14:48:54,403 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1201204975] [2020-07-20 14:48:54,403 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 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-20 14:48:54,461 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 1 check-sat command(s) [2020-07-20 14:48:54,462 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 14:48:54,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-20 14:48:54,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 14:48:54,517 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-20 14:48:54,520 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 14:48:54,521 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1201204975] [2020-07-20 14:48:54,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 14:48:54,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 14:48:54,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423859120] [2020-07-20 14:48:54,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 14:48:54,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 14:48:54,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 14:48:54,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 14:48:54,527 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 3 states. [2020-07-20 14:48:54,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 14:48:54,579 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2020-07-20 14:48:54,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 14:48:54,580 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-07-20 14:48:54,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 14:48:54,581 INFO L225 Difference]: With dead ends: 24 [2020-07-20 14:48:54,581 INFO L226 Difference]: Without dead ends: 16 [2020-07-20 14:48:54,583 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-20 14:48:54,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-07-20 14:48:54,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2020-07-20 14:48:54,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-20 14:48:54,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2020-07-20 14:48:54,589 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2020-07-20 14:48:54,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 14:48:54,589 INFO L479 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2020-07-20 14:48:54,589 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 14:48:54,590 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2020-07-20 14:48:54,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-20 14:48:54,590 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 14:48:54,590 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 14:48:54,804 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 14:48:54,805 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 14:48:54,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 14:48:54,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1776138601, now seen corresponding path program 1 times [2020-07-20 14:48:54,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 14:48:54,807 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [693613878] [2020-07-20 14:48:54,807 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 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-20 14:48:54,847 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-20 14:48:54,848 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 14:48:54,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-20 14:48:54,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 14:48:54,899 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-20 14:48:54,899 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 14:48:54,994 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-20 14:48:54,994 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [693613878] [2020-07-20 14:48:54,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 14:48:54,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2020-07-20 14:48:54,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280789606] [2020-07-20 14:48:54,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-20 14:48:54,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 14:48:54,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-20 14:48:54,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-07-20 14:48:54,997 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 7 states. [2020-07-20 14:48:55,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 14:48:55,107 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2020-07-20 14:48:55,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-20 14:48:55,108 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2020-07-20 14:48:55,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 14:48:55,109 INFO L225 Difference]: With dead ends: 31 [2020-07-20 14:48:55,110 INFO L226 Difference]: Without dead ends: 23 [2020-07-20 14:48:55,111 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-20 14:48:55,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-20 14:48:55,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-07-20 14:48:55,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-20 14:48:55,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2020-07-20 14:48:55,118 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 13 [2020-07-20 14:48:55,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 14:48:55,118 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2020-07-20 14:48:55,118 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-20 14:48:55,118 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2020-07-20 14:48:55,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-20 14:48:55,119 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 14:48:55,120 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 14:48:55,334 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 14:48:55,335 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 14:48:55,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 14:48:55,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1289106634, now seen corresponding path program 1 times [2020-07-20 14:48:55,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 14:48:55,337 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [980651307] [2020-07-20 14:48:55,338 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 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-20 14:48:55,384 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 14:48:55,385 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 14:48:55,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-20 14:48:55,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 14:48:55,418 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-20 14:48:55,418 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 14:48:55,474 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-20 14:48:55,474 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [980651307] [2020-07-20 14:48:55,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 14:48:55,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2020-07-20 14:48:55,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222584494] [2020-07-20 14:48:55,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-20 14:48:55,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 14:48:55,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-20 14:48:55,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-07-20 14:48:55,477 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 8 states. [2020-07-20 14:48:59,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 14:48:59,905 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2020-07-20 14:48:59,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-20 14:48:59,906 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-07-20 14:48:59,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 14:48:59,909 INFO L225 Difference]: With dead ends: 43 [2020-07-20 14:48:59,910 INFO L226 Difference]: Without dead ends: 33 [2020-07-20 14:48:59,910 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-07-20 14:48:59,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-20 14:48:59,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2020-07-20 14:48:59,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-20 14:48:59,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2020-07-20 14:48:59,920 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 22 [2020-07-20 14:48:59,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 14:48:59,921 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2020-07-20 14:48:59,921 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-20 14:48:59,921 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2020-07-20 14:48:59,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-20 14:48:59,922 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 14:48:59,922 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 14:49:00,132 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 14:49:00,133 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 14:49:00,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 14:49:00,134 INFO L82 PathProgramCache]: Analyzing trace with hash 92873718, now seen corresponding path program 2 times [2020-07-20 14:49:00,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 14:49:00,136 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [408164433] [2020-07-20 14:49:00,136 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 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-20 14:49:00,167 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 14:49:00,167 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 14:49:00,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-20 14:49:00,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 14:49:00,277 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-20 14:49:00,278 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 14:49:00,517 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-20 14:49:00,518 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [408164433] [2020-07-20 14:49:00,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 14:49:00,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2020-07-20 14:49:00,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777140895] [2020-07-20 14:49:00,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-20 14:49:00,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 14:49:00,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-20 14:49:00,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2020-07-20 14:49:00,521 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 13 states. [2020-07-20 14:49:01,021 WARN L193 SmtUtils]: Spent 307.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2020-07-20 14:49:03,085 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 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 3) 4294967296) .cse0) (< (mod c_main_~x~0 4294967296) .cse0))) is different from false [2020-07-20 14:49:08,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 14:49:08,232 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2020-07-20 14:49:08,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-20 14:49:08,232 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2020-07-20 14:49:08,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 14:49:08,234 INFO L225 Difference]: With dead ends: 48 [2020-07-20 14:49:08,234 INFO L226 Difference]: Without dead ends: 43 [2020-07-20 14:49:08,235 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=102, Invalid=173, Unknown=1, NotChecked=30, Total=306 [2020-07-20 14:49:08,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-07-20 14:49:08,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2020-07-20 14:49:08,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-20 14:49:08,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2020-07-20 14:49:08,247 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 22 [2020-07-20 14:49:08,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 14:49:08,247 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2020-07-20 14:49:08,247 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-20 14:49:08,247 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2020-07-20 14:49:08,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-20 14:49:08,251 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 14:49:08,251 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 14:49:08,452 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 14:49:08,453 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 14:49:08,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 14:49:08,455 INFO L82 PathProgramCache]: Analyzing trace with hash -760785930, now seen corresponding path program 2 times [2020-07-20 14:49:08,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 14:49:08,455 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1651724448] [2020-07-20 14:49:08,456 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 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-20 14:49:08,490 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 14:49:08,490 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 14:49:08,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 15 conjunts are in the unsatisfiable core [2020-07-20 14:49:08,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 14:49:08,558 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 33 proven. 57 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-20 14:49:08,559 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 14:49:08,779 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 33 proven. 57 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-20 14:49:08,780 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1651724448] [2020-07-20 14:49:08,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 14:49:08,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2020-07-20 14:49:08,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83307121] [2020-07-20 14:49:08,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-20 14:49:08,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 14:49:08,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-20 14:49:08,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2020-07-20 14:49:08,782 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 16 states. [2020-07-20 14:49:09,296 WARN L193 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 11 [2020-07-20 14:49:11,366 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 4) 4294967296) 5000000) (< (mod (+ c_main_~x~0 3) 4294967296) 5000000) (< (mod (+ c_main_~x~0 2) 4294967296) 5000000) (< (mod (+ c_main_~x~0 5) 4294967296) 5000000) (< (mod c_main_~x~0 4294967296) 5000000) (< (mod (+ c_main_~x~0 1) 4294967296) 5000000)) is different from false [2020-07-20 14:49:13,784 WARN L193 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 13 [2020-07-20 14:49:14,271 WARN L193 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 11 [2020-07-20 14:49:17,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 14:49:17,279 INFO L93 Difference]: Finished difference Result 75 states and 91 transitions. [2020-07-20 14:49:17,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-07-20 14:49:17,283 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 34 [2020-07-20 14:49:17,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 14:49:17,284 INFO L225 Difference]: With dead ends: 75 [2020-07-20 14:49:17,284 INFO L226 Difference]: Without dead ends: 59 [2020-07-20 14:49:17,287 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=170, Invalid=294, Unknown=2, NotChecked=40, Total=506 [2020-07-20 14:49:17,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-07-20 14:49:17,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 54. [2020-07-20 14:49:17,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-07-20 14:49:17,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2020-07-20 14:49:17,307 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 34 [2020-07-20 14:49:17,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 14:49:17,308 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2020-07-20 14:49:17,308 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-20 14:49:17,308 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2020-07-20 14:49:17,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-20 14:49:17,311 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 14:49:17,312 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 14:49:17,525 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 14:49:17,526 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 14:49:17,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 14:49:17,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1588607722, now seen corresponding path program 3 times [2020-07-20 14:49:17,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 14:49:17,527 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [468355350] [2020-07-20 14:49:17,527 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 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-20 14:49:17,573 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-20 14:49:17,574 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 14:49:17,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 26 conjunts are in the unsatisfiable core [2020-07-20 14:49:17,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 14:49:17,751 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-20 14:49:17,752 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 14:49:18,303 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-20 14:49:18,304 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [468355350] [2020-07-20 14:49:18,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 14:49:18,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2020-07-20 14:49:18,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772127806] [2020-07-20 14:49:18,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-07-20 14:49:18,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 14:49:18,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-07-20 14:49:18,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=420, Unknown=0, NotChecked=0, Total=600 [2020-07-20 14:49:18,306 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 25 states. [2020-07-20 14:49:20,657 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~y~0 4294967296))) (and (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod c_main_~x~0 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 10) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 3) 4294967296) .cse0))) is different from false [2020-07-20 14:49:45,513 WARN L193 SmtUtils]: Spent 21.16 s on a formula simplification that was a NOOP. DAG size: 55 [2020-07-20 14:49:47,590 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~y~0 4294967296))) (and (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod c_main_~x~0 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 3) 4294967296) .cse0))) is different from false [2020-07-20 14:49:49,602 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~y~0 4294967296))) (and (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 3) 4294967296) .cse0))) is different from false [2020-07-20 14:49:51,620 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~y~0 4294967296))) (and (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod c_main_~x~0 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 3) 4294967296) .cse0))) is different from false [2020-07-20 14:49:53,630 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~y~0 4294967296))) (and (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 3) 4294967296) .cse0))) is different from false [2020-07-20 14:50:05,261 WARN L193 SmtUtils]: Spent 9.54 s on a formula simplification that was a NOOP. DAG size: 43 [2020-07-20 14:50:16,262 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~y~0 4294967296))) (and (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod c_main_~x~0 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 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-20 14:50:19,891 WARN L193 SmtUtils]: Spent 479.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-07-20 14:50:24,891 WARN L193 SmtUtils]: Spent 899.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2020-07-20 14:50:30,073 WARN L193 SmtUtils]: Spent 2.18 s on a formula simplification that was a NOOP. DAG size: 28 [2020-07-20 14:50:32,228 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~y~0 4294967296))) (and (< (mod c_main_~x~0 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 3) 4294967296) .cse0))) is different from false [2020-07-20 14:50:37,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 14:50:37,265 INFO L93 Difference]: Finished difference Result 84 states and 103 transitions. [2020-07-20 14:50:37,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-07-20 14:50:37,267 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 40 [2020-07-20 14:50:37,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 14:50:37,269 INFO L225 Difference]: With dead ends: 84 [2020-07-20 14:50:37,269 INFO L226 Difference]: Without dead ends: 79 [2020-07-20 14:50:37,270 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 65.3s TimeCoverageRelationStatistics Valid=359, Invalid=714, Unknown=11, NotChecked=476, Total=1560 [2020-07-20 14:50:37,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-07-20 14:50:37,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2020-07-20 14:50:37,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-07-20 14:50:37,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2020-07-20 14:50:37,281 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 40 [2020-07-20 14:50:37,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 14:50:37,281 INFO L479 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2020-07-20 14:50:37,282 INFO L480 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-07-20 14:50:37,282 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2020-07-20 14:50:37,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-07-20 14:50:37,284 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 14:50:37,284 INFO L422 BasicCegarLoop]: trace histogram [22, 22, 14, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 14:50:37,498 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 14:50:37,499 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 14:50:37,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 14:50:37,500 INFO L82 PathProgramCache]: Analyzing trace with hash 557116502, now seen corresponding path program 3 times [2020-07-20 14:50:37,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 14:50:37,501 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [798824897] [2020-07-20 14:50:37,501 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 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-20 14:50:37,557 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-20 14:50:37,558 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 14:50:37,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 31 conjunts are in the unsatisfiable core [2020-07-20 14:50:37,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 14:50:37,722 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 337 proven. 301 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2020-07-20 14:50:37,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 14:50:40,532 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 337 proven. 298 refuted. 3 times theorem prover too weak. 77 trivial. 0 not checked. [2020-07-20 14:50:40,533 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [798824897] [2020-07-20 14:50:40,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 14:50:40,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2020-07-20 14:50:40,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054086422] [2020-07-20 14:50:40,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2020-07-20 14:50:40,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 14:50:40,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2020-07-20 14:50:40,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=705, Unknown=1, NotChecked=0, Total=992 [2020-07-20 14:50:40,535 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand 32 states. [2020-07-20 14:50:44,019 WARN L193 SmtUtils]: Spent 1.97 s on a formula simplification. DAG size of input: 76 DAG size of output: 11 [2020-07-20 14:50:46,036 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 3) 4294967296) 5000000) (< (mod (+ c_main_~x~0 1) 4294967296) 5000000) (< (mod (+ c_main_~x~0 9) 4294967296) 5000000) (< (mod (+ c_main_~x~0 6) 4294967296) 5000000) (< (mod (+ c_main_~x~0 10) 4294967296) 5000000) (< (mod (+ c_main_~x~0 2) 4294967296) 5000000) (< (mod (+ c_main_~x~0 13) 4294967296) 5000000) (< (mod (+ c_main_~x~0 4) 4294967296) 5000000) (< (mod (+ c_main_~x~0 5) 4294967296) 5000000) (< (mod c_main_~x~0 4294967296) 5000000) (< (mod (+ c_main_~x~0 7) 4294967296) 5000000) (< (mod (+ c_main_~x~0 8) 4294967296) 5000000) (< (mod (+ c_main_~x~0 12) 4294967296) 5000000) (< (mod (+ c_main_~x~0 11) 4294967296) 5000000)) is different from false [2020-07-20 14:50:52,692 WARN L193 SmtUtils]: Spent 2.96 s on a formula simplification. DAG size of input: 68 DAG size of output: 13 [2020-07-20 14:51:01,568 WARN L193 SmtUtils]: Spent 2.32 s on a formula simplification. DAG size of input: 66 DAG size of output: 11 [2020-07-20 14:51:03,600 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 4) 4294967296) 5000000) (< (mod (+ c_main_~x~0 3) 4294967296) 5000000) (< (mod (+ c_main_~x~0 5) 4294967296) 5000000) (< (mod (+ c_main_~x~0 1) 4294967296) 5000000) (< (mod c_main_~x~0 4294967296) 5000000) (< (mod (+ c_main_~x~0 9) 4294967296) 5000000) (< (mod (+ c_main_~x~0 6) 4294967296) 5000000) (< (mod (+ c_main_~x~0 7) 4294967296) 5000000) (< (mod (+ c_main_~x~0 8) 4294967296) 5000000) (< (mod (+ c_main_~x~0 10) 4294967296) 5000000) (< (mod (+ c_main_~x~0 2) 4294967296) 5000000) (< (mod (+ c_main_~x~0 11) 4294967296) 5000000)) is different from false [2020-07-20 14:51:10,818 WARN L193 SmtUtils]: Spent 961.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 13 [2020-07-20 14:51:15,299 WARN L193 SmtUtils]: Spent 848.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 11 [2020-07-20 14:51:19,415 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 4) 4294967296) 5000000) (< (mod (+ c_main_~x~0 3) 4294967296) 5000000) (< (mod (+ c_main_~x~0 5) 4294967296) 5000000) (< (mod (+ c_main_~x~0 1) 4294967296) 5000000) (< (mod c_main_~x~0 4294967296) 5000000) (< (mod (+ c_main_~x~0 9) 4294967296) 5000000) (< (mod (+ c_main_~x~0 6) 4294967296) 5000000) (< (mod (+ c_main_~x~0 7) 4294967296) 5000000) (< (mod (+ c_main_~x~0 8) 4294967296) 5000000) (< (mod (+ c_main_~x~0 2) 4294967296) 5000000)) is different from false [2020-07-20 14:51:33,054 WARN L193 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 13 [2020-07-20 14:51:44,273 WARN L193 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 46 DAG size of output: 11 [2020-07-20 14:51:46,317 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 11 [2020-07-20 14:51:55,030 WARN L193 SmtUtils]: Spent 2.14 s on a formula simplification. DAG size of input: 36 DAG size of output: 11 [2020-07-20 14:52:05,843 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 3) 4294967296) 5000000) (< (mod (+ c_main_~x~0 1) 4294967296) 5000000) (< (mod c_main_~x~0 4294967296) 5000000) (< (mod (+ c_main_~x~0 2) 4294967296) 5000000)) is different from false [2020-07-20 14:52:16,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 14:52:16,983 INFO L93 Difference]: Finished difference Result 138 states and 170 transitions. [2020-07-20 14:52:16,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2020-07-20 14:52:16,983 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 76 [2020-07-20 14:52:16,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 14:52:16,985 INFO L225 Difference]: With dead ends: 138 [2020-07-20 14:52:16,985 INFO L226 Difference]: Without dead ends: 110 [2020-07-20 14:52:16,991 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 96.4s TimeCoverageRelationStatistics Valid=707, Invalid=1359, Unknown=20, NotChecked=364, Total=2450 [2020-07-20 14:52:16,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-07-20 14:52:17,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 102. [2020-07-20 14:52:17,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2020-07-20 14:52:17,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 111 transitions. [2020-07-20 14:52:17,014 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 111 transitions. Word has length 76 [2020-07-20 14:52:17,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 14:52:17,018 INFO L479 AbstractCegarLoop]: Abstraction has 102 states and 111 transitions. [2020-07-20 14:52:17,019 INFO L480 AbstractCegarLoop]: Interpolant automaton has 32 states. [2020-07-20 14:52:17,019 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 111 transitions. [2020-07-20 14:52:17,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-07-20 14:52:17,024 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 14:52:17,024 INFO L422 BasicCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 14:52:17,243 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 14:52:17,244 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 14:52:17,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 14:52:17,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1507791018, now seen corresponding path program 4 times [2020-07-20 14:52:17,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 14:52:17,245 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [406100135] [2020-07-20 14:52:17,246 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 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-20 14:52:17,293 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-20 14:52:17,294 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 14:52:17,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 50 conjunts are in the unsatisfiable core [2020-07-20 14:52:17,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 14:52:17,845 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-20 14:52:17,845 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 14:52:19,956 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-20 14:52:19,957 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [406100135] [2020-07-20 14:52:19,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 14:52:19,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 49 [2020-07-20 14:52:19,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218085480] [2020-07-20 14:52:19,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2020-07-20 14:52:19,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 14:52:19,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2020-07-20 14:52:19,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=648, Invalid=1704, Unknown=0, NotChecked=0, Total=2352 [2020-07-20 14:52:19,960 INFO L87 Difference]: Start difference. First operand 102 states and 111 transitions. Second operand 49 states. [2020-07-20 14:52:23,292 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~y~0 4294967296))) (and (< (mod (+ c_main_~x~0 3) 4294967296) .cse0) (< (mod (+ c_main_~x~0 10) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 11) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod (+ c_main_~x~0 18) 4294967296) .cse0) (< (mod c_main_~x~0 4294967296) .cse0) (< (mod (+ c_main_~x~0 12) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 14) 4294967296) .cse0) (< (mod (+ c_main_~x~0 15) 4294967296) .cse0) (< (mod (+ c_main_~x~0 20) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 22) 4294967296) .cse0) (< (mod (+ c_main_~x~0 13) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 19) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 21) 4294967296) .cse0) (< (mod (+ c_main_~x~0 17) 4294967296) .cse0) (< (mod (+ c_main_~x~0 16) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0))) is different from false [2020-07-20 14:52:25,338 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~y~0 4294967296))) (and (< (mod (+ c_main_~x~0 3) 4294967296) .cse0) (< (mod (+ c_main_~x~0 10) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 11) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod (+ c_main_~x~0 18) 4294967296) .cse0) (< (mod (+ c_main_~x~0 12) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 14) 4294967296) .cse0) (< (mod (+ c_main_~x~0 15) 4294967296) .cse0) (< (mod (+ c_main_~x~0 20) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 22) 4294967296) .cse0) (< (mod (+ c_main_~x~0 13) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 19) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 21) 4294967296) .cse0) (< (mod (+ c_main_~x~0 17) 4294967296) .cse0) (< (mod (+ c_main_~x~0 16) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0))) is different from false [2020-07-20 14:52:27,347 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~y~0 4294967296))) (and (< (mod (+ c_main_~x~0 3) 4294967296) .cse0) (< (mod (+ c_main_~x~0 10) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 11) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod (+ c_main_~x~0 18) 4294967296) .cse0) (< (mod c_main_~x~0 4294967296) .cse0) (< (mod (+ c_main_~x~0 12) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 14) 4294967296) .cse0) (< (mod (+ c_main_~x~0 15) 4294967296) .cse0) (< (mod (+ c_main_~x~0 20) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 13) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 19) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 21) 4294967296) .cse0) (< (mod (+ c_main_~x~0 17) 4294967296) .cse0) (< (mod (+ c_main_~x~0 16) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0))) is different from false [2020-07-20 14:52:29,361 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~y~0 4294967296))) (and (< (mod (+ c_main_~x~0 3) 4294967296) .cse0) (< (mod (+ c_main_~x~0 10) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 11) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod (+ c_main_~x~0 18) 4294967296) .cse0) (< (mod (+ c_main_~x~0 12) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 14) 4294967296) .cse0) (< (mod (+ c_main_~x~0 15) 4294967296) .cse0) (< (mod (+ c_main_~x~0 20) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 13) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 19) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 21) 4294967296) .cse0) (< (mod (+ c_main_~x~0 17) 4294967296) .cse0) (< (mod (+ c_main_~x~0 16) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0))) is different from false [2020-07-20 14:52:31,389 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~y~0 4294967296))) (and (< (mod (+ c_main_~x~0 3) 4294967296) .cse0) (< (mod (+ c_main_~x~0 10) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 11) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod (+ c_main_~x~0 18) 4294967296) .cse0) (< (mod c_main_~x~0 4294967296) .cse0) (< (mod (+ c_main_~x~0 12) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 14) 4294967296) .cse0) (< (mod (+ c_main_~x~0 15) 4294967296) .cse0) (< (mod (+ c_main_~x~0 20) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 13) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 19) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 17) 4294967296) .cse0) (< (mod (+ c_main_~x~0 16) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0))) is different from false [2020-07-20 14:54:04,676 WARN L193 SmtUtils]: Spent 1.37 m on a formula simplification that was a NOOP. DAG size: 105 [2020-07-20 14:54:12,812 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~y~0 4294967296))) (and (< (mod (+ c_main_~x~0 3) 4294967296) .cse0) (< (mod (+ c_main_~x~0 10) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 11) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod (+ c_main_~x~0 18) 4294967296) .cse0) (< (mod c_main_~x~0 4294967296) .cse0) (< (mod (+ c_main_~x~0 12) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 14) 4294967296) .cse0) (< (mod (+ c_main_~x~0 15) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 13) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 19) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 17) 4294967296) .cse0) (< (mod (+ c_main_~x~0 16) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0))) is different from false [2020-07-20 14:54:14,824 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~y~0 4294967296))) (and (< (mod (+ c_main_~x~0 3) 4294967296) .cse0) (< (mod (+ c_main_~x~0 10) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 11) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod (+ c_main_~x~0 18) 4294967296) .cse0) (< (mod (+ c_main_~x~0 12) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 14) 4294967296) .cse0) (< (mod (+ c_main_~x~0 15) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 13) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 19) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 17) 4294967296) .cse0) (< (mod (+ c_main_~x~0 16) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0))) is different from false [2020-07-20 14:54:16,837 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~y~0 4294967296))) (and (< (mod (+ c_main_~x~0 3) 4294967296) .cse0) (< (mod (+ c_main_~x~0 10) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 11) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod (+ c_main_~x~0 18) 4294967296) .cse0) (< (mod c_main_~x~0 4294967296) .cse0) (< (mod (+ c_main_~x~0 12) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 14) 4294967296) .cse0) (< (mod (+ c_main_~x~0 15) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 13) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 17) 4294967296) .cse0) (< (mod (+ c_main_~x~0 16) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0))) is different from false [2020-07-20 14:54:18,851 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~y~0 4294967296))) (and (< (mod (+ c_main_~x~0 3) 4294967296) .cse0) (< (mod (+ c_main_~x~0 10) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 11) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod (+ c_main_~x~0 18) 4294967296) .cse0) (< (mod (+ c_main_~x~0 12) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 14) 4294967296) .cse0) (< (mod (+ c_main_~x~0 15) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 13) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 17) 4294967296) .cse0) (< (mod (+ c_main_~x~0 16) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0))) is different from false [2020-07-20 14:54:20,868 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~y~0 4294967296))) (and (< (mod (+ c_main_~x~0 3) 4294967296) .cse0) (< (mod (+ c_main_~x~0 10) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 11) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod c_main_~x~0 4294967296) .cse0) (< (mod (+ c_main_~x~0 12) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 14) 4294967296) .cse0) (< (mod (+ c_main_~x~0 15) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 13) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 17) 4294967296) .cse0) (< (mod (+ c_main_~x~0 16) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0))) is different from false [2020-07-20 14:54:22,878 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~y~0 4294967296))) (and (< (mod (+ c_main_~x~0 3) 4294967296) .cse0) (< (mod (+ c_main_~x~0 10) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 11) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod (+ c_main_~x~0 12) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 14) 4294967296) .cse0) (< (mod (+ c_main_~x~0 15) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 13) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 17) 4294967296) .cse0) (< (mod (+ c_main_~x~0 16) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0))) is different from false [2020-07-20 14:54:24,899 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~y~0 4294967296))) (and (< (mod (+ c_main_~x~0 3) 4294967296) .cse0) (< (mod (+ c_main_~x~0 10) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 11) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod c_main_~x~0 4294967296) .cse0) (< (mod (+ c_main_~x~0 12) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 14) 4294967296) .cse0) (< (mod (+ c_main_~x~0 15) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 13) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 16) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0))) is different from false [2020-07-20 14:54:26,933 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~y~0 4294967296))) (and (< (mod (+ c_main_~x~0 3) 4294967296) .cse0) (< (mod (+ c_main_~x~0 10) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 11) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod (+ c_main_~x~0 12) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 14) 4294967296) .cse0) (< (mod (+ c_main_~x~0 15) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 13) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 16) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0))) is different from false [2020-07-20 14:54:28,944 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~y~0 4294967296))) (and (< (mod (+ c_main_~x~0 3) 4294967296) .cse0) (< (mod (+ c_main_~x~0 10) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 11) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod c_main_~x~0 4294967296) .cse0) (< (mod (+ c_main_~x~0 12) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 14) 4294967296) .cse0) (< (mod (+ c_main_~x~0 15) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 13) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0))) is different from false [2020-07-20 14:55:32,505 WARN L193 SmtUtils]: Spent 47.33 s on a formula simplification that was a NOOP. DAG size: 80 [2020-07-20 14:55:49,168 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~y~0 4294967296))) (and (< (mod (+ c_main_~x~0 3) 4294967296) .cse0) (< (mod (+ c_main_~x~0 10) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 11) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod c_main_~x~0 4294967296) .cse0) (< (mod (+ c_main_~x~0 12) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 14) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 13) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0))) is different from false [2020-07-20 14:55:51,326 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~y~0 4294967296))) (and (< (mod (+ c_main_~x~0 3) 4294967296) .cse0) (< (mod (+ c_main_~x~0 10) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 11) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod (+ c_main_~x~0 12) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 14) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 13) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0))) is different from false [2020-07-20 14:55:53,411 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~y~0 4294967296))) (and (< (mod (+ c_main_~x~0 3) 4294967296) .cse0) (< (mod (+ c_main_~x~0 10) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 11) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod c_main_~x~0 4294967296) .cse0) (< (mod (+ c_main_~x~0 12) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 13) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0))) is different from false [2020-07-20 14:55:55,423 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~y~0 4294967296))) (and (< (mod (+ c_main_~x~0 3) 4294967296) .cse0) (< (mod (+ c_main_~x~0 10) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 11) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod (+ c_main_~x~0 12) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 13) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0))) is different from false [2020-07-20 14:55:57,435 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~y~0 4294967296))) (and (< (mod (+ c_main_~x~0 3) 4294967296) .cse0) (< (mod (+ c_main_~x~0 10) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 11) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod c_main_~x~0 4294967296) .cse0) (< (mod (+ c_main_~x~0 12) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0))) is different from false [2020-07-20 14:57:00,804 WARN L193 SmtUtils]: Spent 35.65 s on a formula simplification that was a NOOP. DAG size: 65 [2020-07-20 14:58:14,821 WARN L193 SmtUtils]: Spent 27.29 s on a formula simplification that was a NOOP. DAG size: 63 [2020-07-20 15:00:02,780 WARN L193 SmtUtils]: Spent 22.56 s on a formula simplification that was a NOOP. DAG size: 58 [2020-07-20 15:00:25,398 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~y~0 4294967296))) (and (< (mod (+ c_main_~x~0 3) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod c_main_~x~0 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0))) is different from false [2020-07-20 15:00:27,406 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~y~0 4294967296))) (and (< (mod (+ c_main_~x~0 3) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0))) is different from false [2020-07-20 15:00:29,428 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~y~0 4294967296))) (and (< (mod (+ c_main_~x~0 3) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod c_main_~x~0 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0))) is different from false [2020-07-20 15:00:49,117 WARN L193 SmtUtils]: Spent 5.13 s on a formula simplification that was a NOOP. DAG size: 45 [2020-07-20 15:01:24,298 WARN L193 SmtUtils]: Spent 14.32 s on a formula simplification that was a NOOP. DAG size: 43 [2020-07-20 15:01:56,668 WARN L193 SmtUtils]: Spent 5.84 s on a formula simplification that was a NOOP. DAG size: 38 [2020-07-20 15:02:15,561 WARN L193 SmtUtils]: Spent 6.32 s on a formula simplification that was a NOOP. DAG size: 33 [2020-07-20 15:02:19,578 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~y~0 4294967296))) (and (< (mod (+ c_main_~x~0 3) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod c_main_~x~0 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0))) is different from false [2020-07-20 15:02:23,924 WARN L193 SmtUtils]: Spent 2.11 s on a formula simplification that was a NOOP. DAG size: 25 [2020-07-20 15:02:40,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 15:02:40,172 INFO L93 Difference]: Finished difference Result 155 states and 194 transitions. [2020-07-20 15:02:40,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2020-07-20 15:02:40,173 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 76 [2020-07-20 15:02:40,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 15:02:40,176 INFO L225 Difference]: With dead ends: 155 [2020-07-20 15:02:40,177 INFO L226 Difference]: Without dead ends: 150 [2020-07-20 15:02:40,179 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 23 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 494.3s TimeCoverageRelationStatistics Valid=1176, Invalid=2603, Unknown=95, NotChecked=3266, Total=7140 [2020-07-20 15:02:40,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2020-07-20 15:02:40,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2020-07-20 15:02:40,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-07-20 15:02:40,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 165 transitions. [2020-07-20 15:02:40,206 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 165 transitions. Word has length 76 [2020-07-20 15:02:40,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 15:02:40,207 INFO L479 AbstractCegarLoop]: Abstraction has 149 states and 165 transitions. [2020-07-20 15:02:40,207 INFO L480 AbstractCegarLoop]: Interpolant automaton has 49 states. [2020-07-20 15:02:40,207 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 165 transitions. [2020-07-20 15:02:40,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2020-07-20 15:02:40,209 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 15:02:40,209 INFO L422 BasicCegarLoop]: trace histogram [31, 31, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 15:02:40,412 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 15:02:40,413 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 15:02:40,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 15:02:40,413 INFO L82 PathProgramCache]: Analyzing trace with hash -242211211, now seen corresponding path program 4 times [2020-07-20 15:02:40,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 15:02:40,414 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [387981613] [2020-07-20 15:02:40,415 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 15:02:40,471 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-20 15:02:40,471 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 15:02:40,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 63 conjunts are in the unsatisfiable core [2020-07-20 15:02:40,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 15:02:41,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 61 proven. 1365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 15:02:41,349 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 15:02:55,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 61 proven. 1362 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 15:02:55,116 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [387981613] [2020-07-20 15:02:55,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 15:02:55,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 64 [2020-07-20 15:02:55,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001697783] [2020-07-20 15:02:55,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2020-07-20 15:02:55,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 15:02:55,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2020-07-20 15:02:55,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1086, Invalid=2942, Unknown=4, NotChecked=0, Total=4032 [2020-07-20 15:02:55,120 INFO L87 Difference]: Start difference. First operand 149 states and 165 transitions. Second operand 64 states. [2020-07-20 15:02:59,455 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 24) 4294967296) 5000000) (< (mod (+ c_main_~x~0 11) 4294967296) 5000000) (< (mod (+ c_main_~x~0 8) 4294967296) 5000000) (< (mod (+ c_main_~x~0 15) 4294967296) 5000000) (< (mod (+ c_main_~x~0 12) 4294967296) 5000000) (< (mod (+ c_main_~x~0 26) 4294967296) 5000000) (< (mod (+ c_main_~x~0 14) 4294967296) 5000000) (< (mod (+ c_main_~x~0 18) 4294967296) 5000000) (< (mod (+ c_main_~x~0 9) 4294967296) 5000000) (< (mod (+ c_main_~x~0 5) 4294967296) 5000000) (< (mod (+ c_main_~x~0 30) 4294967296) 5000000) (< (mod (+ c_main_~x~0 29) 4294967296) 5000000) (< (mod (+ c_main_~x~0 1) 4294967296) 5000000) (< (mod (+ c_main_~x~0 25) 4294967296) 5000000) (< (mod (+ c_main_~x~0 13) 4294967296) 5000000) (< (mod (+ c_main_~x~0 16) 4294967296) 5000000) (< (mod (+ c_main_~x~0 23) 4294967296) 5000000) (< (mod (+ c_main_~x~0 17) 4294967296) 5000000) (< (mod (+ c_main_~x~0 4) 4294967296) 5000000) (< (mod (+ c_main_~x~0 22) 4294967296) 5000000) (< (mod (+ c_main_~x~0 21) 4294967296) 5000000) (< (mod (+ c_main_~x~0 28) 4294967296) 5000000) (< (mod (+ c_main_~x~0 20) 4294967296) 5000000) (< (mod (+ c_main_~x~0 27) 4294967296) 5000000) (< (mod (+ c_main_~x~0 3) 4294967296) 5000000) (< (mod (+ c_main_~x~0 6) 4294967296) 5000000) (< (mod (+ c_main_~x~0 19) 4294967296) 5000000) (< (mod c_main_~x~0 4294967296) 5000000) (< (mod (+ c_main_~x~0 10) 4294967296) 5000000) (< (mod (+ c_main_~x~0 2) 4294967296) 5000000) (< (mod (+ c_main_~x~0 7) 4294967296) 5000000)) is different from false [2020-07-20 15:03:01,466 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 24) 4294967296) 5000000) (< (mod (+ c_main_~x~0 11) 4294967296) 5000000) (< (mod (+ c_main_~x~0 8) 4294967296) 5000000) (< (mod (+ c_main_~x~0 15) 4294967296) 5000000) (< (mod (+ c_main_~x~0 12) 4294967296) 5000000) (< (mod (+ c_main_~x~0 26) 4294967296) 5000000) (< (mod (+ c_main_~x~0 14) 4294967296) 5000000) (< (mod (+ c_main_~x~0 18) 4294967296) 5000000) (< (mod (+ c_main_~x~0 9) 4294967296) 5000000) (< (mod (+ c_main_~x~0 5) 4294967296) 5000000) (< (mod (+ c_main_~x~0 30) 4294967296) 5000000) (< (mod (+ c_main_~x~0 29) 4294967296) 5000000) (< (mod (+ c_main_~x~0 1) 4294967296) 5000000) (< (mod (+ c_main_~x~0 25) 4294967296) 5000000) (< (mod (+ c_main_~x~0 13) 4294967296) 5000000) (< (mod (+ c_main_~x~0 16) 4294967296) 5000000) (< (mod (+ c_main_~x~0 23) 4294967296) 5000000) (< (mod (+ c_main_~x~0 17) 4294967296) 5000000) (< (mod (+ c_main_~x~0 4) 4294967296) 5000000) (< (mod (+ c_main_~x~0 22) 4294967296) 5000000) (< (mod (+ c_main_~x~0 21) 4294967296) 5000000) (< (mod (+ c_main_~x~0 28) 4294967296) 5000000) (< (mod (+ c_main_~x~0 20) 4294967296) 5000000) (< (mod (+ c_main_~x~0 27) 4294967296) 5000000) (< (mod (+ c_main_~x~0 3) 4294967296) 5000000) (< (mod (+ c_main_~x~0 6) 4294967296) 5000000) (< (mod (+ c_main_~x~0 19) 4294967296) 5000000) (< (mod (+ c_main_~x~0 10) 4294967296) 5000000) (< (mod (+ c_main_~x~0 2) 4294967296) 5000000) (< (mod (+ c_main_~x~0 7) 4294967296) 5000000)) is different from false [2020-07-20 15:03:03,476 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 24) 4294967296) 5000000) (< (mod (+ c_main_~x~0 11) 4294967296) 5000000) (< (mod (+ c_main_~x~0 8) 4294967296) 5000000) (< (mod (+ c_main_~x~0 15) 4294967296) 5000000) (< (mod (+ c_main_~x~0 12) 4294967296) 5000000) (< (mod (+ c_main_~x~0 26) 4294967296) 5000000) (< (mod (+ c_main_~x~0 14) 4294967296) 5000000) (< (mod (+ c_main_~x~0 18) 4294967296) 5000000) (< (mod (+ c_main_~x~0 9) 4294967296) 5000000) (< (mod (+ c_main_~x~0 5) 4294967296) 5000000) (< (mod (+ c_main_~x~0 29) 4294967296) 5000000) (< (mod (+ c_main_~x~0 1) 4294967296) 5000000) (< (mod (+ c_main_~x~0 25) 4294967296) 5000000) (< (mod (+ c_main_~x~0 13) 4294967296) 5000000) (< (mod (+ c_main_~x~0 16) 4294967296) 5000000) (< (mod (+ c_main_~x~0 23) 4294967296) 5000000) (< (mod (+ c_main_~x~0 17) 4294967296) 5000000) (< (mod (+ c_main_~x~0 4) 4294967296) 5000000) (< (mod (+ c_main_~x~0 22) 4294967296) 5000000) (< (mod (+ c_main_~x~0 21) 4294967296) 5000000) (< (mod (+ c_main_~x~0 28) 4294967296) 5000000) (< (mod (+ c_main_~x~0 20) 4294967296) 5000000) (< (mod (+ c_main_~x~0 27) 4294967296) 5000000) (< (mod (+ c_main_~x~0 3) 4294967296) 5000000) (< (mod (+ c_main_~x~0 6) 4294967296) 5000000) (< (mod (+ c_main_~x~0 19) 4294967296) 5000000) (< (mod c_main_~x~0 4294967296) 5000000) (< (mod (+ c_main_~x~0 10) 4294967296) 5000000) (< (mod (+ c_main_~x~0 2) 4294967296) 5000000) (< (mod (+ c_main_~x~0 7) 4294967296) 5000000)) is different from false [2020-07-20 15:03:05,488 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 24) 4294967296) 5000000) (< (mod (+ c_main_~x~0 11) 4294967296) 5000000) (< (mod (+ c_main_~x~0 8) 4294967296) 5000000) (< (mod (+ c_main_~x~0 15) 4294967296) 5000000) (< (mod (+ c_main_~x~0 12) 4294967296) 5000000) (< (mod (+ c_main_~x~0 26) 4294967296) 5000000) (< (mod (+ c_main_~x~0 14) 4294967296) 5000000) (< (mod (+ c_main_~x~0 18) 4294967296) 5000000) (< (mod (+ c_main_~x~0 9) 4294967296) 5000000) (< (mod (+ c_main_~x~0 5) 4294967296) 5000000) (< (mod (+ c_main_~x~0 29) 4294967296) 5000000) (< (mod (+ c_main_~x~0 1) 4294967296) 5000000) (< (mod (+ c_main_~x~0 25) 4294967296) 5000000) (< (mod (+ c_main_~x~0 13) 4294967296) 5000000) (< (mod (+ c_main_~x~0 16) 4294967296) 5000000) (< (mod (+ c_main_~x~0 23) 4294967296) 5000000) (< (mod (+ c_main_~x~0 17) 4294967296) 5000000) (< (mod (+ c_main_~x~0 4) 4294967296) 5000000) (< (mod (+ c_main_~x~0 22) 4294967296) 5000000) (< (mod (+ c_main_~x~0 21) 4294967296) 5000000) (< (mod (+ c_main_~x~0 28) 4294967296) 5000000) (< (mod (+ c_main_~x~0 20) 4294967296) 5000000) (< (mod (+ c_main_~x~0 27) 4294967296) 5000000) (< (mod (+ c_main_~x~0 3) 4294967296) 5000000) (< (mod (+ c_main_~x~0 6) 4294967296) 5000000) (< (mod (+ c_main_~x~0 19) 4294967296) 5000000) (< (mod (+ c_main_~x~0 10) 4294967296) 5000000) (< (mod (+ c_main_~x~0 2) 4294967296) 5000000) (< (mod (+ c_main_~x~0 7) 4294967296) 5000000)) is different from false [2020-07-20 15:03:07,498 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 24) 4294967296) 5000000) (< (mod (+ c_main_~x~0 11) 4294967296) 5000000) (< (mod (+ c_main_~x~0 8) 4294967296) 5000000) (< (mod (+ c_main_~x~0 15) 4294967296) 5000000) (< (mod (+ c_main_~x~0 12) 4294967296) 5000000) (< (mod (+ c_main_~x~0 26) 4294967296) 5000000) (< (mod (+ c_main_~x~0 14) 4294967296) 5000000) (< (mod (+ c_main_~x~0 18) 4294967296) 5000000) (< (mod (+ c_main_~x~0 9) 4294967296) 5000000) (< (mod (+ c_main_~x~0 5) 4294967296) 5000000) (< (mod (+ c_main_~x~0 1) 4294967296) 5000000) (< (mod (+ c_main_~x~0 25) 4294967296) 5000000) (< (mod (+ c_main_~x~0 13) 4294967296) 5000000) (< (mod (+ c_main_~x~0 16) 4294967296) 5000000) (< (mod (+ c_main_~x~0 23) 4294967296) 5000000) (< (mod (+ c_main_~x~0 17) 4294967296) 5000000) (< (mod (+ c_main_~x~0 4) 4294967296) 5000000) (< (mod (+ c_main_~x~0 22) 4294967296) 5000000) (< (mod (+ c_main_~x~0 21) 4294967296) 5000000) (< (mod (+ c_main_~x~0 28) 4294967296) 5000000) (< (mod (+ c_main_~x~0 20) 4294967296) 5000000) (< (mod (+ c_main_~x~0 27) 4294967296) 5000000) (< (mod (+ c_main_~x~0 3) 4294967296) 5000000) (< (mod (+ c_main_~x~0 6) 4294967296) 5000000) (< (mod (+ c_main_~x~0 19) 4294967296) 5000000) (< (mod c_main_~x~0 4294967296) 5000000) (< (mod (+ c_main_~x~0 10) 4294967296) 5000000) (< (mod (+ c_main_~x~0 2) 4294967296) 5000000) (< (mod (+ c_main_~x~0 7) 4294967296) 5000000)) is different from false [2020-07-20 15:03:09,511 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 24) 4294967296) 5000000) (< (mod (+ c_main_~x~0 11) 4294967296) 5000000) (< (mod (+ c_main_~x~0 8) 4294967296) 5000000) (< (mod (+ c_main_~x~0 15) 4294967296) 5000000) (< (mod (+ c_main_~x~0 12) 4294967296) 5000000) (< (mod (+ c_main_~x~0 26) 4294967296) 5000000) (< (mod (+ c_main_~x~0 14) 4294967296) 5000000) (< (mod (+ c_main_~x~0 18) 4294967296) 5000000) (< (mod (+ c_main_~x~0 9) 4294967296) 5000000) (< (mod (+ c_main_~x~0 5) 4294967296) 5000000) (< (mod (+ c_main_~x~0 1) 4294967296) 5000000) (< (mod (+ c_main_~x~0 25) 4294967296) 5000000) (< (mod (+ c_main_~x~0 13) 4294967296) 5000000) (< (mod (+ c_main_~x~0 16) 4294967296) 5000000) (< (mod (+ c_main_~x~0 23) 4294967296) 5000000) (< (mod (+ c_main_~x~0 17) 4294967296) 5000000) (< (mod (+ c_main_~x~0 4) 4294967296) 5000000) (< (mod (+ c_main_~x~0 22) 4294967296) 5000000) (< (mod (+ c_main_~x~0 21) 4294967296) 5000000) (< (mod (+ c_main_~x~0 28) 4294967296) 5000000) (< (mod (+ c_main_~x~0 20) 4294967296) 5000000) (< (mod (+ c_main_~x~0 27) 4294967296) 5000000) (< (mod (+ c_main_~x~0 3) 4294967296) 5000000) (< (mod (+ c_main_~x~0 6) 4294967296) 5000000) (< (mod (+ c_main_~x~0 19) 4294967296) 5000000) (< (mod (+ c_main_~x~0 10) 4294967296) 5000000) (< (mod (+ c_main_~x~0 2) 4294967296) 5000000) (< (mod (+ c_main_~x~0 7) 4294967296) 5000000)) is different from false [2020-07-20 15:03:11,523 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 24) 4294967296) 5000000) (< (mod (+ c_main_~x~0 11) 4294967296) 5000000) (< (mod (+ c_main_~x~0 8) 4294967296) 5000000) (< (mod (+ c_main_~x~0 15) 4294967296) 5000000) (< (mod (+ c_main_~x~0 12) 4294967296) 5000000) (< (mod (+ c_main_~x~0 26) 4294967296) 5000000) (< (mod (+ c_main_~x~0 14) 4294967296) 5000000) (< (mod (+ c_main_~x~0 18) 4294967296) 5000000) (< (mod (+ c_main_~x~0 9) 4294967296) 5000000) (< (mod (+ c_main_~x~0 5) 4294967296) 5000000) (< (mod (+ c_main_~x~0 1) 4294967296) 5000000) (< (mod (+ c_main_~x~0 25) 4294967296) 5000000) (< (mod (+ c_main_~x~0 13) 4294967296) 5000000) (< (mod (+ c_main_~x~0 16) 4294967296) 5000000) (< (mod (+ c_main_~x~0 23) 4294967296) 5000000) (< (mod (+ c_main_~x~0 17) 4294967296) 5000000) (< (mod (+ c_main_~x~0 4) 4294967296) 5000000) (< (mod (+ c_main_~x~0 22) 4294967296) 5000000) (< (mod (+ c_main_~x~0 21) 4294967296) 5000000) (< (mod (+ c_main_~x~0 20) 4294967296) 5000000) (< (mod (+ c_main_~x~0 27) 4294967296) 5000000) (< (mod (+ c_main_~x~0 3) 4294967296) 5000000) (< (mod (+ c_main_~x~0 6) 4294967296) 5000000) (< (mod (+ c_main_~x~0 19) 4294967296) 5000000) (< (mod c_main_~x~0 4294967296) 5000000) (< (mod (+ c_main_~x~0 10) 4294967296) 5000000) (< (mod (+ c_main_~x~0 2) 4294967296) 5000000) (< (mod (+ c_main_~x~0 7) 4294967296) 5000000)) is different from false [2020-07-20 15:03:13,535 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 24) 4294967296) 5000000) (< (mod (+ c_main_~x~0 11) 4294967296) 5000000) (< (mod (+ c_main_~x~0 8) 4294967296) 5000000) (< (mod (+ c_main_~x~0 15) 4294967296) 5000000) (< (mod (+ c_main_~x~0 12) 4294967296) 5000000) (< (mod (+ c_main_~x~0 26) 4294967296) 5000000) (< (mod (+ c_main_~x~0 14) 4294967296) 5000000) (< (mod (+ c_main_~x~0 18) 4294967296) 5000000) (< (mod (+ c_main_~x~0 9) 4294967296) 5000000) (< (mod (+ c_main_~x~0 5) 4294967296) 5000000) (< (mod (+ c_main_~x~0 1) 4294967296) 5000000) (< (mod (+ c_main_~x~0 25) 4294967296) 5000000) (< (mod (+ c_main_~x~0 13) 4294967296) 5000000) (< (mod (+ c_main_~x~0 16) 4294967296) 5000000) (< (mod (+ c_main_~x~0 23) 4294967296) 5000000) (< (mod (+ c_main_~x~0 17) 4294967296) 5000000) (< (mod (+ c_main_~x~0 4) 4294967296) 5000000) (< (mod (+ c_main_~x~0 22) 4294967296) 5000000) (< (mod (+ c_main_~x~0 21) 4294967296) 5000000) (< (mod (+ c_main_~x~0 20) 4294967296) 5000000) (< (mod (+ c_main_~x~0 27) 4294967296) 5000000) (< (mod (+ c_main_~x~0 3) 4294967296) 5000000) (< (mod (+ c_main_~x~0 6) 4294967296) 5000000) (< (mod (+ c_main_~x~0 19) 4294967296) 5000000) (< (mod (+ c_main_~x~0 10) 4294967296) 5000000) (< (mod (+ c_main_~x~0 2) 4294967296) 5000000) (< (mod (+ c_main_~x~0 7) 4294967296) 5000000)) is different from false [2020-07-20 15:03:30,385 WARN L193 SmtUtils]: Spent 7.86 s on a formula simplification. DAG size of input: 136 DAG size of output: 11 [2020-07-20 15:03:33,258 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 24) 4294967296) 5000000) (< (mod (+ c_main_~x~0 11) 4294967296) 5000000) (< (mod (+ c_main_~x~0 8) 4294967296) 5000000) (< (mod (+ c_main_~x~0 15) 4294967296) 5000000) (< (mod (+ c_main_~x~0 12) 4294967296) 5000000) (< (mod (+ c_main_~x~0 14) 4294967296) 5000000) (< (mod (+ c_main_~x~0 18) 4294967296) 5000000) (< (mod (+ c_main_~x~0 9) 4294967296) 5000000) (< (mod (+ c_main_~x~0 5) 4294967296) 5000000) (< (mod (+ c_main_~x~0 1) 4294967296) 5000000) (< (mod (+ c_main_~x~0 25) 4294967296) 5000000) (< (mod (+ c_main_~x~0 13) 4294967296) 5000000) (< (mod (+ c_main_~x~0 16) 4294967296) 5000000) (< (mod (+ c_main_~x~0 23) 4294967296) 5000000) (< (mod (+ c_main_~x~0 17) 4294967296) 5000000) (< (mod (+ c_main_~x~0 4) 4294967296) 5000000) (< (mod (+ c_main_~x~0 22) 4294967296) 5000000) (< (mod (+ c_main_~x~0 21) 4294967296) 5000000) (< (mod (+ c_main_~x~0 20) 4294967296) 5000000) (< (mod (+ c_main_~x~0 3) 4294967296) 5000000) (< (mod (+ c_main_~x~0 6) 4294967296) 5000000) (< (mod (+ c_main_~x~0 19) 4294967296) 5000000) (< (mod c_main_~x~0 4294967296) 5000000) (< (mod (+ c_main_~x~0 10) 4294967296) 5000000) (< (mod (+ c_main_~x~0 2) 4294967296) 5000000) (< (mod (+ c_main_~x~0 7) 4294967296) 5000000)) is different from false [2020-07-20 15:03:35,293 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 24) 4294967296) 5000000) (< (mod (+ c_main_~x~0 11) 4294967296) 5000000) (< (mod (+ c_main_~x~0 8) 4294967296) 5000000) (< (mod (+ c_main_~x~0 15) 4294967296) 5000000) (< (mod (+ c_main_~x~0 12) 4294967296) 5000000) (< (mod (+ c_main_~x~0 14) 4294967296) 5000000) (< (mod (+ c_main_~x~0 18) 4294967296) 5000000) (< (mod (+ c_main_~x~0 9) 4294967296) 5000000) (< (mod (+ c_main_~x~0 5) 4294967296) 5000000) (< (mod (+ c_main_~x~0 1) 4294967296) 5000000) (< (mod (+ c_main_~x~0 25) 4294967296) 5000000) (< (mod (+ c_main_~x~0 13) 4294967296) 5000000) (< (mod (+ c_main_~x~0 16) 4294967296) 5000000) (< (mod (+ c_main_~x~0 23) 4294967296) 5000000) (< (mod (+ c_main_~x~0 17) 4294967296) 5000000) (< (mod (+ c_main_~x~0 4) 4294967296) 5000000) (< (mod (+ c_main_~x~0 22) 4294967296) 5000000) (< (mod (+ c_main_~x~0 21) 4294967296) 5000000) (< (mod (+ c_main_~x~0 20) 4294967296) 5000000) (< (mod (+ c_main_~x~0 3) 4294967296) 5000000) (< (mod (+ c_main_~x~0 6) 4294967296) 5000000) (< (mod (+ c_main_~x~0 19) 4294967296) 5000000) (< (mod (+ c_main_~x~0 10) 4294967296) 5000000) (< (mod (+ c_main_~x~0 2) 4294967296) 5000000) (< (mod (+ c_main_~x~0 7) 4294967296) 5000000)) is different from false