/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 2 -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/mono-crafted_12.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-d623d84 [2020-07-21 14:30:32,854 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-21 14:30:32,857 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-21 14:30:32,872 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-21 14:30:32,872 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-21 14:30:32,874 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-21 14:30:32,875 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-21 14:30:32,878 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-21 14:30:32,880 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-21 14:30:32,881 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-21 14:30:32,882 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-21 14:30:32,883 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-21 14:30:32,884 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-21 14:30:32,885 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-21 14:30:32,886 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-21 14:30:32,887 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-21 14:30:32,888 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-21 14:30:32,889 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-21 14:30:32,891 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-21 14:30:32,893 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-21 14:30:32,895 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-21 14:30:32,897 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-21 14:30:32,898 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-21 14:30:32,899 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-21 14:30:32,902 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-21 14:30:32,902 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-21 14:30:32,903 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-21 14:30:32,904 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-21 14:30:32,904 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-21 14:30:32,906 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-21 14:30:32,906 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-21 14:30:32,907 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-21 14:30:32,908 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-21 14:30:32,908 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-21 14:30:32,910 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-21 14:30:32,910 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-21 14:30:32,911 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-21 14:30:32,911 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-21 14:30:32,911 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-21 14:30:32,912 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-21 14:30:32,913 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-21 14:30:32,917 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-21 14:30:32,942 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-21 14:30:32,942 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-21 14:30:32,945 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-21 14:30:32,946 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-21 14:30:32,946 INFO L138 SettingsManager]: * Use SBE=true [2020-07-21 14:30:32,946 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-21 14:30:32,946 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-21 14:30:32,946 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-21 14:30:32,947 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-21 14:30:32,947 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-21 14:30:32,948 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-21 14:30:32,948 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-21 14:30:32,948 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-21 14:30:32,949 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-21 14:30:32,949 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-21 14:30:32,949 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-21 14:30:32,950 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-21 14:30:32,950 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-21 14:30:32,950 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-21 14:30:32,950 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-21 14:30:32,951 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-21 14:30:32,951 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-21 14:30:32,951 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-21 14:30:32,952 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-21 14:30:32,952 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-21 14:30:32,952 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-21 14:30:32,952 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 14:30:32,953 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-21 14:30:32,953 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-21 14:30:32,953 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 -> 2 [2020-07-21 14:30:33,273 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-21 14:30:33,289 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-21 14:30:33,294 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-21 14:30:33,296 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-21 14:30:33,296 INFO L275 PluginConnector]: CDTParser initialized [2020-07-21 14:30:33,297 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/mono-crafted_12.c [2020-07-21 14:30:33,377 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/610062fea/6721ba6d419342ccb12ee04be93cdab1/FLAGf6a6d292c [2020-07-21 14:30:33,886 INFO L306 CDTParser]: Found 1 translation units. [2020-07-21 14:30:33,886 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/mono-crafted_12.c [2020-07-21 14:30:33,894 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/610062fea/6721ba6d419342ccb12ee04be93cdab1/FLAGf6a6d292c [2020-07-21 14:30:34,234 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/610062fea/6721ba6d419342ccb12ee04be93cdab1 [2020-07-21 14:30:34,244 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-21 14:30:34,248 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-21 14:30:34,249 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-21 14:30:34,249 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-21 14:30:34,253 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-21 14:30:34,254 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 02:30:34" (1/1) ... [2020-07-21 14:30:34,257 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@550c1f6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:30:34, skipping insertion in model container [2020-07-21 14:30:34,257 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 02:30:34" (1/1) ... [2020-07-21 14:30:34,265 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-21 14:30:34,290 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-21 14:30:34,474 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-21 14:30:34,479 INFO L203 MainTranslator]: Completed pre-run [2020-07-21 14:30:34,496 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-21 14:30:34,510 INFO L208 MainTranslator]: Completed translation [2020-07-21 14:30:34,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:30:34 WrapperNode [2020-07-21 14:30:34,511 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-21 14:30:34,512 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-21 14:30:34,512 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-21 14:30:34,513 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-21 14:30:34,526 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:30:34" (1/1) ... [2020-07-21 14:30:34,526 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:30:34" (1/1) ... [2020-07-21 14:30:34,531 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:30:34" (1/1) ... [2020-07-21 14:30:34,532 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:30:34" (1/1) ... [2020-07-21 14:30:34,535 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:30:34" (1/1) ... [2020-07-21 14:30:34,540 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:30:34" (1/1) ... [2020-07-21 14:30:34,540 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:30:34" (1/1) ... [2020-07-21 14:30:34,542 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-21 14:30:34,542 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-21 14:30:34,542 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-21 14:30:34,543 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-21 14:30:34,544 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:30:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-21 14:30:34,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-21 14:30:34,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-21 14:30:34,706 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-21 14:30:34,707 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-21 14:30:34,707 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-21 14:30:34,707 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-21 14:30:34,708 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-21 14:30:34,708 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-21 14:30:34,708 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-21 14:30:34,908 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-21 14:30:34,908 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-21 14:30:34,913 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 02:30:34 BoogieIcfgContainer [2020-07-21 14:30:34,913 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-21 14:30:34,915 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-21 14:30:34,915 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-21 14:30:34,920 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-21 14:30:34,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 02:30:34" (1/3) ... [2020-07-21 14:30:34,922 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a60c2cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 02:30:34, skipping insertion in model container [2020-07-21 14:30:34,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:30:34" (2/3) ... [2020-07-21 14:30:34,923 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a60c2cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 02:30:34, skipping insertion in model container [2020-07-21 14:30:34,923 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 02:30:34" (3/3) ... [2020-07-21 14:30:34,925 INFO L109 eAbstractionObserver]: Analyzing ICFG mono-crafted_12.c [2020-07-21 14:30:34,938 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBPonlyIfFpWasNotPerfect Determinization: PREDICATE_ABSTRACTION [2020-07-21 14:30:34,947 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-21 14:30:34,976 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-21 14:30:35,016 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-21 14:30:35,017 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-21 14:30:35,017 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBPonlyIfFpWasNotPerfect [2020-07-21 14:30:35,017 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-21 14:30:35,017 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-21 14:30:35,018 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-21 14:30:35,018 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-21 14:30:35,018 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-21 14:30:35,044 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2020-07-21 14:30:35,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-21 14:30:35,054 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 14:30:35,055 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 14:30:35,056 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 14:30:35,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 14:30:35,064 INFO L82 PathProgramCache]: Analyzing trace with hash -147882559, now seen corresponding path program 1 times [2020-07-21 14:30:35,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 14:30:35,078 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1296181326] [2020-07-21 14:30:35,079 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 14:30:35,165 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 14:30:35,166 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 14:30:35,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 1 conjunts are in the unsatisfiable core [2020-07-21 14:30:35,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 14:30:35,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 14:30:35,199 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 14:30:35,200 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1296181326] [2020-07-21 14:30:35,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 14:30:35,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-21 14:30:35,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709838121] [2020-07-21 14:30:35,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-21 14:30:35,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 14:30:35,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-21 14:30:35,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-21 14:30:35,225 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2020-07-21 14:30:35,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 14:30:35,249 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2020-07-21 14:30:35,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-21 14:30:35,251 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-07-21 14:30:35,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 14:30:35,259 INFO L225 Difference]: With dead ends: 32 [2020-07-21 14:30:35,260 INFO L226 Difference]: Without dead ends: 13 [2020-07-21 14:30:35,264 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-21 14:30:35,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2020-07-21 14:30:35,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-07-21 14:30:35,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-21 14:30:35,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2020-07-21 14:30:35,306 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2020-07-21 14:30:35,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 14:30:35,307 INFO L479 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2020-07-21 14:30:35,307 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-21 14:30:35,307 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2020-07-21 14:30:35,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-21 14:30:35,308 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 14:30:35,308 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 14:30:35,522 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 14:30:35,523 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 14:30:35,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 14:30:35,524 INFO L82 PathProgramCache]: Analyzing trace with hash -158041290, now seen corresponding path program 1 times [2020-07-21 14:30:35,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 14:30:35,525 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1599884799] [2020-07-21 14:30:35,526 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 14:30:35,557 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 1 check-sat command(s) [2020-07-21 14:30:35,558 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 14:30:35,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-21 14:30:35,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 14:30:35,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 14:30:35,593 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 14:30:35,594 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1599884799] [2020-07-21 14:30:35,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 14:30:35,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 14:30:35,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707679429] [2020-07-21 14:30:35,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 14:30:35,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 14:30:35,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 14:30:35,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 14:30:35,598 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 3 states. [2020-07-21 14:30:35,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 14:30:35,651 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2020-07-21 14:30:35,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 14:30:35,652 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-07-21 14:30:35,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 14:30:35,654 INFO L225 Difference]: With dead ends: 24 [2020-07-21 14:30:35,654 INFO L226 Difference]: Without dead ends: 16 [2020-07-21 14:30:35,655 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 14:30:35,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-07-21 14:30:35,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2020-07-21 14:30:35,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-21 14:30:35,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2020-07-21 14:30:35,663 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2020-07-21 14:30:35,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 14:30:35,663 INFO L479 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2020-07-21 14:30:35,663 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 14:30:35,664 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2020-07-21 14:30:35,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-21 14:30:35,664 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 14:30:35,665 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 14:30:35,881 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 14:30:35,882 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 14:30:35,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 14:30:35,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1776138601, now seen corresponding path program 1 times [2020-07-21 14:30:35,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 14:30:35,884 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1266556387] [2020-07-21 14:30:35,885 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 14:30:35,935 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 1 check-sat command(s) [2020-07-21 14:30:35,936 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 14:30:35,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-21 14:30:35,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 14:30:35,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 14:30:35,973 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 14:30:36,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 14:30:36,047 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1266556387] [2020-07-21 14:30:36,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 14:30:36,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2020-07-21 14:30:36,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477759008] [2020-07-21 14:30:36,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-21 14:30:36,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 14:30:36,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-21 14:30:36,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-07-21 14:30:36,050 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 7 states. [2020-07-21 14:30:36,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 14:30:36,166 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2020-07-21 14:30:36,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-21 14:30:36,167 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2020-07-21 14:30:36,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 14:30:36,168 INFO L225 Difference]: With dead ends: 31 [2020-07-21 14:30:36,168 INFO L226 Difference]: Without dead ends: 23 [2020-07-21 14:30:36,169 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2020-07-21 14:30:36,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-21 14:30:36,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-07-21 14:30:36,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-21 14:30:36,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2020-07-21 14:30:36,176 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 13 [2020-07-21 14:30:36,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 14:30:36,177 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2020-07-21 14:30:36,177 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-21 14:30:36,177 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2020-07-21 14:30:36,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-21 14:30:36,178 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 14:30:36,178 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 14:30:36,391 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 14:30:36,393 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 14:30:36,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 14:30:36,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1289106634, now seen corresponding path program 1 times [2020-07-21 14:30:36,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 14:30:36,395 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1578032737] [2020-07-21 14:30:36,395 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 14:30:36,440 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 14:30:36,441 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 14:30:36,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-21 14:30:36,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 14:30:36,480 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-21 14:30:36,482 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 14:30:36,542 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-21 14:30:36,543 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1578032737] [2020-07-21 14:30:36,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 14:30:36,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2020-07-21 14:30:36,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399735249] [2020-07-21 14:30:36,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-21 14:30:36,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 14:30:36,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-21 14:30:36,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-07-21 14:30:36,546 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 8 states. [2020-07-21 14:30:37,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 14:30:37,089 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2020-07-21 14:30:37,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-21 14:30:37,090 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-07-21 14:30:37,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 14:30:37,093 INFO L225 Difference]: With dead ends: 43 [2020-07-21 14:30:37,093 INFO L226 Difference]: Without dead ends: 33 [2020-07-21 14:30:37,100 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-07-21 14:30:37,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-21 14:30:37,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2020-07-21 14:30:37,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-21 14:30:37,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2020-07-21 14:30:37,121 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 22 [2020-07-21 14:30:37,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 14:30:37,122 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2020-07-21 14:30:37,122 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-21 14:30:37,122 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2020-07-21 14:30:37,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-21 14:30:37,123 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 14:30:37,124 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 14:30:37,324 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 14:30:37,325 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 14:30:37,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 14:30:37,326 INFO L82 PathProgramCache]: Analyzing trace with hash 92873718, now seen corresponding path program 2 times [2020-07-21 14:30:37,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 14:30:37,327 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [231094136] [2020-07-21 14:30:37,328 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 14:30:37,380 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 14:30:37,381 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 14:30:37,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-21 14:30:37,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 14:30:37,495 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 14:30:37,496 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 14:30:37,718 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 14:30:37,719 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [231094136] [2020-07-21 14:30:37,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 14:30:37,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2020-07-21 14:30:37,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922011935] [2020-07-21 14:30:37,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-21 14:30:37,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 14:30:37,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-21 14:30:37,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2020-07-21 14:30:37,722 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 13 states. [2020-07-21 14:30:38,258 WARN L193 SmtUtils]: Spent 350.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2020-07-21 14:30:39,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 14:30:39,038 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2020-07-21 14:30:39,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-21 14:30:39,040 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2020-07-21 14:30:39,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 14:30:39,042 INFO L225 Difference]: With dead ends: 46 [2020-07-21 14:30:39,042 INFO L226 Difference]: Without dead ends: 41 [2020-07-21 14:30:39,042 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=103, Invalid=169, Unknown=0, NotChecked=0, Total=272 [2020-07-21 14:30:39,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-07-21 14:30:39,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2020-07-21 14:30:39,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-21 14:30:39,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2020-07-21 14:30:39,052 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 22 [2020-07-21 14:30:39,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 14:30:39,053 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2020-07-21 14:30:39,053 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-21 14:30:39,053 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2020-07-21 14:30:39,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-21 14:30:39,055 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 14:30:39,055 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 14:30:39,256 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 14:30:39,257 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 14:30:39,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 14:30:39,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1362713706, now seen corresponding path program 2 times [2020-07-21 14:30:39,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 14:30:39,258 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [785259138] [2020-07-21 14:30:39,259 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 14:30:39,312 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 14:30:39,312 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 14:30:39,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 15 conjunts are in the unsatisfiable core [2020-07-21 14:30:39,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 14:30:39,398 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 73 proven. 57 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-07-21 14:30:39,398 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 14:30:41,713 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 73 proven. 57 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-07-21 14:30:41,714 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [785259138] [2020-07-21 14:30:41,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 14:30:41,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2020-07-21 14:30:41,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113377539] [2020-07-21 14:30:41,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-21 14:30:41,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 14:30:41,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-21 14:30:41,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=161, Unknown=1, NotChecked=0, Total=240 [2020-07-21 14:30:41,717 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 16 states. [2020-07-21 14:30:42,555 WARN L193 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 11 [2020-07-21 14:30:45,264 WARN L193 SmtUtils]: Spent 2.10 s on a formula simplification. DAG size of input: 16 DAG size of output: 11 [2020-07-21 14:30:45,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 14:30:45,445 INFO L93 Difference]: Finished difference Result 75 states and 91 transitions. [2020-07-21 14:30:45,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-21 14:30:45,448 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 40 [2020-07-21 14:30:45,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 14:30:45,449 INFO L225 Difference]: With dead ends: 75 [2020-07-21 14:30:45,449 INFO L226 Difference]: Without dead ends: 59 [2020-07-21 14:30:45,450 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=174, Invalid=287, Unknown=1, NotChecked=0, Total=462 [2020-07-21 14:30:45,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-07-21 14:30:45,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 54. [2020-07-21 14:30:45,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-07-21 14:30:45,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2020-07-21 14:30:45,460 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 40 [2020-07-21 14:30:45,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 14:30:45,460 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2020-07-21 14:30:45,460 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-21 14:30:45,460 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2020-07-21 14:30:45,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-21 14:30:45,461 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 14:30:45,462 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 14:30:45,675 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 14:30:45,676 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 14:30:45,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 14:30:45,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1588607722, now seen corresponding path program 3 times [2020-07-21 14:30:45,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 14:30:45,678 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1387687703] [2020-07-21 14:30:45,678 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 14:30:45,710 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 14:30:45,711 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 14:30:45,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 26 conjunts are in the unsatisfiable core [2020-07-21 14:30:45,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 14:30:45,889 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 14:30:45,889 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 14:30:48,523 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 144 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 14:30:48,524 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1387687703] [2020-07-21 14:30:48,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 14:30:48,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2020-07-21 14:30:48,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884994052] [2020-07-21 14:30:48,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-07-21 14:30:48,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 14:30:48,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-07-21 14:30:48,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=419, Unknown=1, NotChecked=0, Total=600 [2020-07-21 14:30:48,527 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 25 states. [2020-07-21 14:30:50,929 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 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 10) 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) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod c_main_~x~0 4294967296) .cse0))) is different from false [2020-07-21 14:30:52,959 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 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 10) 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) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0))) is different from false [2020-07-21 14:31:23,536 WARN L193 SmtUtils]: Spent 24.69 s on a formula simplification that was a NOOP. DAG size: 53 [2020-07-21 14:31:49,816 WARN L193 SmtUtils]: Spent 15.42 s on a formula simplification that was a NOOP. DAG size: 48 [2020-07-21 14:32:05,566 WARN L193 SmtUtils]: Spent 8.29 s on a formula simplification that was a NOOP. DAG size: 43 [2020-07-21 14:32:19,100 WARN L193 SmtUtils]: Spent 6.27 s on a formula simplification that was a NOOP. DAG size: 38 [2020-07-21 14:32:28,244 WARN L193 SmtUtils]: Spent 2.53 s on a formula simplification that was a NOOP. DAG size: 33 [2020-07-21 14:32:33,446 WARN L193 SmtUtils]: Spent 2.68 s on a formula simplification that was a NOOP. DAG size: 28 [2020-07-21 14:32:38,294 WARN L193 SmtUtils]: Spent 2.07 s on a formula simplification that was a NOOP. DAG size: 18 [2020-07-21 14:32:38,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 14:32:38,431 INFO L93 Difference]: Finished difference Result 83 states and 102 transitions. [2020-07-21 14:32:38,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-07-21 14:32:38,431 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 40 [2020-07-21 14:32:38,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 14:32:38,434 INFO L225 Difference]: With dead ends: 83 [2020-07-21 14:32:38,434 INFO L226 Difference]: Without dead ends: 78 [2020-07-21 14:32:38,435 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 95.0s TimeCoverageRelationStatistics Valid=391, Invalid=732, Unknown=7, NotChecked=130, Total=1260 [2020-07-21 14:32:38,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-07-21 14:32:38,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2020-07-21 14:32:38,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-07-21 14:32:38,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2020-07-21 14:32:38,448 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 40 [2020-07-21 14:32:38,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 14:32:38,448 INFO L479 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2020-07-21 14:32:38,448 INFO L480 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-07-21 14:32:38,449 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2020-07-21 14:32:38,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-07-21 14:32:38,450 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 14:32:38,450 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 14:32:38,658 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 14:32:38,659 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 14:32:38,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 14:32:38,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1251792523, now seen corresponding path program 3 times [2020-07-21 14:32:38,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 14:32:38,660 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [640402577] [2020-07-21 14:32:38,661 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 14:32:38,709 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 14:32:38,709 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 14:32:38,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 31 conjunts are in the unsatisfiable core [2020-07-21 14:32:38,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 14:32:38,894 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 29 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 14:32:38,895 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 14:32:43,724 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 29 proven. 295 refuted. 6 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 14:32:43,725 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [640402577] [2020-07-21 14:32:43,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 14:32:43,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2020-07-21 14:32:43,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249453327] [2020-07-21 14:32:43,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2020-07-21 14:32:43,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 14:32:43,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2020-07-21 14:32:43,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=704, Unknown=2, NotChecked=0, Total=992 [2020-07-21 14:32:43,728 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand 32 states. [2020-07-21 14:32:46,471 WARN L193 SmtUtils]: Spent 1.88 s on a formula simplification. DAG size of input: 76 DAG size of output: 11 [2020-07-21 14:32:51,740 WARN L193 SmtUtils]: Spent 1.73 s on a formula simplification. DAG size of input: 71 DAG size of output: 11 [2020-07-21 14:32:59,344 WARN L193 SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 66 DAG size of output: 11 [2020-07-21 14:33:08,147 WARN L193 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 61 DAG size of output: 11 [2020-07-21 14:33:17,279 WARN L193 SmtUtils]: Spent 3.39 s on a formula simplification. DAG size of input: 56 DAG size of output: 11 [2020-07-21 14:33:23,680 WARN L193 SmtUtils]: Spent 597.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 11 [2020-07-21 14:33:37,146 WARN L193 SmtUtils]: Spent 2.33 s on a formula simplification. DAG size of input: 46 DAG size of output: 11 [2020-07-21 14:33:48,158 WARN L193 SmtUtils]: Spent 2.19 s on a formula simplification. DAG size of input: 41 DAG size of output: 11 [2020-07-21 14:34:10,748 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 5) 4294967296) 5000000) (< (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) (< (mod (+ c_main_~x~0 4) 4294967296) 5000000)) is different from false [2020-07-21 14:34:19,617 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 13 [2020-07-21 14:34:29,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 14:34:29,726 INFO L93 Difference]: Finished difference Result 118 states and 144 transitions. [2020-07-21 14:34:29,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2020-07-21 14:34:29,726 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 55 [2020-07-21 14:34:29,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 14:34:29,729 INFO L225 Difference]: With dead ends: 118 [2020-07-21 14:34:29,729 INFO L226 Difference]: Without dead ends: 110 [2020-07-21 14:34:29,732 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 105.9s TimeCoverageRelationStatistics Valid=731, Invalid=1332, Unknown=11, NotChecked=88, Total=2162 [2020-07-21 14:34:29,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-07-21 14:34:29,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 102. [2020-07-21 14:34:29,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2020-07-21 14:34:29,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 111 transitions. [2020-07-21 14:34:29,756 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 111 transitions. Word has length 55 [2020-07-21 14:34:29,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 14:34:29,756 INFO L479 AbstractCegarLoop]: Abstraction has 102 states and 111 transitions. [2020-07-21 14:34:29,756 INFO L480 AbstractCegarLoop]: Interpolant automaton has 32 states. [2020-07-21 14:34:29,756 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 111 transitions. [2020-07-21 14:34:29,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-07-21 14:34:29,763 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 14:34:29,763 INFO L422 BasicCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 14:34:29,978 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 14:34:29,979 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 14:34:29,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 14:34:29,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1507791018, now seen corresponding path program 4 times [2020-07-21 14:34:29,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 14:34:29,981 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [78979575] [2020-07-21 14:34:29,982 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 14:34:30,023 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 14:34:30,024 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 14:34:30,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 50 conjunts are in the unsatisfiable core [2020-07-21 14:34:30,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 14:34:30,579 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 14:34:30,579 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 14:34:32,724 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 14:34:32,725 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [78979575] [2020-07-21 14:34:32,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 14:34:32,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 49 [2020-07-21 14:34:32,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797067053] [2020-07-21 14:34:32,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2020-07-21 14:34:32,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 14:34:32,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2020-07-21 14:34:32,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=648, Invalid=1704, Unknown=0, NotChecked=0, Total=2352 [2020-07-21 14:34:32,728 INFO L87 Difference]: Start difference. First operand 102 states and 111 transitions. Second operand 49 states. [2020-07-21 14:34:36,067 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 14) 4294967296) .cse0) (< (mod (+ c_main_~x~0 10) 4294967296) .cse0) (< (mod (+ c_main_~x~0 12) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 18) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 17) 4294967296) .cse0) (< (mod (+ c_main_~x~0 19) 4294967296) .cse0) (< (mod (+ c_main_~x~0 21) 4294967296) .cse0) (< (mod (+ c_main_~x~0 13) 4294967296) .cse0) (< (mod (+ c_main_~x~0 16) 4294967296) .cse0) (< (mod (+ c_main_~x~0 20) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 11) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod (+ c_main_~x~0 15) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 3) 4294967296) .cse0) (< (mod (+ c_main_~x~0 22) 4294967296) .cse0))) is different from false [2020-07-21 14:34:38,096 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~y~0 4294967296))) (and (< (mod (+ c_main_~x~0 14) 4294967296) .cse0) (< (mod (+ c_main_~x~0 10) 4294967296) .cse0) (< (mod (+ c_main_~x~0 12) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 18) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 17) 4294967296) .cse0) (< (mod (+ c_main_~x~0 19) 4294967296) .cse0) (< (mod (+ c_main_~x~0 21) 4294967296) .cse0) (< (mod (+ c_main_~x~0 13) 4294967296) .cse0) (< (mod (+ c_main_~x~0 16) 4294967296) .cse0) (< (mod (+ c_main_~x~0 20) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 11) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod (+ c_main_~x~0 15) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 3) 4294967296) .cse0) (< (mod (+ c_main_~x~0 22) 4294967296) .cse0))) is different from false [2020-07-21 14:34:40,106 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 14) 4294967296) .cse0) (< (mod (+ c_main_~x~0 10) 4294967296) .cse0) (< (mod (+ c_main_~x~0 12) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 18) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 17) 4294967296) .cse0) (< (mod (+ c_main_~x~0 19) 4294967296) .cse0) (< (mod (+ c_main_~x~0 21) 4294967296) .cse0) (< (mod (+ c_main_~x~0 13) 4294967296) .cse0) (< (mod (+ c_main_~x~0 16) 4294967296) .cse0) (< (mod (+ c_main_~x~0 20) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 11) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod (+ c_main_~x~0 15) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 3) 4294967296) .cse0))) is different from false [2020-07-21 14:34:42,146 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~y~0 4294967296))) (and (< (mod (+ c_main_~x~0 14) 4294967296) .cse0) (< (mod (+ c_main_~x~0 10) 4294967296) .cse0) (< (mod (+ c_main_~x~0 12) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 18) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 17) 4294967296) .cse0) (< (mod (+ c_main_~x~0 19) 4294967296) .cse0) (< (mod (+ c_main_~x~0 21) 4294967296) .cse0) (< (mod (+ c_main_~x~0 13) 4294967296) .cse0) (< (mod (+ c_main_~x~0 16) 4294967296) .cse0) (< (mod (+ c_main_~x~0 20) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 11) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod (+ c_main_~x~0 15) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 3) 4294967296) .cse0))) is different from false [2020-07-21 14:34:44,164 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 14) 4294967296) .cse0) (< (mod (+ c_main_~x~0 10) 4294967296) .cse0) (< (mod (+ c_main_~x~0 12) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 18) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 17) 4294967296) .cse0) (< (mod (+ c_main_~x~0 19) 4294967296) .cse0) (< (mod (+ c_main_~x~0 13) 4294967296) .cse0) (< (mod (+ c_main_~x~0 16) 4294967296) .cse0) (< (mod (+ c_main_~x~0 20) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 11) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod (+ c_main_~x~0 15) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 3) 4294967296) .cse0))) is different from false [2020-07-21 14:34:46,185 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~y~0 4294967296))) (and (< (mod (+ c_main_~x~0 14) 4294967296) .cse0) (< (mod (+ c_main_~x~0 10) 4294967296) .cse0) (< (mod (+ c_main_~x~0 12) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 18) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 17) 4294967296) .cse0) (< (mod (+ c_main_~x~0 19) 4294967296) .cse0) (< (mod (+ c_main_~x~0 13) 4294967296) .cse0) (< (mod (+ c_main_~x~0 16) 4294967296) .cse0) (< (mod (+ c_main_~x~0 20) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 11) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod (+ c_main_~x~0 15) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 3) 4294967296) .cse0))) is different from false [2020-07-21 14:34:48,224 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 14) 4294967296) .cse0) (< (mod (+ c_main_~x~0 10) 4294967296) .cse0) (< (mod (+ c_main_~x~0 12) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 18) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 17) 4294967296) .cse0) (< (mod (+ c_main_~x~0 19) 4294967296) .cse0) (< (mod (+ c_main_~x~0 13) 4294967296) .cse0) (< (mod (+ c_main_~x~0 16) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 11) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod (+ c_main_~x~0 15) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 3) 4294967296) .cse0))) is different from false [2020-07-21 14:34:50,336 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~y~0 4294967296))) (and (< (mod (+ c_main_~x~0 14) 4294967296) .cse0) (< (mod (+ c_main_~x~0 10) 4294967296) .cse0) (< (mod (+ c_main_~x~0 12) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 18) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 17) 4294967296) .cse0) (< (mod (+ c_main_~x~0 19) 4294967296) .cse0) (< (mod (+ c_main_~x~0 13) 4294967296) .cse0) (< (mod (+ c_main_~x~0 16) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 11) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod (+ c_main_~x~0 15) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 3) 4294967296) .cse0))) is different from false [2020-07-21 14:34:52,344 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 14) 4294967296) .cse0) (< (mod (+ c_main_~x~0 10) 4294967296) .cse0) (< (mod (+ c_main_~x~0 12) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 18) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 17) 4294967296) .cse0) (< (mod (+ c_main_~x~0 13) 4294967296) .cse0) (< (mod (+ c_main_~x~0 16) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 11) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod (+ c_main_~x~0 15) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 3) 4294967296) .cse0))) is different from false [2020-07-21 14:34:54,359 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~y~0 4294967296))) (and (< (mod (+ c_main_~x~0 14) 4294967296) .cse0) (< (mod (+ c_main_~x~0 10) 4294967296) .cse0) (< (mod (+ c_main_~x~0 12) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 18) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 17) 4294967296) .cse0) (< (mod (+ c_main_~x~0 13) 4294967296) .cse0) (< (mod (+ c_main_~x~0 16) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 11) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod (+ c_main_~x~0 15) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 3) 4294967296) .cse0))) is different from false [2020-07-21 14:34:56,395 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 14) 4294967296) .cse0) (< (mod (+ c_main_~x~0 10) 4294967296) .cse0) (< (mod (+ c_main_~x~0 12) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 17) 4294967296) .cse0) (< (mod (+ c_main_~x~0 13) 4294967296) .cse0) (< (mod (+ c_main_~x~0 16) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 11) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod (+ c_main_~x~0 15) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 3) 4294967296) .cse0))) is different from false [2020-07-21 14:34:58,436 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~y~0 4294967296))) (and (< (mod (+ c_main_~x~0 14) 4294967296) .cse0) (< (mod (+ c_main_~x~0 10) 4294967296) .cse0) (< (mod (+ c_main_~x~0 12) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 17) 4294967296) .cse0) (< (mod (+ c_main_~x~0 13) 4294967296) .cse0) (< (mod (+ c_main_~x~0 16) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 11) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod (+ c_main_~x~0 15) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 3) 4294967296) .cse0))) is different from false [2020-07-21 14:35:00,446 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 14) 4294967296) .cse0) (< (mod (+ c_main_~x~0 10) 4294967296) .cse0) (< (mod (+ c_main_~x~0 12) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 13) 4294967296) .cse0) (< (mod (+ c_main_~x~0 16) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 11) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod (+ c_main_~x~0 15) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 3) 4294967296) .cse0))) is different from false [2020-07-21 14:35:02,471 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~y~0 4294967296))) (and (< (mod (+ c_main_~x~0 14) 4294967296) .cse0) (< (mod (+ c_main_~x~0 10) 4294967296) .cse0) (< (mod (+ c_main_~x~0 12) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 13) 4294967296) .cse0) (< (mod (+ c_main_~x~0 16) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 11) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod (+ c_main_~x~0 15) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 3) 4294967296) .cse0))) is different from false [2020-07-21 14:35:04,493 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 14) 4294967296) .cse0) (< (mod (+ c_main_~x~0 10) 4294967296) .cse0) (< (mod (+ c_main_~x~0 12) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 13) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 11) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod (+ c_main_~x~0 15) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 3) 4294967296) .cse0))) is different from false [2020-07-21 14:35:06,528 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~y~0 4294967296))) (and (< (mod (+ c_main_~x~0 14) 4294967296) .cse0) (< (mod (+ c_main_~x~0 10) 4294967296) .cse0) (< (mod (+ c_main_~x~0 12) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 13) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 11) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod (+ c_main_~x~0 15) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 3) 4294967296) .cse0))) is different from false [2020-07-21 14:35:08,565 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 14) 4294967296) .cse0) (< (mod (+ c_main_~x~0 10) 4294967296) .cse0) (< (mod (+ c_main_~x~0 12) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 13) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 11) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 3) 4294967296) .cse0))) is different from false [2020-07-21 14:35:10,701 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~y~0 4294967296))) (and (< (mod (+ c_main_~x~0 14) 4294967296) .cse0) (< (mod (+ c_main_~x~0 10) 4294967296) .cse0) (< (mod (+ c_main_~x~0 12) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 13) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 11) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 3) 4294967296) .cse0))) is different from false [2020-07-21 14:35:12,770 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 10) 4294967296) .cse0) (< (mod (+ c_main_~x~0 12) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 13) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 11) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 3) 4294967296) .cse0))) is different from false [2020-07-21 14:35:14,780 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~y~0 4294967296))) (and (< (mod (+ c_main_~x~0 10) 4294967296) .cse0) (< (mod (+ c_main_~x~0 12) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0) (< (mod (+ c_main_~x~0 13) 4294967296) .cse0) (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 11) 4294967296) .cse0) (< (mod (+ c_main_~x~0 9) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 3) 4294967296) .cse0))) is different from false [2020-07-21 14:36:10,789 WARN L193 SmtUtils]: Spent 31.53 s on a formula simplification that was a NOOP. DAG size: 68 [2020-07-21 14:37:35,389 WARN L193 SmtUtils]: Spent 23.85 s on a formula simplification that was a NOOP. DAG size: 63 [2020-07-21 14:38:37,697 WARN L193 SmtUtils]: Spent 16.40 s on a formula simplification that was a NOOP. DAG size: 58 [2020-07-21 14:39:38,946 WARN L193 SmtUtils]: Spent 24.98 s on a formula simplification that was a NOOP. DAG size: 53 [2020-07-21 14:39:47,909 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 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 3) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0))) is different from false [2020-07-21 14:39:49,920 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~y~0 4294967296))) (and (< (mod (+ c_main_~x~0 7) 4294967296) .cse0) (< (mod (+ c_main_~x~0 6) 4294967296) .cse0) (< (mod (+ c_main_~x~0 5) 4294967296) .cse0) (< (mod (+ c_main_~x~0 8) 4294967296) .cse0) (< (mod (+ c_main_~x~0 4) 4294967296) .cse0) (< (mod (+ c_main_~x~0 2) 4294967296) .cse0) (< (mod (+ c_main_~x~0 3) 4294967296) .cse0) (< (mod (+ c_main_~x~0 1) 4294967296) .cse0))) is different from false [2020-07-21 14:40:10,727 WARN L193 SmtUtils]: Spent 8.28 s on a formula simplification that was a NOOP. DAG size: 43 [2020-07-21 14:40:24,686 WARN L193 SmtUtils]: Spent 3.25 s on a formula simplification that was a NOOP. DAG size: 38 [2020-07-21 14:40:28,002 WARN L193 SmtUtils]: Spent 671.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2020-07-21 14:40:33,416 WARN L193 SmtUtils]: Spent 2.21 s on a formula simplification that was a NOOP. DAG size: 28 [2020-07-21 14:40:42,260 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))) is different from false [2020-07-21 14:40:42,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 14:40:42,697 INFO L93 Difference]: Finished difference Result 155 states and 194 transitions. [2020-07-21 14:40:42,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2020-07-21 14:40:42,698 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 76 [2020-07-21 14:40:42,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 14:40:42,701 INFO L225 Difference]: With dead ends: 155 [2020-07-21 14:40:42,701 INFO L226 Difference]: Without dead ends: 150 [2020-07-21 14:40:42,704 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 23 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 290.4s TimeCoverageRelationStatistics Valid=1103, Invalid=2466, Unknown=63, NotChecked=3174, Total=6806 [2020-07-21 14:40:42,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2020-07-21 14:40:42,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2020-07-21 14:40:42,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-07-21 14:40:42,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 165 transitions. [2020-07-21 14:40:42,726 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 165 transitions. Word has length 76 [2020-07-21 14:40:42,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 14:40:42,726 INFO L479 AbstractCegarLoop]: Abstraction has 149 states and 165 transitions. [2020-07-21 14:40:42,726 INFO L480 AbstractCegarLoop]: Interpolant automaton has 49 states. [2020-07-21 14:40:42,727 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 165 transitions. [2020-07-21 14:40:42,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2020-07-21 14:40:42,728 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 14:40:42,728 INFO L422 BasicCegarLoop]: trace histogram [31, 31, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 14:40:42,929 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 14:40:42,930 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 14:40:42,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 14:40:42,930 INFO L82 PathProgramCache]: Analyzing trace with hash -242211211, now seen corresponding path program 4 times [2020-07-21 14:40:42,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 14:40:42,931 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1993924361] [2020-07-21 14:40:42,931 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-21 14:40:42,988 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 14:40:42,988 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 14:40:42,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 63 conjunts are in the unsatisfiable core [2020-07-21 14:40:42,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 14:40:43,796 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-21 14:40:43,797 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 14:41:02,343 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-21 14:41:02,343 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1993924361] [2020-07-21 14:41:02,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 14:41:02,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 64 [2020-07-21 14:41:02,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400195864] [2020-07-21 14:41:02,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2020-07-21 14:41:02,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 14:41:02,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2020-07-21 14:41:02,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1086, Invalid=2939, Unknown=7, NotChecked=0, Total=4032 [2020-07-21 14:41:02,347 INFO L87 Difference]: Start difference. First operand 149 states and 165 transitions. Second operand 64 states. [2020-07-21 14:41:06,485 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 26) 4294967296) 5000000) (< (mod (+ c_main_~x~0 11) 4294967296) 5000000) (< (mod (+ c_main_~x~0 2) 4294967296) 5000000) (< (mod (+ c_main_~x~0 8) 4294967296) 5000000) (< (mod (+ c_main_~x~0 19) 4294967296) 5000000) (< (mod (+ c_main_~x~0 3) 4294967296) 5000000) (< (mod (+ c_main_~x~0 1) 4294967296) 5000000) (< (mod (+ c_main_~x~0 6) 4294967296) 5000000) (< (mod (+ c_main_~x~0 16) 4294967296) 5000000) (< (mod (+ c_main_~x~0 14) 4294967296) 5000000) (< (mod (+ c_main_~x~0 27) 4294967296) 5000000) (< (mod (+ c_main_~x~0 10) 4294967296) 5000000) (< (mod (+ c_main_~x~0 24) 4294967296) 5000000) (< (mod (+ c_main_~x~0 13) 4294967296) 5000000) (< (mod (+ c_main_~x~0 29) 4294967296) 5000000) (< (mod (+ c_main_~x~0 18) 4294967296) 5000000) (< (mod (+ c_main_~x~0 22) 4294967296) 5000000) (< (mod (+ c_main_~x~0 4) 4294967296) 5000000) (< (mod (+ c_main_~x~0 21) 4294967296) 5000000) (< (mod (+ c_main_~x~0 17) 4294967296) 5000000) (< (mod (+ c_main_~x~0 23) 4294967296) 5000000) (< (mod (+ c_main_~x~0 30) 4294967296) 5000000) (< (mod (+ c_main_~x~0 9) 4294967296) 5000000) (< (mod (+ c_main_~x~0 25) 4294967296) 5000000) (< (mod (+ c_main_~x~0 15) 4294967296) 5000000) (< (mod (+ c_main_~x~0 7) 4294967296) 5000000) (< (mod (+ c_main_~x~0 20) 4294967296) 5000000) (< (mod (+ c_main_~x~0 28) 4294967296) 5000000) (< (mod (+ c_main_~x~0 12) 4294967296) 5000000) (< (mod c_main_~x~0 4294967296) 5000000) (< (mod (+ c_main_~x~0 5) 4294967296) 5000000)) is different from false [2020-07-21 14:41:08,497 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 26) 4294967296) 5000000) (< (mod (+ c_main_~x~0 11) 4294967296) 5000000) (< (mod (+ c_main_~x~0 2) 4294967296) 5000000) (< (mod (+ c_main_~x~0 8) 4294967296) 5000000) (< (mod (+ c_main_~x~0 19) 4294967296) 5000000) (< (mod (+ c_main_~x~0 3) 4294967296) 5000000) (< (mod (+ c_main_~x~0 1) 4294967296) 5000000) (< (mod (+ c_main_~x~0 6) 4294967296) 5000000) (< (mod (+ c_main_~x~0 16) 4294967296) 5000000) (< (mod (+ c_main_~x~0 14) 4294967296) 5000000) (< (mod (+ c_main_~x~0 27) 4294967296) 5000000) (< (mod (+ c_main_~x~0 10) 4294967296) 5000000) (< (mod (+ c_main_~x~0 24) 4294967296) 5000000) (< (mod (+ c_main_~x~0 13) 4294967296) 5000000) (< (mod (+ c_main_~x~0 29) 4294967296) 5000000) (< (mod (+ c_main_~x~0 18) 4294967296) 5000000) (< (mod (+ c_main_~x~0 22) 4294967296) 5000000) (< (mod (+ c_main_~x~0 4) 4294967296) 5000000) (< (mod (+ c_main_~x~0 21) 4294967296) 5000000) (< (mod (+ c_main_~x~0 17) 4294967296) 5000000) (< (mod (+ c_main_~x~0 23) 4294967296) 5000000) (< (mod (+ c_main_~x~0 30) 4294967296) 5000000) (< (mod (+ c_main_~x~0 9) 4294967296) 5000000) (< (mod (+ c_main_~x~0 25) 4294967296) 5000000) (< (mod (+ c_main_~x~0 15) 4294967296) 5000000) (< (mod (+ c_main_~x~0 7) 4294967296) 5000000) (< (mod (+ c_main_~x~0 20) 4294967296) 5000000) (< (mod (+ c_main_~x~0 28) 4294967296) 5000000) (< (mod (+ c_main_~x~0 12) 4294967296) 5000000) (< (mod (+ c_main_~x~0 5) 4294967296) 5000000)) is different from false [2020-07-21 14:41:10,507 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 26) 4294967296) 5000000) (< (mod (+ c_main_~x~0 11) 4294967296) 5000000) (< (mod (+ c_main_~x~0 2) 4294967296) 5000000) (< (mod (+ c_main_~x~0 8) 4294967296) 5000000) (< (mod (+ c_main_~x~0 19) 4294967296) 5000000) (< (mod (+ c_main_~x~0 3) 4294967296) 5000000) (< (mod (+ c_main_~x~0 1) 4294967296) 5000000) (< (mod (+ c_main_~x~0 6) 4294967296) 5000000) (< (mod (+ c_main_~x~0 16) 4294967296) 5000000) (< (mod (+ c_main_~x~0 14) 4294967296) 5000000) (< (mod (+ c_main_~x~0 27) 4294967296) 5000000) (< (mod (+ c_main_~x~0 10) 4294967296) 5000000) (< (mod (+ c_main_~x~0 24) 4294967296) 5000000) (< (mod (+ c_main_~x~0 13) 4294967296) 5000000) (< (mod (+ c_main_~x~0 29) 4294967296) 5000000) (< (mod (+ c_main_~x~0 18) 4294967296) 5000000) (< (mod (+ c_main_~x~0 22) 4294967296) 5000000) (< (mod (+ c_main_~x~0 4) 4294967296) 5000000) (< (mod (+ c_main_~x~0 21) 4294967296) 5000000) (< (mod (+ c_main_~x~0 17) 4294967296) 5000000) (< (mod (+ c_main_~x~0 23) 4294967296) 5000000) (< (mod (+ c_main_~x~0 9) 4294967296) 5000000) (< (mod (+ c_main_~x~0 25) 4294967296) 5000000) (< (mod (+ c_main_~x~0 15) 4294967296) 5000000) (< (mod (+ c_main_~x~0 7) 4294967296) 5000000) (< (mod (+ c_main_~x~0 20) 4294967296) 5000000) (< (mod (+ c_main_~x~0 28) 4294967296) 5000000) (< (mod (+ c_main_~x~0 12) 4294967296) 5000000) (< (mod c_main_~x~0 4294967296) 5000000) (< (mod (+ c_main_~x~0 5) 4294967296) 5000000)) is different from false [2020-07-21 14:41:12,517 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 26) 4294967296) 5000000) (< (mod (+ c_main_~x~0 11) 4294967296) 5000000) (< (mod (+ c_main_~x~0 2) 4294967296) 5000000) (< (mod (+ c_main_~x~0 8) 4294967296) 5000000) (< (mod (+ c_main_~x~0 19) 4294967296) 5000000) (< (mod (+ c_main_~x~0 3) 4294967296) 5000000) (< (mod (+ c_main_~x~0 1) 4294967296) 5000000) (< (mod (+ c_main_~x~0 6) 4294967296) 5000000) (< (mod (+ c_main_~x~0 16) 4294967296) 5000000) (< (mod (+ c_main_~x~0 14) 4294967296) 5000000) (< (mod (+ c_main_~x~0 27) 4294967296) 5000000) (< (mod (+ c_main_~x~0 10) 4294967296) 5000000) (< (mod (+ c_main_~x~0 24) 4294967296) 5000000) (< (mod (+ c_main_~x~0 13) 4294967296) 5000000) (< (mod (+ c_main_~x~0 29) 4294967296) 5000000) (< (mod (+ c_main_~x~0 18) 4294967296) 5000000) (< (mod (+ c_main_~x~0 22) 4294967296) 5000000) (< (mod (+ c_main_~x~0 4) 4294967296) 5000000) (< (mod (+ c_main_~x~0 21) 4294967296) 5000000) (< (mod (+ c_main_~x~0 17) 4294967296) 5000000) (< (mod (+ c_main_~x~0 23) 4294967296) 5000000) (< (mod (+ c_main_~x~0 9) 4294967296) 5000000) (< (mod (+ c_main_~x~0 25) 4294967296) 5000000) (< (mod (+ c_main_~x~0 15) 4294967296) 5000000) (< (mod (+ c_main_~x~0 7) 4294967296) 5000000) (< (mod (+ c_main_~x~0 20) 4294967296) 5000000) (< (mod (+ c_main_~x~0 28) 4294967296) 5000000) (< (mod (+ c_main_~x~0 12) 4294967296) 5000000) (< (mod (+ c_main_~x~0 5) 4294967296) 5000000)) is different from false [2020-07-21 14:41:14,527 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 26) 4294967296) 5000000) (< (mod (+ c_main_~x~0 11) 4294967296) 5000000) (< (mod (+ c_main_~x~0 2) 4294967296) 5000000) (< (mod (+ c_main_~x~0 8) 4294967296) 5000000) (< (mod (+ c_main_~x~0 19) 4294967296) 5000000) (< (mod (+ c_main_~x~0 3) 4294967296) 5000000) (< (mod (+ c_main_~x~0 1) 4294967296) 5000000) (< (mod (+ c_main_~x~0 6) 4294967296) 5000000) (< (mod (+ c_main_~x~0 16) 4294967296) 5000000) (< (mod (+ c_main_~x~0 14) 4294967296) 5000000) (< (mod (+ c_main_~x~0 27) 4294967296) 5000000) (< (mod (+ c_main_~x~0 10) 4294967296) 5000000) (< (mod (+ c_main_~x~0 24) 4294967296) 5000000) (< (mod (+ c_main_~x~0 13) 4294967296) 5000000) (< (mod (+ c_main_~x~0 18) 4294967296) 5000000) (< (mod (+ c_main_~x~0 22) 4294967296) 5000000) (< (mod (+ c_main_~x~0 4) 4294967296) 5000000) (< (mod (+ c_main_~x~0 21) 4294967296) 5000000) (< (mod (+ c_main_~x~0 17) 4294967296) 5000000) (< (mod (+ c_main_~x~0 23) 4294967296) 5000000) (< (mod (+ c_main_~x~0 9) 4294967296) 5000000) (< (mod (+ c_main_~x~0 25) 4294967296) 5000000) (< (mod (+ c_main_~x~0 15) 4294967296) 5000000) (< (mod (+ c_main_~x~0 7) 4294967296) 5000000) (< (mod (+ c_main_~x~0 20) 4294967296) 5000000) (< (mod (+ c_main_~x~0 28) 4294967296) 5000000) (< (mod (+ c_main_~x~0 12) 4294967296) 5000000) (< (mod c_main_~x~0 4294967296) 5000000) (< (mod (+ c_main_~x~0 5) 4294967296) 5000000)) is different from false [2020-07-21 14:41:31,264 WARN L193 SmtUtils]: Spent 9.96 s on a formula simplification. DAG size of input: 143 DAG size of output: 13 [2020-07-21 14:41:33,287 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 26) 4294967296) 5000000) (< (mod (+ c_main_~x~0 11) 4294967296) 5000000) (< (mod (+ c_main_~x~0 2) 4294967296) 5000000) (< (mod (+ c_main_~x~0 8) 4294967296) 5000000) (< (mod (+ c_main_~x~0 19) 4294967296) 5000000) (< (mod (+ c_main_~x~0 3) 4294967296) 5000000) (< (mod (+ c_main_~x~0 1) 4294967296) 5000000) (< (mod (+ c_main_~x~0 6) 4294967296) 5000000) (< (mod (+ c_main_~x~0 16) 4294967296) 5000000) (< (mod (+ c_main_~x~0 14) 4294967296) 5000000) (< (mod (+ c_main_~x~0 27) 4294967296) 5000000) (< (mod (+ c_main_~x~0 10) 4294967296) 5000000) (< (mod (+ c_main_~x~0 24) 4294967296) 5000000) (< (mod (+ c_main_~x~0 13) 4294967296) 5000000) (< (mod (+ c_main_~x~0 18) 4294967296) 5000000) (< (mod (+ c_main_~x~0 22) 4294967296) 5000000) (< (mod (+ c_main_~x~0 4) 4294967296) 5000000) (< (mod (+ c_main_~x~0 21) 4294967296) 5000000) (< (mod (+ c_main_~x~0 17) 4294967296) 5000000) (< (mod (+ c_main_~x~0 23) 4294967296) 5000000) (< (mod (+ c_main_~x~0 9) 4294967296) 5000000) (< (mod (+ c_main_~x~0 25) 4294967296) 5000000) (< (mod (+ c_main_~x~0 15) 4294967296) 5000000) (< (mod (+ c_main_~x~0 7) 4294967296) 5000000) (< (mod (+ c_main_~x~0 20) 4294967296) 5000000) (< (mod (+ c_main_~x~0 12) 4294967296) 5000000) (< (mod c_main_~x~0 4294967296) 5000000) (< (mod (+ c_main_~x~0 5) 4294967296) 5000000)) is different from false [2020-07-21 14:41:35,303 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 26) 4294967296) 5000000) (< (mod (+ c_main_~x~0 11) 4294967296) 5000000) (< (mod (+ c_main_~x~0 2) 4294967296) 5000000) (< (mod (+ c_main_~x~0 8) 4294967296) 5000000) (< (mod (+ c_main_~x~0 19) 4294967296) 5000000) (< (mod (+ c_main_~x~0 3) 4294967296) 5000000) (< (mod (+ c_main_~x~0 1) 4294967296) 5000000) (< (mod (+ c_main_~x~0 6) 4294967296) 5000000) (< (mod (+ c_main_~x~0 16) 4294967296) 5000000) (< (mod (+ c_main_~x~0 14) 4294967296) 5000000) (< (mod (+ c_main_~x~0 27) 4294967296) 5000000) (< (mod (+ c_main_~x~0 10) 4294967296) 5000000) (< (mod (+ c_main_~x~0 24) 4294967296) 5000000) (< (mod (+ c_main_~x~0 13) 4294967296) 5000000) (< (mod (+ c_main_~x~0 18) 4294967296) 5000000) (< (mod (+ c_main_~x~0 22) 4294967296) 5000000) (< (mod (+ c_main_~x~0 4) 4294967296) 5000000) (< (mod (+ c_main_~x~0 21) 4294967296) 5000000) (< (mod (+ c_main_~x~0 17) 4294967296) 5000000) (< (mod (+ c_main_~x~0 23) 4294967296) 5000000) (< (mod (+ c_main_~x~0 9) 4294967296) 5000000) (< (mod (+ c_main_~x~0 25) 4294967296) 5000000) (< (mod (+ c_main_~x~0 15) 4294967296) 5000000) (< (mod (+ c_main_~x~0 7) 4294967296) 5000000) (< (mod (+ c_main_~x~0 20) 4294967296) 5000000) (< (mod (+ c_main_~x~0 12) 4294967296) 5000000) (< (mod (+ c_main_~x~0 5) 4294967296) 5000000)) is different from false [2020-07-21 14:41:37,314 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 26) 4294967296) 5000000) (< (mod (+ c_main_~x~0 11) 4294967296) 5000000) (< (mod (+ c_main_~x~0 2) 4294967296) 5000000) (< (mod (+ c_main_~x~0 8) 4294967296) 5000000) (< (mod (+ c_main_~x~0 19) 4294967296) 5000000) (< (mod (+ c_main_~x~0 3) 4294967296) 5000000) (< (mod (+ c_main_~x~0 1) 4294967296) 5000000) (< (mod (+ c_main_~x~0 6) 4294967296) 5000000) (< (mod (+ c_main_~x~0 16) 4294967296) 5000000) (< (mod (+ c_main_~x~0 14) 4294967296) 5000000) (< (mod (+ c_main_~x~0 10) 4294967296) 5000000) (< (mod (+ c_main_~x~0 24) 4294967296) 5000000) (< (mod (+ c_main_~x~0 13) 4294967296) 5000000) (< (mod (+ c_main_~x~0 18) 4294967296) 5000000) (< (mod (+ c_main_~x~0 22) 4294967296) 5000000) (< (mod (+ c_main_~x~0 4) 4294967296) 5000000) (< (mod (+ c_main_~x~0 21) 4294967296) 5000000) (< (mod (+ c_main_~x~0 17) 4294967296) 5000000) (< (mod (+ c_main_~x~0 23) 4294967296) 5000000) (< (mod (+ c_main_~x~0 9) 4294967296) 5000000) (< (mod (+ c_main_~x~0 25) 4294967296) 5000000) (< (mod (+ c_main_~x~0 15) 4294967296) 5000000) (< (mod (+ c_main_~x~0 7) 4294967296) 5000000) (< (mod (+ c_main_~x~0 20) 4294967296) 5000000) (< (mod (+ c_main_~x~0 12) 4294967296) 5000000) (< (mod c_main_~x~0 4294967296) 5000000) (< (mod (+ c_main_~x~0 5) 4294967296) 5000000)) is different from false [2020-07-21 14:41:39,327 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 26) 4294967296) 5000000) (< (mod (+ c_main_~x~0 11) 4294967296) 5000000) (< (mod (+ c_main_~x~0 2) 4294967296) 5000000) (< (mod (+ c_main_~x~0 8) 4294967296) 5000000) (< (mod (+ c_main_~x~0 19) 4294967296) 5000000) (< (mod (+ c_main_~x~0 3) 4294967296) 5000000) (< (mod (+ c_main_~x~0 1) 4294967296) 5000000) (< (mod (+ c_main_~x~0 6) 4294967296) 5000000) (< (mod (+ c_main_~x~0 16) 4294967296) 5000000) (< (mod (+ c_main_~x~0 14) 4294967296) 5000000) (< (mod (+ c_main_~x~0 10) 4294967296) 5000000) (< (mod (+ c_main_~x~0 24) 4294967296) 5000000) (< (mod (+ c_main_~x~0 13) 4294967296) 5000000) (< (mod (+ c_main_~x~0 18) 4294967296) 5000000) (< (mod (+ c_main_~x~0 22) 4294967296) 5000000) (< (mod (+ c_main_~x~0 4) 4294967296) 5000000) (< (mod (+ c_main_~x~0 21) 4294967296) 5000000) (< (mod (+ c_main_~x~0 17) 4294967296) 5000000) (< (mod (+ c_main_~x~0 23) 4294967296) 5000000) (< (mod (+ c_main_~x~0 9) 4294967296) 5000000) (< (mod (+ c_main_~x~0 25) 4294967296) 5000000) (< (mod (+ c_main_~x~0 15) 4294967296) 5000000) (< (mod (+ c_main_~x~0 7) 4294967296) 5000000) (< (mod (+ c_main_~x~0 20) 4294967296) 5000000) (< (mod (+ c_main_~x~0 12) 4294967296) 5000000) (< (mod (+ c_main_~x~0 5) 4294967296) 5000000)) is different from false [2020-07-21 14:41:41,342 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 11) 4294967296) 5000000) (< (mod (+ c_main_~x~0 2) 4294967296) 5000000) (< (mod (+ c_main_~x~0 8) 4294967296) 5000000) (< (mod (+ c_main_~x~0 19) 4294967296) 5000000) (< (mod (+ c_main_~x~0 3) 4294967296) 5000000) (< (mod (+ c_main_~x~0 1) 4294967296) 5000000) (< (mod (+ c_main_~x~0 6) 4294967296) 5000000) (< (mod (+ c_main_~x~0 16) 4294967296) 5000000) (< (mod (+ c_main_~x~0 14) 4294967296) 5000000) (< (mod (+ c_main_~x~0 10) 4294967296) 5000000) (< (mod (+ c_main_~x~0 24) 4294967296) 5000000) (< (mod (+ c_main_~x~0 13) 4294967296) 5000000) (< (mod (+ c_main_~x~0 18) 4294967296) 5000000) (< (mod (+ c_main_~x~0 22) 4294967296) 5000000) (< (mod (+ c_main_~x~0 4) 4294967296) 5000000) (< (mod (+ c_main_~x~0 21) 4294967296) 5000000) (< (mod (+ c_main_~x~0 17) 4294967296) 5000000) (< (mod (+ c_main_~x~0 23) 4294967296) 5000000) (< (mod (+ c_main_~x~0 9) 4294967296) 5000000) (< (mod (+ c_main_~x~0 25) 4294967296) 5000000) (< (mod (+ c_main_~x~0 15) 4294967296) 5000000) (< (mod (+ c_main_~x~0 7) 4294967296) 5000000) (< (mod (+ c_main_~x~0 20) 4294967296) 5000000) (< (mod (+ c_main_~x~0 12) 4294967296) 5000000) (< (mod c_main_~x~0 4294967296) 5000000) (< (mod (+ c_main_~x~0 5) 4294967296) 5000000)) is different from false [2020-07-21 14:42:08,358 WARN L193 SmtUtils]: Spent 9.84 s on a formula simplification. DAG size of input: 128 DAG size of output: 13 [2020-07-21 14:42:10,380 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 11) 4294967296) 5000000) (< (mod (+ c_main_~x~0 2) 4294967296) 5000000) (< (mod (+ c_main_~x~0 8) 4294967296) 5000000) (< (mod (+ c_main_~x~0 19) 4294967296) 5000000) (< (mod (+ c_main_~x~0 3) 4294967296) 5000000) (< (mod (+ c_main_~x~0 1) 4294967296) 5000000) (< (mod (+ c_main_~x~0 6) 4294967296) 5000000) (< (mod (+ c_main_~x~0 16) 4294967296) 5000000) (< (mod (+ c_main_~x~0 14) 4294967296) 5000000) (< (mod (+ c_main_~x~0 10) 4294967296) 5000000) (< (mod (+ c_main_~x~0 24) 4294967296) 5000000) (< (mod (+ c_main_~x~0 13) 4294967296) 5000000) (< (mod (+ c_main_~x~0 18) 4294967296) 5000000) (< (mod (+ c_main_~x~0 22) 4294967296) 5000000) (< (mod (+ c_main_~x~0 4) 4294967296) 5000000) (< (mod (+ c_main_~x~0 21) 4294967296) 5000000) (< (mod (+ c_main_~x~0 17) 4294967296) 5000000) (< (mod (+ c_main_~x~0 23) 4294967296) 5000000) (< (mod (+ c_main_~x~0 9) 4294967296) 5000000) (< (mod (+ c_main_~x~0 15) 4294967296) 5000000) (< (mod (+ c_main_~x~0 7) 4294967296) 5000000) (< (mod (+ c_main_~x~0 20) 4294967296) 5000000) (< (mod (+ c_main_~x~0 12) 4294967296) 5000000) (< (mod c_main_~x~0 4294967296) 5000000) (< (mod (+ c_main_~x~0 5) 4294967296) 5000000)) is different from false [2020-07-21 14:42:35,779 WARN L193 SmtUtils]: Spent 7.46 s on a formula simplification. DAG size of input: 123 DAG size of output: 13 [2020-07-21 14:42:37,793 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 22) 4294967296) 5000000) (< (mod (+ c_main_~x~0 11) 4294967296) 5000000) (< (mod (+ c_main_~x~0 4) 4294967296) 5000000) (< (mod (+ c_main_~x~0 21) 4294967296) 5000000) (< (mod (+ c_main_~x~0 2) 4294967296) 5000000) (< (mod (+ c_main_~x~0 17) 4294967296) 5000000) (< (mod (+ c_main_~x~0 8) 4294967296) 5000000) (< (mod (+ c_main_~x~0 19) 4294967296) 5000000) (< (mod (+ c_main_~x~0 23) 4294967296) 5000000) (< (mod (+ c_main_~x~0 3) 4294967296) 5000000) (< (mod (+ c_main_~x~0 9) 4294967296) 5000000) (< (mod (+ c_main_~x~0 1) 4294967296) 5000000) (< (mod (+ c_main_~x~0 15) 4294967296) 5000000) (< (mod (+ c_main_~x~0 6) 4294967296) 5000000) (< (mod (+ c_main_~x~0 16) 4294967296) 5000000) (< (mod (+ c_main_~x~0 14) 4294967296) 5000000) (< (mod (+ c_main_~x~0 7) 4294967296) 5000000) (< (mod (+ c_main_~x~0 20) 4294967296) 5000000) (< (mod (+ c_main_~x~0 10) 4294967296) 5000000) (< (mod (+ c_main_~x~0 12) 4294967296) 5000000) (< (mod (+ c_main_~x~0 13) 4294967296) 5000000) (< (mod c_main_~x~0 4294967296) 5000000) (< (mod (+ c_main_~x~0 5) 4294967296) 5000000) (< (mod (+ c_main_~x~0 18) 4294967296) 5000000)) is different from false [2020-07-21 14:43:14,035 WARN L193 SmtUtils]: Spent 7.44 s on a formula simplification. DAG size of input: 118 DAG size of output: 13 [2020-07-21 14:43:16,064 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 22) 4294967296) 5000000) (< (mod (+ c_main_~x~0 11) 4294967296) 5000000) (< (mod (+ c_main_~x~0 4) 4294967296) 5000000) (< (mod (+ c_main_~x~0 21) 4294967296) 5000000) (< (mod (+ c_main_~x~0 2) 4294967296) 5000000) (< (mod (+ c_main_~x~0 17) 4294967296) 5000000) (< (mod (+ c_main_~x~0 8) 4294967296) 5000000) (< (mod (+ c_main_~x~0 19) 4294967296) 5000000) (< (mod (+ c_main_~x~0 3) 4294967296) 5000000) (< (mod (+ c_main_~x~0 9) 4294967296) 5000000) (< (mod (+ c_main_~x~0 1) 4294967296) 5000000) (< (mod (+ c_main_~x~0 15) 4294967296) 5000000) (< (mod (+ c_main_~x~0 6) 4294967296) 5000000) (< (mod (+ c_main_~x~0 16) 4294967296) 5000000) (< (mod (+ c_main_~x~0 14) 4294967296) 5000000) (< (mod (+ c_main_~x~0 7) 4294967296) 5000000) (< (mod (+ c_main_~x~0 20) 4294967296) 5000000) (< (mod (+ c_main_~x~0 10) 4294967296) 5000000) (< (mod (+ c_main_~x~0 12) 4294967296) 5000000) (< (mod (+ c_main_~x~0 13) 4294967296) 5000000) (< (mod c_main_~x~0 4294967296) 5000000) (< (mod (+ c_main_~x~0 5) 4294967296) 5000000) (< (mod (+ c_main_~x~0 18) 4294967296) 5000000)) is different from false [2020-07-21 14:44:02,110 WARN L193 SmtUtils]: Spent 14.36 s on a formula simplification. DAG size of input: 113 DAG size of output: 13 [2020-07-21 14:44:04,122 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 11) 4294967296) 5000000) (< (mod (+ c_main_~x~0 4) 4294967296) 5000000) (< (mod (+ c_main_~x~0 21) 4294967296) 5000000) (< (mod (+ c_main_~x~0 2) 4294967296) 5000000) (< (mod (+ c_main_~x~0 17) 4294967296) 5000000) (< (mod (+ c_main_~x~0 8) 4294967296) 5000000) (< (mod (+ c_main_~x~0 19) 4294967296) 5000000) (< (mod (+ c_main_~x~0 3) 4294967296) 5000000) (< (mod (+ c_main_~x~0 9) 4294967296) 5000000) (< (mod (+ c_main_~x~0 1) 4294967296) 5000000) (< (mod (+ c_main_~x~0 15) 4294967296) 5000000) (< (mod (+ c_main_~x~0 6) 4294967296) 5000000) (< (mod (+ c_main_~x~0 16) 4294967296) 5000000) (< (mod (+ c_main_~x~0 14) 4294967296) 5000000) (< (mod (+ c_main_~x~0 7) 4294967296) 5000000) (< (mod (+ c_main_~x~0 20) 4294967296) 5000000) (< (mod (+ c_main_~x~0 10) 4294967296) 5000000) (< (mod (+ c_main_~x~0 12) 4294967296) 5000000) (< (mod (+ c_main_~x~0 13) 4294967296) 5000000) (< (mod c_main_~x~0 4294967296) 5000000) (< (mod (+ c_main_~x~0 5) 4294967296) 5000000) (< (mod (+ c_main_~x~0 18) 4294967296) 5000000)) is different from false [2020-07-21 14:44:50,344 WARN L193 SmtUtils]: Spent 12.64 s on a formula simplification. DAG size of input: 108 DAG size of output: 18