/usr/bin/java -ea -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/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loop-industry-pattern/mod3.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 09:51:33,584 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 09:51:33,596 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 09:51:33,639 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 09:51:33,640 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 09:51:33,641 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 09:51:33,642 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 09:51:33,644 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 09:51:33,646 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 09:51:33,650 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 09:51:33,651 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 09:51:33,653 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 09:51:33,654 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 09:51:33,656 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 09:51:33,657 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 09:51:33,658 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 09:51:33,659 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 09:51:33,660 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 09:51:33,665 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 09:51:33,671 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 09:51:33,673 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 09:51:33,674 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 09:51:33,675 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 09:51:33,678 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 09:51:33,679 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 09:51:33,685 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 09:51:33,685 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 09:51:33,685 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 09:51:33,687 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 09:51:33,687 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 09:51:33,689 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 09:51:33,689 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 09:51:33,690 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 09:51:33,691 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 09:51:33,691 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 09:51:33,692 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 09:51:33,692 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 09:51:33,693 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 09:51:33,693 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 09:51:33,693 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 09:51:33,694 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 09:51:33,696 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 09:51:33,696 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 09:51:33,706 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 09:51:33,706 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 09:51:33,707 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 09:51:33,707 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 09:51:33,707 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 09:51:33,708 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 09:51:33,708 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 09:51:33,708 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 09:51:33,708 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 09:51:33,709 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 09:51:33,709 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 09:51:33,709 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 09:51:33,709 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 09:51:33,709 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 09:51:33,709 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 09:51:33,709 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 09:51:33,710 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 09:51:33,710 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 09:51:33,710 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 09:51:33,710 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 09:51:33,710 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 09:51:33,710 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 09:51:33,710 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; [2022-04-08 09:51:33,949 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 09:51:33,968 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 09:51:33,970 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 09:51:33,971 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 09:51:33,973 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 09:51:33,975 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-industry-pattern/mod3.c [2022-04-08 09:51:34,045 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c0b4e2ee/9a701b3fb8e94b77ab376ce12b336c94/FLAGed6a2d472 [2022-04-08 09:51:34,441 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 09:51:34,441 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-industry-pattern/mod3.c [2022-04-08 09:51:34,446 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c0b4e2ee/9a701b3fb8e94b77ab376ce12b336c94/FLAGed6a2d472 [2022-04-08 09:51:34,848 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c0b4e2ee/9a701b3fb8e94b77ab376ce12b336c94 [2022-04-08 09:51:34,850 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 09:51:34,851 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 09:51:34,853 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 09:51:34,853 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 09:51:34,856 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 09:51:34,857 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 09:51:34" (1/1) ... [2022-04-08 09:51:34,858 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53dec96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:51:34, skipping insertion in model container [2022-04-08 09:51:34,858 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 09:51:34" (1/1) ... [2022-04-08 09:51:34,864 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 09:51:34,875 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 09:51:34,992 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-industry-pattern/mod3.c[394,407] [2022-04-08 09:51:35,009 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 09:51:35,029 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 09:51:35,040 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-industry-pattern/mod3.c[394,407] [2022-04-08 09:51:35,046 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 09:51:35,058 INFO L208 MainTranslator]: Completed translation [2022-04-08 09:51:35,058 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:51:35 WrapperNode [2022-04-08 09:51:35,058 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 09:51:35,059 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 09:51:35,059 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 09:51:35,059 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 09:51:35,068 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:51:35" (1/1) ... [2022-04-08 09:51:35,069 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:51:35" (1/1) ... [2022-04-08 09:51:35,074 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:51:35" (1/1) ... [2022-04-08 09:51:35,074 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:51:35" (1/1) ... [2022-04-08 09:51:35,079 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:51:35" (1/1) ... [2022-04-08 09:51:35,083 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:51:35" (1/1) ... [2022-04-08 09:51:35,084 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:51:35" (1/1) ... [2022-04-08 09:51:35,085 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 09:51:35,086 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 09:51:35,086 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 09:51:35,086 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 09:51:35,087 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:51:35" (1/1) ... [2022-04-08 09:51:35,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 09:51:35,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:51:35,113 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 09:51:35,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 09:51:35,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 09:51:35,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 09:51:35,149 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 09:51:35,149 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 09:51:35,149 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 09:51:35,150 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 09:51:35,150 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 09:51:35,150 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 09:51:35,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 09:51:35,151 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 09:51:35,151 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 09:51:35,152 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 09:51:35,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 09:51:35,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 09:51:35,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 09:51:35,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 09:51:35,155 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 09:51:35,155 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 09:51:35,216 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 09:51:35,218 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 09:51:39,727 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 09:51:39,738 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 09:51:39,738 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 09:51:39,740 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 09:51:39 BoogieIcfgContainer [2022-04-08 09:51:39,740 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 09:51:39,741 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 09:51:39,741 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 09:51:39,751 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 09:51:39,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 09:51:34" (1/3) ... [2022-04-08 09:51:39,753 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1df53905 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 09:51:39, skipping insertion in model container [2022-04-08 09:51:39,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:51:35" (2/3) ... [2022-04-08 09:51:39,753 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1df53905 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 09:51:39, skipping insertion in model container [2022-04-08 09:51:39,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 09:51:39" (3/3) ... [2022-04-08 09:51:39,754 INFO L111 eAbstractionObserver]: Analyzing ICFG mod3.c [2022-04-08 09:51:39,759 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 09:51:39,759 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 09:51:39,792 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 09:51:39,797 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 09:51:39,797 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 09:51:39,817 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 16 states have (on average 1.5) internal successors, (24), 18 states have internal predecessors, (24), 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) [2022-04-08 09:51:39,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 09:51:39,825 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:51:39,825 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:51:39,826 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:51:39,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:51:39,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1060463359, now seen corresponding path program 1 times [2022-04-08 09:51:39,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:51:39,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [860716352] [2022-04-08 09:51:39,847 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:51:39,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1060463359, now seen corresponding path program 2 times [2022-04-08 09:51:39,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:51:39,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874368089] [2022-04-08 09:51:39,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:51:39,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:51:39,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:51:40,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:51:40,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:51:40,082 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(7, 2);call write~init~int(109, 2, 0, 1);call write~init~int(111, 2, 1, 1);call write~init~int(100, 2, 2, 1);call write~init~int(51, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1);call #Ultimate.allocInit(12, 3); {27#true} is VALID [2022-04-08 09:51:40,082 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-08 09:51:40,082 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27#true} {27#true} #60#return; {27#true} is VALID [2022-04-08 09:51:40,088 INFO L272 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:51:40,088 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(7, 2);call write~init~int(109, 2, 0, 1);call write~init~int(111, 2, 1, 1);call write~init~int(100, 2, 2, 1);call write~init~int(51, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1);call #Ultimate.allocInit(12, 3); {27#true} is VALID [2022-04-08 09:51:40,089 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-08 09:51:40,089 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #60#return; {27#true} is VALID [2022-04-08 09:51:40,089 INFO L272 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret7 := main(); {27#true} is VALID [2022-04-08 09:51:40,089 INFO L290 TraceCheckUtils]: 5: Hoare triple {27#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 1; {27#true} is VALID [2022-04-08 09:51:40,094 INFO L290 TraceCheckUtils]: 6: Hoare triple {27#true} assume !true; {28#false} is VALID [2022-04-08 09:51:40,095 INFO L290 TraceCheckUtils]: 7: Hoare triple {28#false} assume 0 == ~y~0 % 4294967296; {28#false} is VALID [2022-04-08 09:51:40,095 INFO L272 TraceCheckUtils]: 8: Hoare triple {28#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 3 then ~x~0 % 4294967296 % 3 - 3 else ~x~0 % 4294967296 % 3) % 4294967296 then 1 else 0)); {28#false} is VALID [2022-04-08 09:51:40,095 INFO L290 TraceCheckUtils]: 9: Hoare triple {28#false} ~cond := #in~cond; {28#false} is VALID [2022-04-08 09:51:40,095 INFO L290 TraceCheckUtils]: 10: Hoare triple {28#false} assume 0 == ~cond; {28#false} is VALID [2022-04-08 09:51:40,095 INFO L290 TraceCheckUtils]: 11: Hoare triple {28#false} assume !false; {28#false} is VALID [2022-04-08 09:51:40,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:51:40,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:51:40,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874368089] [2022-04-08 09:51:40,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874368089] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:51:40,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:51:40,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 09:51:40,100 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:51:40,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [860716352] [2022-04-08 09:51:40,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [860716352] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:51:40,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:51:40,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 09:51:40,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375905242] [2022-04-08 09:51:40,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:51:40,105 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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 12 [2022-04-08 09:51:40,107 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:51:40,112 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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) [2022-04-08 09:51:40,136 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:51:40,137 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 09:51:40,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:51:40,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 09:51:40,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 09:51:40,164 INFO L87 Difference]: Start difference. First operand has 24 states, 16 states have (on average 1.5) internal successors, (24), 18 states have internal predecessors, (24), 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 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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) [2022-04-08 09:51:48,760 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 09:51:48,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:51:48,933 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2022-04-08 09:51:48,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 09:51:48,934 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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 12 [2022-04-08 09:51:48,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:51:48,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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) [2022-04-08 09:51:48,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-04-08 09:51:48,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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) [2022-04-08 09:51:48,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-04-08 09:51:48,945 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 46 transitions. [2022-04-08 09:51:49,008 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:51:49,015 INFO L225 Difference]: With dead ends: 38 [2022-04-08 09:51:49,015 INFO L226 Difference]: Without dead ends: 17 [2022-04-08 09:51:49,017 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 09:51:49,020 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 19 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-08 09:51:49,021 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 30 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-08 09:51:49,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-08 09:51:49,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-08 09:51:49,046 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:51:49,046 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 3 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) [2022-04-08 09:51:49,047 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 3 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) [2022-04-08 09:51:49,047 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 3 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) [2022-04-08 09:51:49,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:51:49,050 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2022-04-08 09:51:49,050 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-04-08 09:51:49,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:51:49,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:51:49,051 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 3 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) Second operand 17 states. [2022-04-08 09:51:49,051 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 3 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) Second operand 17 states. [2022-04-08 09:51:49,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:51:49,053 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2022-04-08 09:51:49,053 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-04-08 09:51:49,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:51:49,054 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:51:49,054 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:51:49,054 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:51:49,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 3 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) [2022-04-08 09:51:49,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2022-04-08 09:51:49,057 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 12 [2022-04-08 09:51:49,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:51:49,057 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-04-08 09:51:49,058 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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) [2022-04-08 09:51:49,058 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 20 transitions. [2022-04-08 09:51:49,082 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:51:49,083 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-04-08 09:51:49,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-08 09:51:49,083 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:51:49,084 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:51:49,084 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 09:51:49,084 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:51:49,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:51:49,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1839610256, now seen corresponding path program 1 times [2022-04-08 09:51:49,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:51:49,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [492891521] [2022-04-08 09:51:49,086 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:51:49,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1839610256, now seen corresponding path program 2 times [2022-04-08 09:51:49,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:51:49,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462957105] [2022-04-08 09:51:49,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:51:49,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:51:49,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:51:49,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:51:49,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:51:49,160 INFO L290 TraceCheckUtils]: 0: Hoare triple {185#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(7, 2);call write~init~int(109, 2, 0, 1);call write~init~int(111, 2, 1, 1);call write~init~int(100, 2, 2, 1);call write~init~int(51, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1);call #Ultimate.allocInit(12, 3); {179#true} is VALID [2022-04-08 09:51:49,160 INFO L290 TraceCheckUtils]: 1: Hoare triple {179#true} assume true; {179#true} is VALID [2022-04-08 09:51:49,161 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {179#true} {179#true} #60#return; {179#true} is VALID [2022-04-08 09:51:49,161 INFO L272 TraceCheckUtils]: 0: Hoare triple {179#true} call ULTIMATE.init(); {185#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:51:49,162 INFO L290 TraceCheckUtils]: 1: Hoare triple {185#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(7, 2);call write~init~int(109, 2, 0, 1);call write~init~int(111, 2, 1, 1);call write~init~int(100, 2, 2, 1);call write~init~int(51, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1);call #Ultimate.allocInit(12, 3); {179#true} is VALID [2022-04-08 09:51:49,162 INFO L290 TraceCheckUtils]: 2: Hoare triple {179#true} assume true; {179#true} is VALID [2022-04-08 09:51:49,162 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {179#true} {179#true} #60#return; {179#true} is VALID [2022-04-08 09:51:49,162 INFO L272 TraceCheckUtils]: 4: Hoare triple {179#true} call #t~ret7 := main(); {179#true} is VALID [2022-04-08 09:51:49,163 INFO L290 TraceCheckUtils]: 5: Hoare triple {179#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 1; {184#(= (+ (- 1) main_~y~0) 0)} is VALID [2022-04-08 09:51:49,163 INFO L290 TraceCheckUtils]: 6: Hoare triple {184#(= (+ (- 1) main_~y~0) 0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {184#(= (+ (- 1) main_~y~0) 0)} is VALID [2022-04-08 09:51:49,164 INFO L290 TraceCheckUtils]: 7: Hoare triple {184#(= (+ (- 1) main_~y~0) 0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {184#(= (+ (- 1) main_~y~0) 0)} is VALID [2022-04-08 09:51:49,164 INFO L290 TraceCheckUtils]: 8: Hoare triple {184#(= (+ (- 1) main_~y~0) 0)} assume 0 == ~y~0 % 4294967296; {180#false} is VALID [2022-04-08 09:51:49,165 INFO L272 TraceCheckUtils]: 9: Hoare triple {180#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 3 then ~x~0 % 4294967296 % 3 - 3 else ~x~0 % 4294967296 % 3) % 4294967296 then 1 else 0)); {180#false} is VALID [2022-04-08 09:51:49,165 INFO L290 TraceCheckUtils]: 10: Hoare triple {180#false} ~cond := #in~cond; {180#false} is VALID [2022-04-08 09:51:49,165 INFO L290 TraceCheckUtils]: 11: Hoare triple {180#false} assume 0 == ~cond; {180#false} is VALID [2022-04-08 09:51:49,165 INFO L290 TraceCheckUtils]: 12: Hoare triple {180#false} assume !false; {180#false} is VALID [2022-04-08 09:51:49,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:51:49,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:51:49,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462957105] [2022-04-08 09:51:49,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462957105] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:51:49,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:51:49,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 09:51:49,167 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:51:49,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [492891521] [2022-04-08 09:51:49,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [492891521] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:51:49,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:51:49,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 09:51:49,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960255989] [2022-04-08 09:51:49,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:51:49,168 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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 13 [2022-04-08 09:51:49,168 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:51:49,169 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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) [2022-04-08 09:51:49,181 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:51:49,181 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 09:51:49,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:51:49,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 09:51:49,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 09:51:49,183 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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) [2022-04-08 09:51:53,386 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 09:51:57,707 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 09:52:02,076 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 09:52:02,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:52:02,274 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2022-04-08 09:52:02,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 09:52:02,275 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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 13 [2022-04-08 09:52:02,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:52:02,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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) [2022-04-08 09:52:02,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2022-04-08 09:52:02,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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) [2022-04-08 09:52:02,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2022-04-08 09:52:02,279 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 34 transitions. [2022-04-08 09:52:02,327 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:52:02,330 INFO L225 Difference]: With dead ends: 28 [2022-04-08 09:52:02,331 INFO L226 Difference]: Without dead ends: 22 [2022-04-08 09:52:02,331 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 09:52:02,336 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 26 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 6 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:52:02,336 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 27 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 10 Invalid, 3 Unknown, 0 Unchecked, 6.1s Time] [2022-04-08 09:52:02,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-08 09:52:02,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2022-04-08 09:52:02,346 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:52:02,346 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 3 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) [2022-04-08 09:52:02,347 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 3 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) [2022-04-08 09:52:02,347 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 3 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) [2022-04-08 09:52:02,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:52:02,360 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2022-04-08 09:52:02,360 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-04-08 09:52:02,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:52:02,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:52:02,361 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 3 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) Second operand 22 states. [2022-04-08 09:52:02,361 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 3 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) Second operand 22 states. [2022-04-08 09:52:02,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:52:02,363 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2022-04-08 09:52:02,363 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-04-08 09:52:02,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:52:02,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:52:02,364 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:52:02,364 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:52:02,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 3 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) [2022-04-08 09:52:02,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2022-04-08 09:52:02,366 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 13 [2022-04-08 09:52:02,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:52:02,366 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2022-04-08 09:52:02,366 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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) [2022-04-08 09:52:02,366 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 22 transitions. [2022-04-08 09:52:02,395 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:52:02,395 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-08 09:52:02,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-08 09:52:02,396 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:52:02,396 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:52:02,397 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 09:52:02,397 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:52:02,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:52:02,399 INFO L85 PathProgramCache]: Analyzing trace with hash -496948910, now seen corresponding path program 1 times [2022-04-08 09:52:02,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:52:02,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [149707153] [2022-04-08 09:52:02,424 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:52:02,424 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:52:02,424 INFO L85 PathProgramCache]: Analyzing trace with hash -496948910, now seen corresponding path program 2 times [2022-04-08 09:52:02,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:52:02,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308617319] [2022-04-08 09:52:02,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:52:02,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:52:02,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:52:02,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:52:02,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:52:02,876 INFO L290 TraceCheckUtils]: 0: Hoare triple {337#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(7, 2);call write~init~int(109, 2, 0, 1);call write~init~int(111, 2, 1, 1);call write~init~int(100, 2, 2, 1);call write~init~int(51, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1);call #Ultimate.allocInit(12, 3); {328#true} is VALID [2022-04-08 09:52:02,877 INFO L290 TraceCheckUtils]: 1: Hoare triple {328#true} assume true; {328#true} is VALID [2022-04-08 09:52:02,877 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {328#true} {328#true} #60#return; {328#true} is VALID [2022-04-08 09:52:02,879 INFO L272 TraceCheckUtils]: 0: Hoare triple {328#true} call ULTIMATE.init(); {337#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:52:02,879 INFO L290 TraceCheckUtils]: 1: Hoare triple {337#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(7, 2);call write~init~int(109, 2, 0, 1);call write~init~int(111, 2, 1, 1);call write~init~int(100, 2, 2, 1);call write~init~int(51, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1);call #Ultimate.allocInit(12, 3); {328#true} is VALID [2022-04-08 09:52:02,879 INFO L290 TraceCheckUtils]: 2: Hoare triple {328#true} assume true; {328#true} is VALID [2022-04-08 09:52:02,882 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {328#true} {328#true} #60#return; {328#true} is VALID [2022-04-08 09:52:02,883 INFO L272 TraceCheckUtils]: 4: Hoare triple {328#true} call #t~ret7 := main(); {328#true} is VALID [2022-04-08 09:52:02,887 INFO L290 TraceCheckUtils]: 5: Hoare triple {328#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 1; {333#(and (<= main_~x~0 2147483647) (or (<= 0 (+ main_~x~0 2147483648)) (< 1431655764 (+ (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 3) (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0 (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 3) (- 3))) 4294967296) 1431655765)))))} is VALID [2022-04-08 09:52:02,889 INFO L290 TraceCheckUtils]: 6: Hoare triple {333#(and (<= main_~x~0 2147483647) (or (<= 0 (+ main_~x~0 2147483648)) (< 1431655764 (+ (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 3) (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0 (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 3) (- 3))) 4294967296) 1431655765)))))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {333#(and (<= main_~x~0 2147483647) (or (<= 0 (+ main_~x~0 2147483648)) (< 1431655764 (+ (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 3) (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0 (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 3) (- 3))) 4294967296) 1431655765)))))} is VALID [2022-04-08 09:52:02,890 INFO L290 TraceCheckUtils]: 7: Hoare triple {333#(and (<= main_~x~0 2147483647) (or (<= 0 (+ main_~x~0 2147483648)) (< 1431655764 (+ (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 3) (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0 (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 3) (- 3))) 4294967296) 1431655765)))))} assume !!(0 != #t~nondet5);havoc #t~nondet5; {333#(and (<= main_~x~0 2147483647) (or (<= 0 (+ main_~x~0 2147483648)) (< 1431655764 (+ (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 3) (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0 (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 3) (- 3))) 4294967296) 1431655765)))))} is VALID [2022-04-08 09:52:05,015 WARN L290 TraceCheckUtils]: 8: Hoare triple {333#(and (<= main_~x~0 2147483647) (or (<= 0 (+ main_~x~0 2147483648)) (< 1431655764 (+ (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 3) (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0 (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 3) (- 3))) 4294967296) 1431655765)))))} assume 1 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 3 then ~x~0 % 4294967296 % 3 - 3 else ~x~0 % 4294967296 % 3) % 4294967296;~x~0 := 2 + ~x~0;~y~0 := 0; {334#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0 (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 3) (- 3))) 4294967296) 4294967296) (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 3) 3)))} is UNKNOWN [2022-04-08 09:52:05,031 INFO L290 TraceCheckUtils]: 9: Hoare triple {334#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0 (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 3) (- 3))) 4294967296) 4294967296) (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 3) 3)))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {334#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0 (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 3) (- 3))) 4294967296) 4294967296) (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 3) 3)))} is VALID [2022-04-08 09:52:05,033 INFO L290 TraceCheckUtils]: 10: Hoare triple {334#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0 (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 3) (- 3))) 4294967296) 4294967296) (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 3) 3)))} assume !(0 != #t~nondet5);havoc #t~nondet5; {334#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0 (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 3) (- 3))) 4294967296) 4294967296) (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 3) 3)))} is VALID [2022-04-08 09:52:05,034 INFO L290 TraceCheckUtils]: 11: Hoare triple {334#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0 (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 3) (- 3))) 4294967296) 4294967296) (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 3) 3)))} assume 0 == ~y~0 % 4294967296; {334#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0 (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 3) (- 3))) 4294967296) 4294967296) (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 3) 3)))} is VALID [2022-04-08 09:52:05,043 INFO L272 TraceCheckUtils]: 12: Hoare triple {334#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0 (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 3) (- 3))) 4294967296) 4294967296) (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 3) 3)))} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 3 then ~x~0 % 4294967296 % 3 - 3 else ~x~0 % 4294967296 % 3) % 4294967296 then 1 else 0)); {335#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:52:05,044 INFO L290 TraceCheckUtils]: 13: Hoare triple {335#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {336#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 09:52:05,046 INFO L290 TraceCheckUtils]: 14: Hoare triple {336#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {329#false} is VALID [2022-04-08 09:52:05,046 INFO L290 TraceCheckUtils]: 15: Hoare triple {329#false} assume !false; {329#false} is VALID [2022-04-08 09:52:05,046 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:52:05,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:52:05,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308617319] [2022-04-08 09:52:05,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308617319] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:52:05,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356296074] [2022-04-08 09:52:05,047 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:52:05,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:52:05,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:52:05,054 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 09:52:05,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process