/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/iftelse.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-6253b08 [2021-05-06 11:42:39,544 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-06 11:42:39,546 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-06 11:42:39,570 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-06 11:42:39,571 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-06 11:42:39,572 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-06 11:42:39,573 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-06 11:42:39,575 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-06 11:42:39,576 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-06 11:42:39,577 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-06 11:42:39,578 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-06 11:42:39,579 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-06 11:42:39,579 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-06 11:42:39,580 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-06 11:42:39,581 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-06 11:42:39,582 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-06 11:42:39,582 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-06 11:42:39,583 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-06 11:42:39,585 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-06 11:42:39,586 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-06 11:42:39,587 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-06 11:42:39,588 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-06 11:42:39,590 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-06 11:42:39,590 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-06 11:42:39,593 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-06 11:42:39,593 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-06 11:42:39,593 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-06 11:42:39,594 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-06 11:42:39,594 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-06 11:42:39,595 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-06 11:42:39,595 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-06 11:42:39,596 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-06 11:42:39,597 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-06 11:42:39,597 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-06 11:42:39,598 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-06 11:42:39,598 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-06 11:42:39,599 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-06 11:42:39,599 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-06 11:42:39,599 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-06 11:42:39,600 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-06 11:42:39,601 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-06 11:42:39,602 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2021-05-06 11:42:39,611 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-06 11:42:39,611 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-06 11:42:39,612 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-06 11:42:39,612 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-06 11:42:39,613 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-06 11:42:39,613 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-06 11:42:39,613 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-06 11:42:39,613 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-06 11:42:39,613 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-06 11:42:39,614 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-06 11:42:39,614 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-06 11:42:39,614 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-06 11:42:39,614 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-06 11:42:39,614 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-06 11:42:39,614 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-06 11:42:39,614 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-06 11:42:39,615 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-05-06 11:42:39,615 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-06 11:42:39,615 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-06 11:42:39,615 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-06 11:42:39,615 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2021-05-06 11:42:39,615 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-05-06 11:42:39,615 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2021-05-06 11:42:39,616 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2021-05-06 11:42:39,900 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-06 11:42:39,917 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-06 11:42:39,919 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-06 11:42:39,920 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-06 11:42:39,932 INFO L275 PluginConnector]: CDTParser initialized [2021-05-06 11:42:39,933 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/iftelse.c [2021-05-06 11:42:39,992 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/316a268ea/5d7bfa9a9cba44329c824da0b0e0718b/FLAG497122a6a [2021-05-06 11:42:40,426 INFO L306 CDTParser]: Found 1 translation units. [2021-05-06 11:42:40,426 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/iftelse.c [2021-05-06 11:42:40,431 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/316a268ea/5d7bfa9a9cba44329c824da0b0e0718b/FLAG497122a6a [2021-05-06 11:42:40,828 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/316a268ea/5d7bfa9a9cba44329c824da0b0e0718b [2021-05-06 11:42:40,834 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-06 11:42:40,838 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-05-06 11:42:40,841 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-06 11:42:40,841 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-06 11:42:40,845 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-06 11:42:40,845 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 11:42:40" (1/1) ... [2021-05-06 11:42:40,847 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f03dce7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:42:40, skipping insertion in model container [2021-05-06 11:42:40,847 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 11:42:40" (1/1) ... [2021-05-06 11:42:40,853 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-06 11:42:40,865 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-06 11:42:40,967 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/iftelse.c[406,419] [2021-05-06 11:42:40,977 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-06 11:42:40,984 INFO L203 MainTranslator]: Completed pre-run [2021-05-06 11:42:40,994 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/iftelse.c[406,419] [2021-05-06 11:42:40,998 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-06 11:42:41,010 INFO L208 MainTranslator]: Completed translation [2021-05-06 11:42:41,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:42:41 WrapperNode [2021-05-06 11:42:41,010 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-06 11:42:41,011 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-06 11:42:41,011 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-06 11:42:41,012 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-06 11:42:41,034 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:42:41" (1/1) ... [2021-05-06 11:42:41,034 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:42:41" (1/1) ... [2021-05-06 11:42:41,058 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:42:41" (1/1) ... [2021-05-06 11:42:41,058 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:42:41" (1/1) ... [2021-05-06 11:42:41,066 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:42:41" (1/1) ... [2021-05-06 11:42:41,070 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:42:41" (1/1) ... [2021-05-06 11:42:41,071 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:42:41" (1/1) ... [2021-05-06 11:42:41,072 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-06 11:42:41,076 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-06 11:42:41,077 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-06 11:42:41,077 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-06 11:42:41,079 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:42:41" (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 [2021-05-06 11:42:41,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-05-06 11:42:41,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-06 11:42:41,158 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-05-06 11:42:41,159 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-05-06 11:42:41,159 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-05-06 11:42:41,159 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-05-06 11:42:41,159 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-05-06 11:42:41,159 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-05-06 11:42:41,159 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-05-06 11:42:41,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-06 11:42:41,160 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-05-06 11:42:41,160 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-05-06 11:42:41,160 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2021-05-06 11:42:41,160 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-05-06 11:42:41,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-05-06 11:42:41,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-06 11:42:41,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-06 11:42:41,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-06 11:42:41,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-06 11:42:41,163 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-06 11:42:41,465 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-06 11:42:41,465 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-05-06 11:42:41,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 11:42:41 BoogieIcfgContainer [2021-05-06 11:42:41,466 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-06 11:42:41,468 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-06 11:42:41,468 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-06 11:42:41,470 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-06 11:42:41,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.05 11:42:40" (1/3) ... [2021-05-06 11:42:41,471 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fd59b7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 11:42:41, skipping insertion in model container [2021-05-06 11:42:41,471 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:42:41" (2/3) ... [2021-05-06 11:42:41,471 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fd59b7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 11:42:41, skipping insertion in model container [2021-05-06 11:42:41,471 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 11:42:41" (3/3) ... [2021-05-06 11:42:41,472 INFO L111 eAbstractionObserver]: Analyzing ICFG iftelse.c [2021-05-06 11:42:41,476 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2021-05-06 11:42:41,479 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-05-06 11:42:41,492 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-05-06 11:42:41,507 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-05-06 11:42:41,507 INFO L377 AbstractCegarLoop]: Hoare is true [2021-05-06 11:42:41,508 INFO L378 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2021-05-06 11:42:41,508 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-06 11:42:41,508 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-06 11:42:41,508 INFO L381 AbstractCegarLoop]: Difference is false [2021-05-06 11:42:41,508 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-06 11:42:41,508 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-06 11:42:41,519 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 14 states have (on average 1.5) internal successors, (21), 16 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-05-06 11:42:41,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-05-06 11:42:41,524 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:42:41,525 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 11:42:41,525 INFO L428 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 11:42:41,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:42:41,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1034116429, now seen corresponding path program 1 times [2021-05-06 11:42:41,549 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:42:41,549 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2060992307] [2021-05-06 11:42:41,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:42:41,608 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 11:42:41,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:42:42,082 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:42:42,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:42:42,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-06 11:42:42,095 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:42:42,095 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2060992307] [2021-05-06 11:42:42,097 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2060992307] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:42:42,097 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:42:42,097 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-05-06 11:42:42,097 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334405587] [2021-05-06 11:42:42,101 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-05-06 11:42:42,101 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:42:42,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-05-06 11:42:42,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-05-06 11:42:42,116 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.5) internal successors, (21), 16 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 11:42:53,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:42:53,308 INFO L93 Difference]: Finished difference Result 53 states and 73 transitions. [2021-05-06 11:42:53,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-06 11:42:53,309 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.25) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2021-05-06 11:42:53,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:42:53,315 INFO L225 Difference]: With dead ends: 53 [2021-05-06 11:42:53,315 INFO L226 Difference]: Without dead ends: 27 [2021-05-06 11:42:53,333 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 377.9ms TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2021-05-06 11:42:53,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-05-06 11:42:53,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2021-05-06 11:42:53,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-05-06 11:42:53,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2021-05-06 11:42:53,394 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 14 [2021-05-06 11:42:53,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:42:53,395 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2021-05-06 11:42:53,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 1.25) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 11:42:53,395 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2021-05-06 11:42:53,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-05-06 11:42:53,396 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:42:53,396 INFO L523 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 11:42:53,397 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-06 11:42:53,397 INFO L428 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 11:42:53,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:42:53,399 INFO L82 PathProgramCache]: Analyzing trace with hash -244126219, now seen corresponding path program 1 times [2021-05-06 11:42:53,399 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:42:53,400 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2001574647] [2021-05-06 11:42:53,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:42:53,428 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-06 11:42:53,452 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-05-06 11:42:53,458 INFO L73 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2021-05-06 11:42:53,461 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-06 11:42:53,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:42:53,775 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:42:53,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:42:53,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-06 11:42:53,866 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:42:53,866 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2001574647] [2021-05-06 11:42:53,866 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2001574647] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:42:53,866 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:42:53,867 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-05-06 11:42:53,867 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946950787] [2021-05-06 11:42:53,867 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-05-06 11:42:53,868 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:42:53,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-05-06 11:42:53,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-05-06 11:42:53,869 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 8 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 11:42:58,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:42:58,458 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2021-05-06 11:42:58,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-06 11:42:58,459 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 8 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2021-05-06 11:42:58,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:42:58,460 INFO L225 Difference]: With dead ends: 37 [2021-05-06 11:42:58,460 INFO L226 Difference]: Without dead ends: 27 [2021-05-06 11:42:58,461 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 488.3ms TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2021-05-06 11:42:58,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-05-06 11:42:58,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2021-05-06 11:42:58,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-05-06 11:42:58,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2021-05-06 11:42:58,469 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 17 [2021-05-06 11:42:58,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:42:58,469 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2021-05-06 11:42:58,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 8 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 11:42:58,469 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2021-05-06 11:42:58,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-05-06 11:42:58,470 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:42:58,470 INFO L523 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 11:42:58,470 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-06 11:42:58,470 INFO L428 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 11:42:58,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:42:58,471 INFO L82 PathProgramCache]: Analyzing trace with hash 722095884, now seen corresponding path program 1 times [2021-05-06 11:42:58,471 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:42:58,471 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [886369043] [2021-05-06 11:42:58,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:43:00,609 WARN L240 tifierPushTermWalker]: treesize reduction 13, result has 92.1 percent of original size [2021-05-06 11:43:00,617 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-06 11:43:00,631 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-06 11:43:00,648 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-06 11:43:00,656 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-06 11:43:04,875 WARN L205 SmtUtils]: Spent 4.22 s on a formula simplification that was a NOOP. DAG size: 14 [2021-05-06 11:43:09,267 WARN L205 SmtUtils]: Spent 4.39 s on a formula simplification that was a NOOP. DAG size: 12 [2021-05-06 11:43:09,269 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-06 11:43:09,270 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-06 11:43:09,271 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-06 11:43:13,441 WARN L205 SmtUtils]: Spent 4.17 s on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-06 11:43:17,832 WARN L205 SmtUtils]: Spent 4.39 s on a formula simplification that was a NOOP. DAG size: 14 [2021-05-06 11:43:18,593 WARN L205 SmtUtils]: Spent 759.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 1 [2021-05-06 11:43:18,603 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-06 11:43:18,687 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-06 11:43:18,694 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-06 11:43:23,070 WARN L205 SmtUtils]: Spent 4.37 s on a formula simplification that was a NOOP. DAG size: 18 [2021-05-06 11:43:23,092 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 67 [2021-05-06 11:43:23,093 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 68 [2021-05-06 11:43:23,094 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-06 11:43:23,096 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-06 11:43:23,097 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-06 11:43:23,098 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-05-06 11:43:23,099 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-06 11:43:23,100 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-05-06 11:43:27,418 WARN L205 SmtUtils]: Spent 4.31 s on a formula simplification. DAG size of input: 14 DAG size of output: 1 [2021-05-06 11:43:27,419 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 72 [2021-05-06 11:43:29,579 WARN L205 SmtUtils]: Spent 2.16 s on a formula simplification that was a NOOP. DAG size: 1 [2021-05-06 11:43:29,579 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 52 [2021-05-06 11:43:33,902 WARN L205 SmtUtils]: Spent 4.31 s on a formula simplification. DAG size of input: 5 DAG size of output: 1 [2021-05-06 11:43:36,059 WARN L205 SmtUtils]: Spent 2.16 s on a formula simplification that was a NOOP. DAG size: 6 [2021-05-06 11:43:40,369 WARN L205 SmtUtils]: Spent 4.30 s on a formula simplification that was a NOOP. DAG size: 3 [2021-05-06 11:43:42,525 WARN L205 SmtUtils]: Spent 2.15 s on a formula simplification that was a NOOP. DAG size: 3 [2021-05-06 11:43:42,527 WARN L245 tifierPushTermWalker]: treesize reduction 13, result has 92.1 percent of original size 152 [2021-05-06 11:43:55,467 WARN L205 SmtUtils]: Spent 12.94 s on a formula simplification that was a NOOP. DAG size: 27 [2021-05-06 11:43:55,471 INFO L73 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2021-05-06 11:43:55,479 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-06 11:43:55,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:43:55,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:43:55,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:43:55,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-06 11:43:56,160 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:43:56,330 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:43:58,493 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((aux_mod_v_main_~n~0_BEFORE_RETURN_1_44 Int)) (and (< aux_mod_v_main_~n~0_BEFORE_RETURN_1_44 4294967296) (< 0 aux_mod_v_main_~n~0_BEFORE_RETURN_1_44))) (= (ite (<= (mod (div (mod c_main_~i~0 4294967296) 2) 4294967296) (mod c_main_~j~0 4294967296)) 1 0) 1)) is different from true [2021-05-06 11:43:58,496 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:43:58,496 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [886369043] [2021-05-06 11:43:58,496 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [886369043] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:43:58,496 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:43:58,496 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-05-06 11:43:58,496 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684711187] [2021-05-06 11:43:58,496 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-05-06 11:43:58,496 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:43:58,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-05-06 11:43:58,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=172, Unknown=1, NotChecked=26, Total=240 [2021-05-06 11:43:58,497 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 10 states have internal predecessors, (16), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-06 11:44:14,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:44:14,556 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2021-05-06 11:44:14,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-05-06 11:44:14,709 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 10 states have internal predecessors, (16), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2021-05-06 11:44:14,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:44:14,711 INFO L225 Difference]: With dead ends: 45 [2021-05-06 11:44:14,711 INFO L226 Difference]: Without dead ends: 33 [2021-05-06 11:44:14,712 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 3508.5ms TimeCoverageRelationStatistics Valid=116, Invalid=589, Unknown=1, NotChecked=50, Total=756 [2021-05-06 11:44:14,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2021-05-06 11:44:14,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2021-05-06 11:44:14,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 24 states have internal predecessors, (25), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2021-05-06 11:44:14,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2021-05-06 11:44:14,730 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 22 [2021-05-06 11:44:14,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:44:14,730 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2021-05-06 11:44:14,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 10 states have internal predecessors, (16), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-06 11:44:14,730 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2021-05-06 11:44:14,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-05-06 11:44:14,731 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:44:14,731 INFO L523 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 11:44:14,731 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-05-06 11:44:14,731 INFO L428 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 11:44:14,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:44:14,732 INFO L82 PathProgramCache]: Analyzing trace with hash 488018533, now seen corresponding path program 2 times [2021-05-06 11:44:14,732 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:44:14,733 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [773690660] [2021-05-06 11:44:14,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:44:16,908 WARN L240 tifierPushTermWalker]: treesize reduction 13, result has 92.1 percent of original size [2021-05-06 11:44:16,911 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-06 11:44:16,919 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-06 11:44:16,932 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-06 11:44:16,934 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-06 11:44:17,055 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 1 [2021-05-06 11:44:17,059 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 43 [2021-05-06 11:44:17,059 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-05-06 11:44:17,060 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-06 11:44:17,062 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-05-06 11:44:17,062 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-06 11:44:17,063 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-05-06 11:44:17,124 WARN L240 tifierPushTermWalker]: treesize reduction 2, result has 97.2 percent of original size [2021-05-06 11:44:17,126 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-06 11:44:21,650 WARN L205 SmtUtils]: Spent 4.52 s on a formula simplification that was a NOOP. DAG size: 22 [2021-05-06 11:44:26,054 WARN L205 SmtUtils]: Spent 4.40 s on a formula simplification that was a NOOP. DAG size: 22 [2021-05-06 11:44:30,318 WARN L205 SmtUtils]: Spent 4.26 s on a formula simplification. DAG size of input: 22 DAG size of output: 1 [2021-05-06 11:44:30,321 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 68 [2021-05-06 11:44:30,326 WARN L245 tifierPushTermWalker]: treesize reduction 2, result has 97.2 percent of original size 69 [2021-05-06 11:44:30,328 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-06 11:44:30,331 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-06 11:44:30,333 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-06 11:44:34,710 WARN L205 SmtUtils]: Spent 4.38 s on a formula simplification that was a NOOP. DAG size: 22 [2021-05-06 11:44:39,160 WARN L205 SmtUtils]: Spent 4.45 s on a formula simplification that was a NOOP. DAG size: 22 [2021-05-06 11:44:39,161 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-05-06 11:44:39,162 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-05-06 11:44:39,164 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-06 11:44:43,518 WARN L205 SmtUtils]: Spent 4.35 s on a formula simplification that was a NOOP. DAG size: 18 [2021-05-06 11:44:47,898 WARN L205 SmtUtils]: Spent 4.38 s on a formula simplification that was a NOOP. DAG size: 22 [2021-05-06 11:44:52,253 WARN L205 SmtUtils]: Spent 4.35 s on a formula simplification that was a NOOP. DAG size: 22 [2021-05-06 11:44:56,677 WARN L205 SmtUtils]: Spent 4.42 s on a formula simplification that was a NOOP. DAG size: 19 [2021-05-06 11:44:56,678 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 82 [2021-05-06 11:44:56,679 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 83 [2021-05-06 11:44:56,684 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-06 11:44:56,688 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-06 11:44:56,690 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-06 11:45:01,115 WARN L205 SmtUtils]: Spent 4.42 s on a formula simplification that was a NOOP. DAG size: 22 [2021-05-06 11:45:03,349 WARN L205 SmtUtils]: Spent 2.23 s on a formula simplification. DAG size of input: 22 DAG size of output: 1 [2021-05-06 11:45:03,350 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-05-06 11:45:03,350 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-05-06 11:45:03,351 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-06 11:45:03,353 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-05-06 11:45:03,353 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-06 11:45:03,354 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-06 11:45:03,361 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-05-06 11:45:03,362 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-06 11:45:03,364 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-05-06 11:45:03,364 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-06 11:45:03,366 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-05-06 11:45:07,685 WARN L205 SmtUtils]: Spent 4.31 s on a formula simplification. DAG size of input: 14 DAG size of output: 1 [2021-05-06 11:45:07,689 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 72 [2021-05-06 11:45:09,859 WARN L205 SmtUtils]: Spent 2.17 s on a formula simplification that was a NOOP. DAG size: 1 [2021-05-06 11:45:09,861 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 52 [2021-05-06 11:45:12,033 WARN L205 SmtUtils]: Spent 2.16 s on a formula simplification that was a NOOP. DAG size: 3 [2021-05-06 11:45:16,340 WARN L205 SmtUtils]: Spent 4.31 s on a formula simplification that was a NOOP. DAG size: 3 [2021-05-06 11:45:18,573 WARN L205 SmtUtils]: Spent 2.23 s on a formula simplification that was a NOOP. DAG size: 7 [2021-05-06 11:45:20,731 WARN L205 SmtUtils]: Spent 2.16 s on a formula simplification. DAG size of input: 5 DAG size of output: 1 [2021-05-06 11:45:25,045 WARN L205 SmtUtils]: Spent 4.31 s on a formula simplification that was a NOOP. DAG size: 6 [2021-05-06 11:45:29,356 WARN L205 SmtUtils]: Spent 4.31 s on a formula simplification that was a NOOP. DAG size: 12 [2021-05-06 11:45:29,357 WARN L245 tifierPushTermWalker]: treesize reduction 13, result has 92.1 percent of original size 152 [2021-05-06 11:45:42,336 WARN L205 SmtUtils]: Spent 12.98 s on a formula simplification that was a NOOP. DAG size: 27 [2021-05-06 11:45:42,336 INFO L73 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2021-05-06 11:45:42,338 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-06 11:45:42,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:45:42,779 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:45:42,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:45:42,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-06 11:45:42,916 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:45:43,071 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:46:00,504 WARN L205 SmtUtils]: Spent 2.16 s on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2021-05-06 11:46:02,662 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (mod (+ c_main_~i~0 4294967293) 4294967296))) (and (= (ite (<= (mod (div .cse0 2) 4294967296) (mod c_main_~j~0 4294967296)) 1 0) 1) (< .cse0 (mod c_main_~n~0 4294967296)))) is different from true [2021-05-06 11:46:04,817 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (mod (+ c_main_~i~0 4294967293) 4294967296))) (and (= (ite (<= (mod (div .cse0 2) 4294967296) (mod (+ c_main_~j~0 4294967293) 4294967296)) 1 0) 1) (< .cse0 (mod c_main_~n~0 4294967296)) (not (= (mod c_main_~i~0 2) 0)))) is different from true [2021-05-06 11:46:06,975 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (mod (+ c_main_~i~0 4294967293) 4294967296)) (.cse1 (mod c_main_~n~0 4294967296))) (and (= (ite (<= (mod (div .cse0 2) 4294967296) (mod (+ c_main_~j~0 4294967293) 4294967296)) 1 0) 1) (< 0 .cse1) (< .cse0 .cse1) (not (= (mod c_main_~i~0 2) 0)))) is different from true [2021-05-06 11:46:06,987 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:46:09,149 WARN L838 $PredicateComparison]: unable to prove that (exists ((aux_div_aux_mod_v_main_~n~0_BEFORE_CALL_3_42_53 Int) (aux_mod_aux_mod_v_main_~i~0_BEFORE_CALL_3_57_50 Int) (v_main_~j~0_BEFORE_CALL_3 Int) (aux_mod_aux_mod_v_main_~n~0_BEFORE_CALL_3_42_53 Int) (aux_div_aux_mod_v_main_~i~0_BEFORE_CALL_3_57_50 Int)) (let ((.cse1 (+ (* 4294967296 aux_div_aux_mod_v_main_~n~0_BEFORE_CALL_3_42_53) aux_mod_aux_mod_v_main_~n~0_BEFORE_CALL_3_42_53)) (.cse0 (* aux_div_aux_mod_v_main_~i~0_BEFORE_CALL_3_57_50 2)) (.cse2 (+ aux_mod_aux_mod_v_main_~i~0_BEFORE_CALL_3_57_50 (* 2 aux_div_aux_mod_v_main_~i~0_BEFORE_CALL_3_57_50)))) (and (<= 0 aux_mod_aux_mod_v_main_~i~0_BEFORE_CALL_3_57_50) (< aux_mod_aux_mod_v_main_~n~0_BEFORE_CALL_3_42_53 4294967296) (= |c___VERIFIER_assert_#in~cond| (ite (<= (mod (div (mod (+ aux_mod_aux_mod_v_main_~i~0_BEFORE_CALL_3_57_50 .cse0 2) 4294967296) 2) 4294967296) (mod v_main_~j~0_BEFORE_CALL_3 4294967296)) 1 0)) (< .cse1 4294967296) (< 0 .cse1) (<= 0 aux_mod_aux_mod_v_main_~n~0_BEFORE_CALL_3_42_53) (not (= aux_mod_aux_mod_v_main_~i~0_BEFORE_CALL_3_57_50 0)) (< aux_mod_aux_mod_v_main_~i~0_BEFORE_CALL_3_57_50 2) (<= 1 .cse2) (< .cse2 4294967297) (= (ite (<= (mod (div (mod (+ aux_mod_aux_mod_v_main_~i~0_BEFORE_CALL_3_57_50 .cse0 4294967295) 4294967296) 2) 4294967296) (mod (+ v_main_~j~0_BEFORE_CALL_3 4294967293) 4294967296)) 1 0) 1) (< .cse2 (+ aux_mod_aux_mod_v_main_~n~0_BEFORE_CALL_3_42_53 1))))) is different from false [2021-05-06 11:46:09,157 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:46:11,364 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((aux_div_aux_mod_v_main_~i~0_28_22_89 Int) (aux_div_v_main_~i~0_28_22 Int) (aux_mod_aux_mod_v_main_~i~0_28_22_89 Int) (v_main_~j~0_25 Int)) (let ((.cse2 (* 2 aux_div_v_main_~i~0_28_22))) (let ((.cse0 (+ .cse2 4294967293)) (.cse1 (+ (* 4294967296 aux_div_aux_mod_v_main_~i~0_28_22_89) aux_mod_aux_mod_v_main_~i~0_28_22_89))) (and (< aux_mod_aux_mod_v_main_~i~0_28_22_89 4294967296) (<= .cse0 .cse1) (< aux_mod_aux_mod_v_main_~i~0_28_22_89 (mod c_main_~n~0 4294967296)) (not (= .cse1 .cse0)) (<= 0 aux_mod_aux_mod_v_main_~i~0_28_22_89) (= |c___VERIFIER_assert_#in~cond| (ite (<= (mod (div (mod (+ aux_mod_aux_mod_v_main_~i~0_28_22_89 3) 4294967296) 2) 4294967296) (mod v_main_~j~0_25 4294967296)) 1 0)) (= (ite (<= (mod (div (mod aux_mod_aux_mod_v_main_~i~0_28_22_89 4294967296) 2) 4294967296) (mod (+ v_main_~j~0_25 4294967293) 4294967296)) 1 0) 1) (< .cse1 (+ .cse2 4294967295)))))) (< 0 (mod c_main_~n~0 4294967296))) is different from false [2021-05-06 11:46:11,369 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:46:13,532 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((aux_div_aux_mod_v_main_~i~0_28_22_89 Int) (aux_div_v_main_~i~0_28_22 Int) (aux_mod_aux_mod_v_main_~i~0_28_22_89 Int) (v_main_~j~0_25 Int)) (let ((.cse2 (* 2 aux_div_v_main_~i~0_28_22))) (let ((.cse0 (+ .cse2 4294967293)) (.cse1 (+ (* 4294967296 aux_div_aux_mod_v_main_~i~0_28_22_89) aux_mod_aux_mod_v_main_~i~0_28_22_89))) (and (< aux_mod_aux_mod_v_main_~i~0_28_22_89 4294967296) (<= .cse0 .cse1) (< aux_mod_aux_mod_v_main_~i~0_28_22_89 (mod c_main_~n~0 4294967296)) (not (= .cse1 .cse0)) (<= 0 aux_mod_aux_mod_v_main_~i~0_28_22_89) (= |c___VERIFIER_assert_#in~cond| (ite (<= (mod (div (mod (+ aux_mod_aux_mod_v_main_~i~0_28_22_89 3) 4294967296) 2) 4294967296) (mod v_main_~j~0_25 4294967296)) 1 0)) (= (ite (<= (mod (div (mod aux_mod_aux_mod_v_main_~i~0_28_22_89 4294967296) 2) 4294967296) (mod (+ v_main_~j~0_25 4294967293) 4294967296)) 1 0) 1) (< .cse1 (+ .cse2 4294967295)))))) (< 0 (mod c_main_~n~0 4294967296)) (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond)) is different from false [2021-05-06 11:46:13,537 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:46:15,692 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((aux_div_aux_mod_v_main_~i~0_28_22_89 Int) (aux_div_v_main_~i~0_28_22 Int) (aux_mod_aux_mod_v_main_~i~0_28_22_89 Int) (v_main_~j~0_25 Int)) (let ((.cse2 (* 2 aux_div_v_main_~i~0_28_22))) (let ((.cse0 (+ .cse2 4294967293)) (.cse1 (+ (* 4294967296 aux_div_aux_mod_v_main_~i~0_28_22_89) aux_mod_aux_mod_v_main_~i~0_28_22_89))) (and (< aux_mod_aux_mod_v_main_~i~0_28_22_89 4294967296) (<= .cse0 .cse1) (< aux_mod_aux_mod_v_main_~i~0_28_22_89 (mod c_main_~n~0 4294967296)) (not (= .cse1 .cse0)) (<= 0 aux_mod_aux_mod_v_main_~i~0_28_22_89) (= |c___VERIFIER_assert_#in~cond| (ite (<= (mod (div (mod (+ aux_mod_aux_mod_v_main_~i~0_28_22_89 3) 4294967296) 2) 4294967296) (mod v_main_~j~0_25 4294967296)) 1 0)) (= (ite (<= (mod (div (mod aux_mod_aux_mod_v_main_~i~0_28_22_89 4294967296) 2) 4294967296) (mod (+ v_main_~j~0_25 4294967293) 4294967296)) 1 0) 1) (< .cse1 (+ .cse2 4294967295)))))) (< 0 (mod c_main_~n~0 4294967296)) (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond) (not (= c___VERIFIER_assert_~cond 0))) is different from false [2021-05-06 11:46:15,703 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:46:15,715 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-06 11:46:17,873 WARN L838 $PredicateComparison]: unable to prove that (and (not (= (ite (<= (mod (div (mod c_main_~i~0 4294967296) 2) 4294967296) (mod c_main_~j~0 4294967296)) 1 0) 0)) (exists ((aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_3_44_55 Int) (aux_div_aux_mod_v_main_~i~0_28_22_89 Int) (aux_div_v_main_~i~0_28_22 Int) (aux_div_aux_mod_v_main_~n~0_BEFORE_RETURN_3_44_55 Int) (aux_mod_aux_mod_v_main_~i~0_28_22_89 Int) (v_main_~j~0_25 Int)) (let ((.cse3 (* 2 aux_div_v_main_~i~0_28_22))) (let ((.cse0 (+ .cse3 4294967293)) (.cse2 (+ aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_3_44_55 (* 4294967296 aux_div_aux_mod_v_main_~n~0_BEFORE_RETURN_3_44_55))) (.cse1 (+ (* 4294967296 aux_div_aux_mod_v_main_~i~0_28_22_89) aux_mod_aux_mod_v_main_~i~0_28_22_89))) (and (< aux_mod_aux_mod_v_main_~i~0_28_22_89 4294967296) (<= .cse0 .cse1) (< .cse2 4294967296) (< aux_mod_aux_mod_v_main_~i~0_28_22_89 .cse2) (< 0 aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_3_44_55) (= (ite (<= (mod (div (mod c_main_~i~0 4294967296) 2) 4294967296) (mod c_main_~j~0 4294967296)) 1 0) (ite (<= (mod (div (mod (+ aux_mod_aux_mod_v_main_~i~0_28_22_89 3) 4294967296) 2) 4294967296) (mod v_main_~j~0_25 4294967296)) 1 0)) (< aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_3_44_55 4294967296) (not (= .cse1 .cse0)) (<= 0 .cse2) (<= 0 aux_mod_aux_mod_v_main_~i~0_28_22_89) (= (ite (<= (mod (div (mod aux_mod_aux_mod_v_main_~i~0_28_22_89 4294967296) 2) 4294967296) (mod (+ v_main_~j~0_25 4294967293) 4294967296)) 1 0) 1) (< .cse1 (+ .cse3 4294967295))))))) is different from false [2021-05-06 11:46:17,879 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:46:17,879 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [773690660] [2021-05-06 11:46:17,879 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [773690660] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:46:17,879 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:46:17,879 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-05-06 11:46:17,880 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174205330] [2021-05-06 11:46:17,880 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-05-06 11:46:17,880 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:46:17,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-05-06 11:46:17,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=199, Unknown=14, NotChecked=280, Total=552 [2021-05-06 11:46:17,881 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 21 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 15 states have internal predecessors, (22), 4 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-05-06 11:46:24,621 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_#t~string5.offset| |c_old(#t~string5.offset)|) (= |c_old(#length)| |c_#length|) (= |c_#t~string6.base| |c_old(#t~string6.base)|) (= c_~SIZE~0 |c_old(~SIZE~0)|) (= |c_#t~string6.offset| |c_old(#t~string6.offset)|) (< 0 (mod c_main_~n~0 4294967296)) (= |c_#t~string4.offset| |c_old(#t~string4.offset)|) (= |c_old(#valid)| |c_#valid|) (= |c_#t~string5.base| |c_old(#t~string5.base)|) (= |c___VERIFIER_assert_#in~cond| 1) (exists ((aux_div_aux_mod_v_main_~i~0_28_22_89 Int) (aux_div_v_main_~i~0_28_22 Int) (aux_mod_aux_mod_v_main_~i~0_28_22_89 Int) (v_main_~j~0_25 Int)) (let ((.cse2 (* 2 aux_div_v_main_~i~0_28_22))) (let ((.cse0 (+ .cse2 4294967293)) (.cse1 (+ (* 4294967296 aux_div_aux_mod_v_main_~i~0_28_22_89) aux_mod_aux_mod_v_main_~i~0_28_22_89))) (and (< aux_mod_aux_mod_v_main_~i~0_28_22_89 4294967296) (<= .cse0 .cse1) (< aux_mod_aux_mod_v_main_~i~0_28_22_89 (mod c_main_~n~0 4294967296)) (not (= .cse1 .cse0)) (<= 0 aux_mod_aux_mod_v_main_~i~0_28_22_89) (= |c___VERIFIER_assert_#in~cond| (ite (<= (mod (div (mod (+ aux_mod_aux_mod_v_main_~i~0_28_22_89 3) 4294967296) 2) 4294967296) (mod v_main_~j~0_25 4294967296)) 1 0)) (= (ite (<= (mod (div (mod aux_mod_aux_mod_v_main_~i~0_28_22_89 4294967296) 2) 4294967296) (mod (+ v_main_~j~0_25 4294967293) 4294967296)) 1 0) 1) (< .cse1 (+ .cse2 4294967295)))))) (= |c_#t~string4.base| |c_old(#t~string4.base)|) (= |c_#NULL.base| |c_old(#NULL.base)|) (= |c_#NULL.offset| |c_old(#NULL.offset)|)) is different from false [2021-05-06 11:46:26,775 WARN L838 $PredicateComparison]: unable to prove that (and (= |c___VERIFIER_assert_#in~cond| 1) (exists ((aux_div_aux_mod_v_main_~i~0_28_22_89 Int) (aux_div_v_main_~i~0_28_22 Int) (aux_mod_aux_mod_v_main_~i~0_28_22_89 Int) (v_main_~j~0_25 Int)) (let ((.cse2 (* 2 aux_div_v_main_~i~0_28_22))) (let ((.cse0 (+ .cse2 4294967293)) (.cse1 (+ (* 4294967296 aux_div_aux_mod_v_main_~i~0_28_22_89) aux_mod_aux_mod_v_main_~i~0_28_22_89))) (and (< aux_mod_aux_mod_v_main_~i~0_28_22_89 4294967296) (<= .cse0 .cse1) (< aux_mod_aux_mod_v_main_~i~0_28_22_89 (mod c_main_~n~0 4294967296)) (not (= .cse1 .cse0)) (<= 0 aux_mod_aux_mod_v_main_~i~0_28_22_89) (= |c___VERIFIER_assert_#in~cond| (ite (<= (mod (div (mod (+ aux_mod_aux_mod_v_main_~i~0_28_22_89 3) 4294967296) 2) 4294967296) (mod v_main_~j~0_25 4294967296)) 1 0)) (= (ite (<= (mod (div (mod aux_mod_aux_mod_v_main_~i~0_28_22_89 4294967296) 2) 4294967296) (mod (+ v_main_~j~0_25 4294967293) 4294967296)) 1 0) 1) (< .cse1 (+ .cse2 4294967295)))))) (< 0 (mod c_main_~n~0 4294967296)) (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond)) is different from false [2021-05-06 11:46:28,930 WARN L838 $PredicateComparison]: unable to prove that (and (= |c___VERIFIER_assert_#in~cond| 1) (exists ((aux_div_aux_mod_v_main_~i~0_28_22_89 Int) (aux_div_v_main_~i~0_28_22 Int) (aux_mod_aux_mod_v_main_~i~0_28_22_89 Int) (v_main_~j~0_25 Int)) (let ((.cse2 (* 2 aux_div_v_main_~i~0_28_22))) (let ((.cse0 (+ .cse2 4294967293)) (.cse1 (+ (* 4294967296 aux_div_aux_mod_v_main_~i~0_28_22_89) aux_mod_aux_mod_v_main_~i~0_28_22_89))) (and (< aux_mod_aux_mod_v_main_~i~0_28_22_89 4294967296) (<= .cse0 .cse1) (< aux_mod_aux_mod_v_main_~i~0_28_22_89 (mod c_main_~n~0 4294967296)) (not (= .cse1 .cse0)) (<= 0 aux_mod_aux_mod_v_main_~i~0_28_22_89) (= |c___VERIFIER_assert_#in~cond| (ite (<= (mod (div (mod (+ aux_mod_aux_mod_v_main_~i~0_28_22_89 3) 4294967296) 2) 4294967296) (mod v_main_~j~0_25 4294967296)) 1 0)) (= (ite (<= (mod (div (mod aux_mod_aux_mod_v_main_~i~0_28_22_89 4294967296) 2) 4294967296) (mod (+ v_main_~j~0_25 4294967293) 4294967296)) 1 0) 1) (< .cse1 (+ .cse2 4294967295)))))) (< 0 (mod c_main_~n~0 4294967296)) (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond) (not (= c___VERIFIER_assert_~cond 0))) is different from false [2021-05-06 11:46:31,086 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (ite (<= (mod (div (mod c_main_~i~0 4294967296) 2) 4294967296) (mod c_main_~j~0 4294967296)) 1 0))) (and (not (= .cse0 0)) (= .cse0 1) (exists ((aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_3_44_55 Int) (aux_div_aux_mod_v_main_~i~0_28_22_89 Int) (aux_div_v_main_~i~0_28_22 Int) (aux_div_aux_mod_v_main_~n~0_BEFORE_RETURN_3_44_55 Int) (aux_mod_aux_mod_v_main_~i~0_28_22_89 Int) (v_main_~j~0_25 Int)) (let ((.cse4 (* 2 aux_div_v_main_~i~0_28_22))) (let ((.cse1 (+ .cse4 4294967293)) (.cse3 (+ aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_3_44_55 (* 4294967296 aux_div_aux_mod_v_main_~n~0_BEFORE_RETURN_3_44_55))) (.cse2 (+ (* 4294967296 aux_div_aux_mod_v_main_~i~0_28_22_89) aux_mod_aux_mod_v_main_~i~0_28_22_89))) (and (< aux_mod_aux_mod_v_main_~i~0_28_22_89 4294967296) (<= .cse1 .cse2) (< .cse3 4294967296) (< aux_mod_aux_mod_v_main_~i~0_28_22_89 .cse3) (< 0 aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_3_44_55) (= (ite (<= (mod (div (mod c_main_~i~0 4294967296) 2) 4294967296) (mod c_main_~j~0 4294967296)) 1 0) (ite (<= (mod (div (mod (+ aux_mod_aux_mod_v_main_~i~0_28_22_89 3) 4294967296) 2) 4294967296) (mod v_main_~j~0_25 4294967296)) 1 0)) (< aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_3_44_55 4294967296) (not (= .cse2 .cse1)) (<= 0 .cse3) (<= 0 aux_mod_aux_mod_v_main_~i~0_28_22_89) (= (ite (<= (mod (div (mod aux_mod_aux_mod_v_main_~i~0_28_22_89 4294967296) 2) 4294967296) (mod (+ v_main_~j~0_25 4294967293) 4294967296)) 1 0) 1) (< .cse2 (+ .cse4 4294967295)))))))) is different from false [2021-05-06 11:46:33,237 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (ite (<= (mod (div (mod c_main_~i~0 4294967296) 2) 4294967296) (mod c_main_~j~0 4294967296)) 1 0))) (and (not (= .cse0 0)) (= .cse0 1) (exists ((aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_3_44_55 Int) (aux_div_aux_mod_v_main_~i~0_28_22_89 Int) (aux_div_v_main_~i~0_28_22 Int) (aux_div_aux_mod_v_main_~n~0_BEFORE_RETURN_3_44_55 Int) (aux_mod_aux_mod_v_main_~i~0_28_22_89 Int) (v_main_~j~0_25 Int)) (let ((.cse4 (* 2 aux_div_v_main_~i~0_28_22))) (let ((.cse1 (+ .cse4 4294967293)) (.cse3 (+ aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_3_44_55 (* 4294967296 aux_div_aux_mod_v_main_~n~0_BEFORE_RETURN_3_44_55))) (.cse2 (+ (* 4294967296 aux_div_aux_mod_v_main_~i~0_28_22_89) aux_mod_aux_mod_v_main_~i~0_28_22_89))) (and (< aux_mod_aux_mod_v_main_~i~0_28_22_89 4294967296) (<= .cse1 .cse2) (< .cse3 4294967296) (< aux_mod_aux_mod_v_main_~i~0_28_22_89 .cse3) (< 0 aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_3_44_55) (= (ite (<= (mod (div (mod c_main_~i~0 4294967296) 2) 4294967296) (mod c_main_~j~0 4294967296)) 1 0) (ite (<= (mod (div (mod (+ aux_mod_aux_mod_v_main_~i~0_28_22_89 3) 4294967296) 2) 4294967296) (mod v_main_~j~0_25 4294967296)) 1 0)) (< aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_3_44_55 4294967296) (not (= .cse2 .cse1)) (<= 0 .cse3) (<= 0 aux_mod_aux_mod_v_main_~i~0_28_22_89) (= (ite (<= (mod (div (mod aux_mod_aux_mod_v_main_~i~0_28_22_89 4294967296) 2) 4294967296) (mod (+ v_main_~j~0_25 4294967293) 4294967296)) 1 0) 1) (< .cse2 (+ .cse4 4294967295)))))))) is different from true [2021-05-06 11:46:35,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:46:35,421 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2021-05-06 11:46:35,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-05-06 11:46:35,422 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 15 states have internal predecessors, (22), 4 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 30 [2021-05-06 11:46:35,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:46:35,422 INFO L225 Difference]: With dead ends: 41 [2021-05-06 11:46:35,422 INFO L226 Difference]: Without dead ends: 0 [2021-05-06 11:46:35,423 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 6 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 48660.0ms TimeCoverageRelationStatistics Valid=85, Invalid=286, Unknown=19, NotChecked=540, Total=930 [2021-05-06 11:46:35,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-05-06 11:46:35,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-05-06 11:46:35,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-06 11:46:35,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-05-06 11:46:35,424 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2021-05-06 11:46:35,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:46:35,424 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-05-06 11:46:35,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 21 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 15 states have internal predecessors, (22), 4 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-05-06 11:46:35,424 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-05-06 11:46:35,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-05-06 11:46:35,424 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-05-06 11:46:35,426 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-05-06 11:47:46,521 WARN L205 SmtUtils]: Spent 1.18 m on a formula simplification. DAG size of input: 90 DAG size of output: 55 [2021-05-06 11:48:12,479 WARN L205 SmtUtils]: Spent 25.94 s on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2021-05-06 11:49:04,140 WARN L205 SmtUtils]: Spent 51.62 s on a formula simplification. DAG size of input: 97 DAG size of output: 68 [2021-05-06 11:49:19,580 WARN L205 SmtUtils]: Spent 15.38 s on a formula simplification. DAG size of input: 86 DAG size of output: 1 [2021-05-06 11:50:12,118 WARN L205 SmtUtils]: Spent 52.54 s on a formula simplification. DAG size of input: 90 DAG size of output: 55 [2021-05-06 11:50:36,031 WARN L205 SmtUtils]: Spent 23.90 s on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2021-05-06 11:51:47,369 WARN L205 SmtUtils]: Spent 1.19 m on a formula simplification. DAG size of input: 90 DAG size of output: 55 [2021-05-06 11:51:47,372 INFO L198 CegarLoopUtils]: For program point reach_errorEXIT(line 4) no Hoare annotation was computed. [2021-05-06 11:51:47,372 INFO L198 CegarLoopUtils]: For program point reach_errorENTRY(line 4) no Hoare annotation was computed. [2021-05-06 11:51:47,373 INFO L198 CegarLoopUtils]: For program point reach_errorFINAL(line 4) no Hoare annotation was computed. [2021-05-06 11:51:47,373 INFO L201 CegarLoopUtils]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2021-05-06 11:51:47,373 INFO L194 CegarLoopUtils]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string5.base| |old(#t~string5.base)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= ~SIZE~0 |old(~SIZE~0)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= |#t~string4.base| |old(#t~string4.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|)) [2021-05-06 11:51:47,373 INFO L201 CegarLoopUtils]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2021-05-06 11:51:47,373 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2021-05-06 11:51:47,373 INFO L201 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: true [2021-05-06 11:51:47,373 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-05-06 11:51:47,373 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2021-05-06 11:51:47,373 INFO L198 CegarLoopUtils]: For program point assume_abort_if_notENTRY(lines 6 8) no Hoare annotation was computed. [2021-05-06 11:51:47,373 INFO L198 CegarLoopUtils]: For program point L7(line 7) no Hoare annotation was computed. [2021-05-06 11:51:47,374 INFO L198 CegarLoopUtils]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2021-05-06 11:51:47,374 INFO L198 CegarLoopUtils]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2021-05-06 11:51:47,374 INFO L194 CegarLoopUtils]: At program point L29(line 29) the Hoare annotation is: (and (= main_~i~0 main_~j~0) (< (mod (+ main_~i~0 4294967293) 4294967296) (mod main_~n~0 4294967296)) (= main_~i~0 3)) [2021-05-06 11:51:47,374 INFO L201 CegarLoopUtils]: At program point mainEXIT(lines 17 32) the Hoare annotation is: true [2021-05-06 11:51:47,374 INFO L201 CegarLoopUtils]: At program point mainFINAL(lines 17 32) the Hoare annotation is: true [2021-05-06 11:51:47,374 INFO L201 CegarLoopUtils]: At program point mainENTRY(lines 17 32) the Hoare annotation is: true [2021-05-06 11:51:47,374 INFO L194 CegarLoopUtils]: At program point L28(lines 22 30) the Hoare annotation is: (or (and (exists ((aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_3_44_55 Int) (aux_div_aux_mod_v_main_~i~0_28_22_89 Int) (aux_div_v_main_~i~0_28_22 Int) (aux_div_aux_mod_v_main_~n~0_BEFORE_RETURN_3_44_55 Int) (aux_mod_aux_mod_v_main_~i~0_28_22_89 Int) (v_main_~j~0_25 Int)) (let ((.cse2 (+ aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_3_44_55 (* 4294967296 aux_div_aux_mod_v_main_~n~0_BEFORE_RETURN_3_44_55))) (.cse1 (+ (* 4294967296 aux_div_aux_mod_v_main_~i~0_28_22_89) aux_mod_aux_mod_v_main_~i~0_28_22_89)) (.cse0 (* 2 aux_div_v_main_~i~0_28_22))) (and (< aux_mod_aux_mod_v_main_~i~0_28_22_89 4294967296) (<= (+ .cse0 4294967293) .cse1) (< .cse2 4294967296) (< aux_mod_aux_mod_v_main_~i~0_28_22_89 .cse2) (< 0 aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_3_44_55) (= (ite (<= (mod (div (mod main_~i~0 4294967296) 2) 4294967296) (mod main_~j~0 4294967296)) 1 0) (ite (<= (mod (div (mod (+ aux_mod_aux_mod_v_main_~i~0_28_22_89 3) 4294967296) 2) 4294967296) (mod v_main_~j~0_25 4294967296)) 1 0)) (< aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_3_44_55 4294967296) (<= 0 .cse2) (<= 0 aux_mod_aux_mod_v_main_~i~0_28_22_89) (not (= (+ (* aux_div_aux_mod_v_main_~i~0_28_22_89 4294967296) aux_mod_aux_mod_v_main_~i~0_28_22_89) (+ (* aux_div_v_main_~i~0_28_22 2) 4294967293))) (= (ite (<= (mod (div (mod aux_mod_aux_mod_v_main_~i~0_28_22_89 4294967296) 2) 4294967296) (mod (+ v_main_~j~0_25 4294967293) 4294967296)) 1 0) 1) (< .cse1 (+ .cse0 4294967295))))) (= (ite (<= (mod (div (mod main_~i~0 4294967296) 2) 4294967296) (mod main_~j~0 4294967296)) 1 0) 1)) (<= main_~n~0 (* 4294967296 (div main_~n~0 4294967296)))) [2021-05-06 11:51:47,374 INFO L194 CegarLoopUtils]: At program point L24(lines 24 27) the Hoare annotation is: (and (= main_~j~0 0) (= main_~i~0 (+ main_~j~0 3)) (< (mod main_~j~0 4294967296) (mod main_~n~0 4294967296))) [2021-05-06 11:51:47,374 INFO L194 CegarLoopUtils]: At program point L24-2(lines 22 30) the Hoare annotation is: (or (and (= main_~i~0 main_~j~0) (= main_~i~0 3)) (<= main_~n~0 (* 4294967296 (div main_~n~0 4294967296)))) [2021-05-06 11:51:47,375 INFO L201 CegarLoopUtils]: At program point L20(line 20) the Hoare annotation is: true [2021-05-06 11:51:47,375 INFO L201 CegarLoopUtils]: At program point L22-2(lines 22 30) the Hoare annotation is: true [2021-05-06 11:51:47,375 INFO L201 CegarLoopUtils]: At program point __VERIFIER_assertENTRY(lines 9 14) the Hoare annotation is: true [2021-05-06 11:51:47,375 INFO L194 CegarLoopUtils]: At program point L11(line 11) the Hoare annotation is: (or (forall ((aux_div_aux_mod_v_main_~i~0_28_22_89 Int) (aux_div_v_main_~i~0_28_22 Int) (aux_mod_aux_mod_v_main_~i~0_28_22_89 Int) (v_main_~j~0_25 Int)) (let ((.cse1 (+ (* 4294967296 aux_div_aux_mod_v_main_~i~0_28_22_89) aux_mod_aux_mod_v_main_~i~0_28_22_89)) (.cse0 (* 2 aux_div_v_main_~i~0_28_22))) (or (not (< aux_mod_aux_mod_v_main_~i~0_28_22_89 4294967296)) (not (< aux_mod_aux_mod_v_main_~i~0_28_22_89 (mod main_~n~0 4294967296))) (not (= |__VERIFIER_assert_#in~cond| (ite (<= (mod (div (mod (+ aux_mod_aux_mod_v_main_~i~0_28_22_89 3) 4294967296) 2) 4294967296) (mod v_main_~j~0_25 4294967296)) 1 0))) (= (+ (* aux_div_aux_mod_v_main_~i~0_28_22_89 4294967296) aux_mod_aux_mod_v_main_~i~0_28_22_89) (+ (* aux_div_v_main_~i~0_28_22 2) 4294967293)) (not (= (ite (<= (mod (div (mod aux_mod_aux_mod_v_main_~i~0_28_22_89 4294967296) 2) 4294967296) (mod (+ v_main_~j~0_25 4294967293) 4294967296)) 1 0) 1)) (not (<= (+ .cse0 4294967293) .cse1)) (not (<= 0 aux_mod_aux_mod_v_main_~i~0_28_22_89)) (not (< .cse1 (+ .cse0 4294967295)))))) (= |__VERIFIER_assert_#in~cond| 0)) [2021-05-06 11:51:47,375 INFO L194 CegarLoopUtils]: At program point L10(lines 10 12) the Hoare annotation is: (or (not (= |__VERIFIER_assert_#in~cond| 1)) (forall ((aux_div_aux_mod_v_main_~i~0_28_22_89 Int) (aux_div_v_main_~i~0_28_22 Int) (aux_mod_aux_mod_v_main_~i~0_28_22_89 Int) (v_main_~j~0_25 Int)) (let ((.cse1 (+ (* 4294967296 aux_div_aux_mod_v_main_~i~0_28_22_89) aux_mod_aux_mod_v_main_~i~0_28_22_89)) (.cse0 (* 2 aux_div_v_main_~i~0_28_22))) (or (not (< aux_mod_aux_mod_v_main_~i~0_28_22_89 4294967296)) (not (< aux_mod_aux_mod_v_main_~i~0_28_22_89 (mod main_~n~0 4294967296))) (not (= |__VERIFIER_assert_#in~cond| (ite (<= (mod (div (mod (+ aux_mod_aux_mod_v_main_~i~0_28_22_89 3) 4294967296) 2) 4294967296) (mod v_main_~j~0_25 4294967296)) 1 0))) (= (+ (* aux_div_aux_mod_v_main_~i~0_28_22_89 4294967296) aux_mod_aux_mod_v_main_~i~0_28_22_89) (+ (* aux_div_v_main_~i~0_28_22 2) 4294967293)) (not (= (ite (<= (mod (div (mod aux_mod_aux_mod_v_main_~i~0_28_22_89 4294967296) 2) 4294967296) (mod (+ v_main_~j~0_25 4294967293) 4294967296)) 1 0) 1)) (not (<= (+ .cse0 4294967293) .cse1)) (not (<= 0 aux_mod_aux_mod_v_main_~i~0_28_22_89)) (not (< .cse1 (+ .cse0 4294967295)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2021-05-06 11:51:47,375 INFO L194 CegarLoopUtils]: At program point __VERIFIER_assertEXIT(lines 9 14) the Hoare annotation is: (or (not (= |__VERIFIER_assert_#in~cond| 1)) (forall ((aux_div_aux_mod_v_main_~i~0_28_22_89 Int) (aux_div_v_main_~i~0_28_22 Int) (aux_mod_aux_mod_v_main_~i~0_28_22_89 Int) (v_main_~j~0_25 Int)) (let ((.cse1 (+ (* 4294967296 aux_div_aux_mod_v_main_~i~0_28_22_89) aux_mod_aux_mod_v_main_~i~0_28_22_89)) (.cse0 (* 2 aux_div_v_main_~i~0_28_22))) (or (not (< aux_mod_aux_mod_v_main_~i~0_28_22_89 4294967296)) (not (< aux_mod_aux_mod_v_main_~i~0_28_22_89 (mod main_~n~0 4294967296))) (not (= |__VERIFIER_assert_#in~cond| (ite (<= (mod (div (mod (+ aux_mod_aux_mod_v_main_~i~0_28_22_89 3) 4294967296) 2) 4294967296) (mod v_main_~j~0_25 4294967296)) 1 0))) (= (+ (* aux_div_aux_mod_v_main_~i~0_28_22_89 4294967296) aux_mod_aux_mod_v_main_~i~0_28_22_89) (+ (* aux_div_v_main_~i~0_28_22 2) 4294967293)) (not (= (ite (<= (mod (div (mod aux_mod_aux_mod_v_main_~i~0_28_22_89 4294967296) 2) 4294967296) (mod (+ v_main_~j~0_25 4294967293) 4294967296)) 1 0) 1)) (not (<= (+ .cse0 4294967293) .cse1)) (not (<= 0 aux_mod_aux_mod_v_main_~i~0_28_22_89)) (not (< .cse1 (+ .cse0 4294967295)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2021-05-06 11:51:47,376 INFO L194 CegarLoopUtils]: At program point L10-2(lines 9 14) the Hoare annotation is: (or (not (= |__VERIFIER_assert_#in~cond| 1)) (forall ((aux_div_aux_mod_v_main_~i~0_28_22_89 Int) (aux_div_v_main_~i~0_28_22 Int) (aux_mod_aux_mod_v_main_~i~0_28_22_89 Int) (v_main_~j~0_25 Int)) (let ((.cse1 (+ (* 4294967296 aux_div_aux_mod_v_main_~i~0_28_22_89) aux_mod_aux_mod_v_main_~i~0_28_22_89)) (.cse0 (* 2 aux_div_v_main_~i~0_28_22))) (or (not (< aux_mod_aux_mod_v_main_~i~0_28_22_89 4294967296)) (not (< aux_mod_aux_mod_v_main_~i~0_28_22_89 (mod main_~n~0 4294967296))) (not (= |__VERIFIER_assert_#in~cond| (ite (<= (mod (div (mod (+ aux_mod_aux_mod_v_main_~i~0_28_22_89 3) 4294967296) 2) 4294967296) (mod v_main_~j~0_25 4294967296)) 1 0))) (= (+ (* aux_div_aux_mod_v_main_~i~0_28_22_89 4294967296) aux_mod_aux_mod_v_main_~i~0_28_22_89) (+ (* aux_div_v_main_~i~0_28_22 2) 4294967293)) (not (= (ite (<= (mod (div (mod aux_mod_aux_mod_v_main_~i~0_28_22_89 4294967296) 2) 4294967296) (mod (+ v_main_~j~0_25 4294967293) 4294967296)) 1 0) 1)) (not (<= (+ .cse0 4294967293) .cse1)) (not (<= 0 aux_mod_aux_mod_v_main_~i~0_28_22_89)) (not (< .cse1 (+ .cse0 4294967295)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2021-05-06 11:51:47,376 INFO L194 CegarLoopUtils]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 11) the Hoare annotation is: (or (forall ((aux_div_aux_mod_v_main_~i~0_28_22_89 Int) (aux_div_v_main_~i~0_28_22 Int) (aux_mod_aux_mod_v_main_~i~0_28_22_89 Int) (v_main_~j~0_25 Int)) (let ((.cse1 (+ (* 4294967296 aux_div_aux_mod_v_main_~i~0_28_22_89) aux_mod_aux_mod_v_main_~i~0_28_22_89)) (.cse0 (* 2 aux_div_v_main_~i~0_28_22))) (or (not (< aux_mod_aux_mod_v_main_~i~0_28_22_89 4294967296)) (not (< aux_mod_aux_mod_v_main_~i~0_28_22_89 (mod main_~n~0 4294967296))) (not (= |__VERIFIER_assert_#in~cond| (ite (<= (mod (div (mod (+ aux_mod_aux_mod_v_main_~i~0_28_22_89 3) 4294967296) 2) 4294967296) (mod v_main_~j~0_25 4294967296)) 1 0))) (= (+ (* aux_div_aux_mod_v_main_~i~0_28_22_89 4294967296) aux_mod_aux_mod_v_main_~i~0_28_22_89) (+ (* aux_div_v_main_~i~0_28_22 2) 4294967293)) (not (= (ite (<= (mod (div (mod aux_mod_aux_mod_v_main_~i~0_28_22_89 4294967296) 2) 4294967296) (mod (+ v_main_~j~0_25 4294967293) 4294967296)) 1 0) 1)) (not (<= (+ .cse0 4294967293) .cse1)) (not (<= 0 aux_mod_aux_mod_v_main_~i~0_28_22_89)) (not (< .cse1 (+ .cse0 4294967295)))))) (= |__VERIFIER_assert_#in~cond| 0)) [2021-05-06 11:51:47,385 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] [2021-05-06 11:51:47,385 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_main_~i~0_28_22,QUANTIFIED] [2021-05-06 11:51:47,386 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] [2021-05-06 11:51:47,386 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] [2021-05-06 11:51:47,386 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_3_44_55,QUANTIFIED] [2021-05-06 11:51:47,386 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_v_main_~n~0_BEFORE_RETURN_3_44_55,QUANTIFIED] [2021-05-06 11:51:47,386 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] [2021-05-06 11:51:47,386 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_3_44_55,QUANTIFIED] [2021-05-06 11:51:47,386 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_v_main_~n~0_BEFORE_RETURN_3_44_55,QUANTIFIED] [2021-05-06 11:51:47,386 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_3_44_55,QUANTIFIED] [2021-05-06 11:51:47,386 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] [2021-05-06 11:51:47,387 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_25,QUANTIFIED] [2021-05-06 11:51:47,387 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_3_44_55,QUANTIFIED] [2021-05-06 11:51:47,387 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_3_44_55,QUANTIFIED] [2021-05-06 11:51:47,387 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_v_main_~n~0_BEFORE_RETURN_3_44_55,QUANTIFIED] [2021-05-06 11:51:47,387 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] [2021-05-06 11:51:47,387 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] [2021-05-06 11:51:47,388 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] [2021-05-06 11:51:47,389 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_main_~i~0_28_22,QUANTIFIED] [2021-05-06 11:51:47,389 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] [2021-05-06 11:51:47,390 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_25,QUANTIFIED] [2021-05-06 11:51:47,390 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] [2021-05-06 11:51:47,390 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] [2021-05-06 11:51:47,390 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_main_~i~0_28_22,QUANTIFIED] [2021-05-06 11:51:47,400 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] [2021-05-06 11:51:47,400 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_main_~i~0_28_22,QUANTIFIED] [2021-05-06 11:51:47,400 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] [2021-05-06 11:51:47,401 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] [2021-05-06 11:51:47,401 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_3_44_55,QUANTIFIED] [2021-05-06 11:51:47,401 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_v_main_~n~0_BEFORE_RETURN_3_44_55,QUANTIFIED] [2021-05-06 11:51:47,401 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] [2021-05-06 11:51:47,401 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_3_44_55,QUANTIFIED] [2021-05-06 11:51:47,401 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_v_main_~n~0_BEFORE_RETURN_3_44_55,QUANTIFIED] [2021-05-06 11:51:47,401 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_3_44_55,QUANTIFIED] [2021-05-06 11:51:47,402 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] [2021-05-06 11:51:47,402 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_25,QUANTIFIED] [2021-05-06 11:51:47,402 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_3_44_55,QUANTIFIED] [2021-05-06 11:51:47,402 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_3_44_55,QUANTIFIED] [2021-05-06 11:51:47,402 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_v_main_~n~0_BEFORE_RETURN_3_44_55,QUANTIFIED] [2021-05-06 11:51:47,402 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] [2021-05-06 11:51:47,402 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] [2021-05-06 11:51:47,403 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] [2021-05-06 11:51:47,403 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_main_~i~0_28_22,QUANTIFIED] [2021-05-06 11:51:47,403 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] [2021-05-06 11:51:47,403 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_25,QUANTIFIED] [2021-05-06 11:51:47,403 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] [2021-05-06 11:51:47,403 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] [2021-05-06 11:51:47,403 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_main_~i~0_28_22,QUANTIFIED] [2021-05-06 11:51:47,405 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] [2021-05-06 11:51:47,405 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] [2021-05-06 11:51:47,405 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] [2021-05-06 11:51:47,406 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_25,QUANTIFIED] [2021-05-06 11:51:47,406 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] [2021-05-06 11:51:47,406 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] [2021-05-06 11:51:47,406 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_main_~i~0_28_22,QUANTIFIED] [2021-05-06 11:51:47,406 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] [2021-05-06 11:51:47,406 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_25,QUANTIFIED] [2021-05-06 11:51:47,406 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_main_~i~0_28_22,QUANTIFIED] [2021-05-06 11:51:47,407 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] [2021-05-06 11:51:47,407 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] [2021-05-06 11:51:47,407 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] [2021-05-06 11:51:47,407 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] [2021-05-06 11:51:47,407 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] [2021-05-06 11:51:47,407 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_main_~i~0_28_22,QUANTIFIED] [2021-05-06 11:51:47,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.05 11:51:47 BoogieIcfgContainer [2021-05-06 11:51:47,408 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-05-06 11:51:47,409 INFO L168 Benchmark]: Toolchain (without parser) took 546570.92 ms. Allocated memory was 205.5 MB in the beginning and 247.5 MB in the end (delta: 41.9 MB). Free memory was 171.0 MB in the beginning and 124.7 MB in the end (delta: 46.2 MB). Peak memory consumption was 126.7 MB. Max. memory is 8.0 GB. [2021-05-06 11:51:47,409 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 205.5 MB. Free memory is still 187.4 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-05-06 11:51:47,409 INFO L168 Benchmark]: CACSL2BoogieTranslator took 169.86 ms. Allocated memory is still 205.5 MB. Free memory was 170.8 MB in the beginning and 161.3 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2021-05-06 11:51:47,409 INFO L168 Benchmark]: Boogie Preprocessor took 61.07 ms. Allocated memory is still 205.5 MB. Free memory was 161.3 MB in the beginning and 189.2 MB in the end (delta: -27.8 MB). Peak memory consumption was 4.6 MB. Max. memory is 8.0 GB. [2021-05-06 11:51:47,410 INFO L168 Benchmark]: RCFGBuilder took 390.16 ms. Allocated memory is still 205.5 MB. Free memory was 189.2 MB in the beginning and 175.0 MB in the end (delta: 14.1 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. [2021-05-06 11:51:47,410 INFO L168 Benchmark]: TraceAbstraction took 545940.25 ms. Allocated memory was 205.5 MB in the beginning and 247.5 MB in the end (delta: 41.9 MB). Free memory was 174.5 MB in the beginning and 124.7 MB in the end (delta: 49.7 MB). Peak memory consumption was 130.4 MB. Max. memory is 8.0 GB. [2021-05-06 11:51:47,411 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 205.5 MB. Free memory is still 187.4 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 169.86 ms. Allocated memory is still 205.5 MB. Free memory was 170.8 MB in the beginning and 161.3 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 61.07 ms. Allocated memory is still 205.5 MB. Free memory was 161.3 MB in the beginning and 189.2 MB in the end (delta: -27.8 MB). Peak memory consumption was 4.6 MB. Max. memory is 8.0 GB. * RCFGBuilder took 390.16 ms. Allocated memory is still 205.5 MB. Free memory was 189.2 MB in the beginning and 175.0 MB in the end (delta: 14.1 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 545940.25 ms. Allocated memory was 205.5 MB in the beginning and 247.5 MB in the end (delta: 41.9 MB). Free memory was 174.5 MB in the beginning and 124.7 MB in the end (delta: 49.7 MB). Peak memory consumption was 130.4 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_main_~i~0_28_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_3_44_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_v_main_~n~0_BEFORE_RETURN_3_44_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_3_44_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_v_main_~n~0_BEFORE_RETURN_3_44_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_3_44_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_3_44_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_3_44_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_v_main_~n~0_BEFORE_RETURN_3_44_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_main_~i~0_28_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_main_~i~0_28_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_main_~i~0_28_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_3_44_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_v_main_~n~0_BEFORE_RETURN_3_44_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_3_44_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_v_main_~n~0_BEFORE_RETURN_3_44_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_3_44_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_3_44_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_3_44_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_v_main_~n~0_BEFORE_RETURN_3_44_55,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_main_~i~0_28_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_main_~i~0_28_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_main_~i~0_28_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_main_~i~0_28_22,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_main_~i~0_28_22,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 11]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 233919.2ms, OverallIterations: 4, TraceHistogramMax: 3, EmptinessCheckTime: 10.1ms, AutomataDifference: 49582.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 311947.3ms, InitialAbstractionConstructionTime: 8.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 47 SDtfs, 102 SDslu, 156 SDs, 0 SdLazy, 349 SolverSat, 56 SolverUnsat, 16 SolverUnknown, 0 SolverNotchecked, 32699.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 21 SyntacticMatches, 9 SemanticMatches, 81 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 53034.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=3, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 74.4ms AutomataMinimizationTime, 4 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 22 LocationsWithAnnotation, 58 PreInvPairs, 89 NumberOfFragments, 713 HoareAnnotationTreeSize, 58 FomulaSimplifications, 1234 FormulaSimplificationTreeSizeReduction, 130.2ms HoareSimplificationTime, 22 FomulaSimplificationsInter, 2201 FormulaSimplificationTreeSizeReductionInter, 311802.9ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 22]: Loop Invariant [2021-05-06 11:51:47,415 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] [2021-05-06 11:51:47,415 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_main_~i~0_28_22,QUANTIFIED] [2021-05-06 11:51:47,416 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] [2021-05-06 11:51:47,416 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] [2021-05-06 11:51:47,416 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_3_44_55,QUANTIFIED] [2021-05-06 11:51:47,416 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_v_main_~n~0_BEFORE_RETURN_3_44_55,QUANTIFIED] [2021-05-06 11:51:47,416 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] [2021-05-06 11:51:47,416 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_3_44_55,QUANTIFIED] [2021-05-06 11:51:47,416 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_v_main_~n~0_BEFORE_RETURN_3_44_55,QUANTIFIED] [2021-05-06 11:51:47,416 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_3_44_55,QUANTIFIED] [2021-05-06 11:51:47,416 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] [2021-05-06 11:51:47,417 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_25,QUANTIFIED] [2021-05-06 11:51:47,417 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_3_44_55,QUANTIFIED] [2021-05-06 11:51:47,417 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_3_44_55,QUANTIFIED] [2021-05-06 11:51:47,417 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_v_main_~n~0_BEFORE_RETURN_3_44_55,QUANTIFIED] [2021-05-06 11:51:47,417 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] [2021-05-06 11:51:47,417 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] [2021-05-06 11:51:47,417 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] [2021-05-06 11:51:47,417 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_main_~i~0_28_22,QUANTIFIED] [2021-05-06 11:51:47,417 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] [2021-05-06 11:51:47,417 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_25,QUANTIFIED] [2021-05-06 11:51:47,417 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] [2021-05-06 11:51:47,417 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] [2021-05-06 11:51:47,418 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_main_~i~0_28_22,QUANTIFIED] [2021-05-06 11:51:47,418 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] [2021-05-06 11:51:47,418 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_main_~i~0_28_22,QUANTIFIED] [2021-05-06 11:51:47,418 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] [2021-05-06 11:51:47,418 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] [2021-05-06 11:51:47,419 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_3_44_55,QUANTIFIED] [2021-05-06 11:51:47,419 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_v_main_~n~0_BEFORE_RETURN_3_44_55,QUANTIFIED] [2021-05-06 11:51:47,419 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] [2021-05-06 11:51:47,419 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_3_44_55,QUANTIFIED] [2021-05-06 11:51:47,419 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_v_main_~n~0_BEFORE_RETURN_3_44_55,QUANTIFIED] [2021-05-06 11:51:47,419 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_3_44_55,QUANTIFIED] [2021-05-06 11:51:47,419 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] [2021-05-06 11:51:47,419 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_25,QUANTIFIED] [2021-05-06 11:51:47,419 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_3_44_55,QUANTIFIED] [2021-05-06 11:51:47,419 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_3_44_55,QUANTIFIED] [2021-05-06 11:51:47,420 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_v_main_~n~0_BEFORE_RETURN_3_44_55,QUANTIFIED] [2021-05-06 11:51:47,420 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] [2021-05-06 11:51:47,420 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] [2021-05-06 11:51:47,420 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] [2021-05-06 11:51:47,420 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_main_~i~0_28_22,QUANTIFIED] [2021-05-06 11:51:47,420 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] [2021-05-06 11:51:47,420 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_25,QUANTIFIED] [2021-05-06 11:51:47,420 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] [2021-05-06 11:51:47,420 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] [2021-05-06 11:51:47,420 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_main_~i~0_28_22,QUANTIFIED] Derived loop invariant: ((\exists aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_3_44_55 : int, aux_div_aux_mod_v_main_~i~0_28_22_89 : int, aux_div_v_main_~i~0_28_22 : int, aux_div_aux_mod_v_main_~n~0_BEFORE_RETURN_3_44_55 : int, aux_mod_aux_mod_v_main_~i~0_28_22_89 : int, v_main_~j~0_25 : int :: ((((((((((aux_mod_aux_mod_v_main_~i~0_28_22_89 < 4294967296 && 2 * aux_div_v_main_~i~0_28_22 + 4294967293 <= 4294967296 * aux_div_aux_mod_v_main_~i~0_28_22_89 + aux_mod_aux_mod_v_main_~i~0_28_22_89) && aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_3_44_55 + 4294967296 * aux_div_aux_mod_v_main_~n~0_BEFORE_RETURN_3_44_55 < 4294967296) && aux_mod_aux_mod_v_main_~i~0_28_22_89 < aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_3_44_55 + 4294967296 * aux_div_aux_mod_v_main_~n~0_BEFORE_RETURN_3_44_55) && 0 < aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_3_44_55) && (if i % 4294967296 / 2 % 4294967296 <= j % 4294967296 then 1 else 0) == (if (aux_mod_aux_mod_v_main_~i~0_28_22_89 + 3) % 4294967296 / 2 % 4294967296 <= v_main_~j~0_25 % 4294967296 then 1 else 0)) && aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_3_44_55 < 4294967296) && 0 <= aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_3_44_55 + 4294967296 * aux_div_aux_mod_v_main_~n~0_BEFORE_RETURN_3_44_55) && 0 <= aux_mod_aux_mod_v_main_~i~0_28_22_89) && !(aux_div_aux_mod_v_main_~i~0_28_22_89 * 4294967296 + aux_mod_aux_mod_v_main_~i~0_28_22_89 == aux_div_v_main_~i~0_28_22 * 2 + 4294967293)) && (if aux_mod_aux_mod_v_main_~i~0_28_22_89 % 4294967296 / 2 % 4294967296 <= (v_main_~j~0_25 + 4294967293) % 4294967296 then 1 else 0) == 1) && 4294967296 * aux_div_aux_mod_v_main_~i~0_28_22_89 + aux_mod_aux_mod_v_main_~i~0_28_22_89 < 2 * aux_div_v_main_~i~0_28_22 + 4294967295) && (if i % 4294967296 / 2 % 4294967296 <= j % 4294967296 then 1 else 0) == 1) || n <= 4294967296 * (n / 4294967296) - ProcedureContractResult [Line: 17]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 9]: Procedure Contract for __VERIFIER_assert [2021-05-06 11:51:47,421 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] [2021-05-06 11:51:47,421 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] [2021-05-06 11:51:47,421 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] [2021-05-06 11:51:47,421 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_25,QUANTIFIED] [2021-05-06 11:51:47,421 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] [2021-05-06 11:51:47,421 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] [2021-05-06 11:51:47,422 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_main_~i~0_28_22,QUANTIFIED] [2021-05-06 11:51:47,422 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] [2021-05-06 11:51:47,422 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_25,QUANTIFIED] [2021-05-06 11:51:47,422 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_main_~i~0_28_22,QUANTIFIED] [2021-05-06 11:51:47,422 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] [2021-05-06 11:51:47,422 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] [2021-05-06 11:51:47,422 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] [2021-05-06 11:51:47,422 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] [2021-05-06 11:51:47,422 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] [2021-05-06 11:51:47,422 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_main_~i~0_28_22,QUANTIFIED] [2021-05-06 11:51:47,423 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] [2021-05-06 11:51:47,423 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] [2021-05-06 11:51:47,423 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] [2021-05-06 11:51:47,423 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_25,QUANTIFIED] [2021-05-06 11:51:47,423 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] [2021-05-06 11:51:47,423 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] [2021-05-06 11:51:47,423 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_main_~i~0_28_22,QUANTIFIED] [2021-05-06 11:51:47,423 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] [2021-05-06 11:51:47,423 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_25,QUANTIFIED] [2021-05-06 11:51:47,424 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_main_~i~0_28_22,QUANTIFIED] [2021-05-06 11:51:47,424 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] [2021-05-06 11:51:47,424 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] [2021-05-06 11:51:47,424 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] [2021-05-06 11:51:47,424 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] [2021-05-06 11:51:47,424 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_mod_aux_mod_v_main_~i~0_28_22_89,QUANTIFIED] [2021-05-06 11:51:47,424 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[aux_div_v_main_~i~0_28_22,QUANTIFIED] Derived contract for procedure __VERIFIER_assert: (!(\old(cond) == 1) || (forall aux_div_aux_mod_v_main_~i~0_28_22_89 : int, aux_div_v_main_~i~0_28_22 : int, aux_mod_aux_mod_v_main_~i~0_28_22_89 : int, v_main_~j~0_25 : int :: ((((((!(aux_mod_aux_mod_v_main_~i~0_28_22_89 < 4294967296) || !(aux_mod_aux_mod_v_main_~i~0_28_22_89 < n % 4294967296)) || !(\old(cond) == (if (aux_mod_aux_mod_v_main_~i~0_28_22_89 + 3) % 4294967296 / 2 % 4294967296 <= v_main_~j~0_25 % 4294967296 then 1 else 0))) || aux_div_aux_mod_v_main_~i~0_28_22_89 * 4294967296 + aux_mod_aux_mod_v_main_~i~0_28_22_89 == aux_div_v_main_~i~0_28_22 * 2 + 4294967293) || !((if aux_mod_aux_mod_v_main_~i~0_28_22_89 % 4294967296 / 2 % 4294967296 <= (v_main_~j~0_25 + 4294967293) % 4294967296 then 1 else 0) == 1)) || !(2 * aux_div_v_main_~i~0_28_22 + 4294967293 <= 4294967296 * aux_div_aux_mod_v_main_~i~0_28_22_89 + aux_mod_aux_mod_v_main_~i~0_28_22_89)) || !(0 <= aux_mod_aux_mod_v_main_~i~0_28_22_89)) || !(4294967296 * aux_div_aux_mod_v_main_~i~0_28_22_89 + aux_mod_aux_mod_v_main_~i~0_28_22_89 < 2 * aux_div_v_main_~i~0_28_22 + 4294967295))) || \old(cond) == cond RESULT: Ultimate proved your program to be correct! Received shutdown request...