/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/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/nested5-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 06:54:35,553 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 06:54:35,555 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 06:54:35,595 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 06:54:35,596 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 06:54:35,597 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 06:54:35,598 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 06:54:35,599 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 06:54:35,600 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 06:54:35,600 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 06:54:35,601 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 06:54:35,601 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 06:54:35,601 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 06:54:35,602 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 06:54:35,602 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 06:54:35,603 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 06:54:35,603 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 06:54:35,604 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 06:54:35,605 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 06:54:35,606 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 06:54:35,607 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 06:54:35,607 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 06:54:35,608 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 06:54:35,608 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 06:54:35,609 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 06:54:35,610 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 06:54:35,611 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 06:54:35,611 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 06:54:35,611 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 06:54:35,611 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 06:54:35,612 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 06:54:35,612 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 06:54:35,612 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 06:54:35,613 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 06:54:35,613 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 06:54:35,614 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 06:54:35,614 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 06:54:35,614 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 06:54:35,614 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 06:54:35,615 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 06:54:35,615 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 06:54:35,616 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 06:54:35,616 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 06:54:35,621 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 06:54:35,621 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 06:54:35,622 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 06:54:35,622 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 06:54:35,622 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 06:54:35,622 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 06:54:35,622 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 06:54:35,623 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 06:54:35,623 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 06:54:35,623 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 06:54:35,623 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 06:54:35,623 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 06:54:35,623 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 06:54:35,623 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 06:54:35,623 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 06:54:35,623 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 06:54:35,623 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 06:54:35,624 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 06:54:35,624 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 06:54:35,624 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 06:54:35,624 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 06:54:35,624 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 06:54:35,624 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 06:54:35,624 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 06:54:35,624 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 06:54:35,624 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-15 06:54:35,783 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 06:54:35,799 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 06:54:35,801 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 06:54:35,802 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 06:54:35,802 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 06:54:35,803 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/nested5-1.c [2022-04-15 06:54:35,846 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7bfeb931/0a3b9f3b2c7f45c696e5766f22a5aa70/FLAG3ad6af5ed [2022-04-15 06:54:36,192 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 06:54:36,192 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/nested5-1.c [2022-04-15 06:54:36,196 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7bfeb931/0a3b9f3b2c7f45c696e5766f22a5aa70/FLAG3ad6af5ed [2022-04-15 06:54:36,203 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7bfeb931/0a3b9f3b2c7f45c696e5766f22a5aa70 [2022-04-15 06:54:36,205 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 06:54:36,206 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 06:54:36,206 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 06:54:36,207 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 06:54:36,209 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 06:54:36,213 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:54:36" (1/1) ... [2022-04-15 06:54:36,213 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25bd3c0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:54:36, skipping insertion in model container [2022-04-15 06:54:36,214 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:54:36" (1/1) ... [2022-04-15 06:54:36,219 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 06:54:36,230 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 06:54:36,324 WARN L230 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/nested5-1.c[321,334] [2022-04-15 06:54:36,346 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 06:54:36,351 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 06:54:36,363 WARN L230 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/nested5-1.c[321,334] [2022-04-15 06:54:36,367 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 06:54:36,374 INFO L208 MainTranslator]: Completed translation [2022-04-15 06:54:36,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:54:36 WrapperNode [2022-04-15 06:54:36,375 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 06:54:36,375 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 06:54:36,376 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 06:54:36,376 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 06:54:36,381 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:54:36" (1/1) ... [2022-04-15 06:54:36,382 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:54:36" (1/1) ... [2022-04-15 06:54:36,385 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:54:36" (1/1) ... [2022-04-15 06:54:36,385 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:54:36" (1/1) ... [2022-04-15 06:54:36,389 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:54:36" (1/1) ... [2022-04-15 06:54:36,392 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:54:36" (1/1) ... [2022-04-15 06:54:36,398 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:54:36" (1/1) ... [2022-04-15 06:54:36,399 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 06:54:36,400 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 06:54:36,400 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 06:54:36,400 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 06:54:36,402 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:54:36" (1/1) ... [2022-04-15 06:54:36,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 06:54:36,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:54:36,420 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-15 06:54:36,429 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-15 06:54:36,446 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 06:54:36,446 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 06:54:36,446 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 06:54:36,446 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 06:54:36,447 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 06:54:36,447 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 06:54:36,447 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 06:54:36,447 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 06:54:36,447 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 06:54:36,447 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 06:54:36,447 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 06:54:36,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 06:54:36,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 06:54:36,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 06:54:36,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 06:54:36,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 06:54:36,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 06:54:36,492 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 06:54:36,493 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 06:54:36,685 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 06:54:36,690 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 06:54:36,690 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-04-15 06:54:36,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:54:36 BoogieIcfgContainer [2022-04-15 06:54:36,691 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 06:54:36,693 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 06:54:36,693 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 06:54:36,696 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 06:54:36,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 06:54:36" (1/3) ... [2022-04-15 06:54:36,696 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62e268fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:54:36, skipping insertion in model container [2022-04-15 06:54:36,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:54:36" (2/3) ... [2022-04-15 06:54:36,697 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62e268fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:54:36, skipping insertion in model container [2022-04-15 06:54:36,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:54:36" (3/3) ... [2022-04-15 06:54:36,698 INFO L111 eAbstractionObserver]: Analyzing ICFG nested5-1.c [2022-04-15 06:54:36,702 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 06:54:36,702 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 06:54:36,747 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 06:54:36,751 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-15 06:54:36,751 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 06:54:36,780 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 20 states have (on average 1.6) internal successors, (32), 21 states have internal predecessors, (32), 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-15 06:54:36,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 06:54:36,799 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:54:36,800 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:54:36,800 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:54:36,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:54:36,804 INFO L85 PathProgramCache]: Analyzing trace with hash -531959740, now seen corresponding path program 1 times [2022-04-15 06:54:36,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:54:36,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [32795692] [2022-04-15 06:54:36,825 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:54:36,826 INFO L85 PathProgramCache]: Analyzing trace with hash -531959740, now seen corresponding path program 2 times [2022-04-15 06:54:36,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:54:36,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866337068] [2022-04-15 06:54:36,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:54:36,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:54:36,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:37,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:54:37,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:37,047 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#(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(12, 2);call #Ultimate.allocInit(12, 3); {31#true} is VALID [2022-04-15 06:54:37,049 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} assume true; {31#true} is VALID [2022-04-15 06:54:37,049 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31#true} {31#true} #85#return; {31#true} is VALID [2022-04-15 06:54:37,051 INFO L272 TraceCheckUtils]: 0: Hoare triple {31#true} call ULTIMATE.init(); {36#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:54:37,051 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#(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(12, 2);call #Ultimate.allocInit(12, 3); {31#true} is VALID [2022-04-15 06:54:37,051 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#true} assume true; {31#true} is VALID [2022-04-15 06:54:37,051 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31#true} {31#true} #85#return; {31#true} is VALID [2022-04-15 06:54:37,051 INFO L272 TraceCheckUtils]: 4: Hoare triple {31#true} call #t~ret9 := main(); {31#true} is VALID [2022-04-15 06:54:37,052 INFO L290 TraceCheckUtils]: 5: Hoare triple {31#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0;~v~0 := 0;~w~0 := 0; {31#true} is VALID [2022-04-15 06:54:37,052 INFO L290 TraceCheckUtils]: 6: Hoare triple {31#true} assume !!(~w~0 % 4294967296 < 268435455);~x~0 := 0; {31#true} is VALID [2022-04-15 06:54:37,052 INFO L290 TraceCheckUtils]: 7: Hoare triple {31#true} assume !!(~x~0 % 4294967296 < 10);~y~0 := 0; {31#true} is VALID [2022-04-15 06:54:37,052 INFO L290 TraceCheckUtils]: 8: Hoare triple {31#true} assume !!(~y~0 % 4294967296 < 10);~z~0 := 0; {31#true} is VALID [2022-04-15 06:54:37,052 INFO L290 TraceCheckUtils]: 9: Hoare triple {31#true} assume !!(~z~0 % 4294967296 < 10);~v~0 := 0; {31#true} is VALID [2022-04-15 06:54:37,053 INFO L290 TraceCheckUtils]: 10: Hoare triple {31#true} assume !true; {32#false} is VALID [2022-04-15 06:54:37,053 INFO L272 TraceCheckUtils]: 11: Hoare triple {32#false} call __VERIFIER_assert((if (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 <= 2147483647 then (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 else (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 - 4294967296)); {32#false} is VALID [2022-04-15 06:54:37,053 INFO L290 TraceCheckUtils]: 12: Hoare triple {32#false} ~cond := #in~cond; {32#false} is VALID [2022-04-15 06:54:37,054 INFO L290 TraceCheckUtils]: 13: Hoare triple {32#false} assume 0 == ~cond; {32#false} is VALID [2022-04-15 06:54:37,054 INFO L290 TraceCheckUtils]: 14: Hoare triple {32#false} assume !false; {32#false} is VALID [2022-04-15 06:54:37,054 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-15 06:54:37,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:54:37,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866337068] [2022-04-15 06:54:37,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866337068] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:54:37,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:54:37,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 06:54:37,058 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:54:37,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [32795692] [2022-04-15 06:54:37,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [32795692] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:54:37,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:54:37,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 06:54:37,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655267778] [2022-04-15 06:54:37,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:54:37,063 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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 15 [2022-04-15 06:54:37,064 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:54:37,066 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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-15 06:54:37,091 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:37,092 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 06:54:37,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:54:37,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 06:54:37,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 06:54:37,114 INFO L87 Difference]: Start difference. First operand has 28 states, 20 states have (on average 1.6) internal successors, (32), 21 states have internal predecessors, (32), 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 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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-15 06:54:37,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:37,209 INFO L93 Difference]: Finished difference Result 50 states and 71 transitions. [2022-04-15 06:54:37,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 06:54:37,210 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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 15 [2022-04-15 06:54:37,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:54:37,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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-15 06:54:37,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2022-04-15 06:54:37,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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-15 06:54:37,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2022-04-15 06:54:37,229 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 71 transitions. [2022-04-15 06:54:37,305 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:37,311 INFO L225 Difference]: With dead ends: 50 [2022-04-15 06:54:37,311 INFO L226 Difference]: Without dead ends: 23 [2022-04-15 06:54:37,313 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-15 06:54:37,315 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 23 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:54:37,315 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 34 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 06:54:37,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-15 06:54:37,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-15 06:54:37,337 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:54:37,338 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:54:37,338 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:54:37,339 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:54:37,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:37,343 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2022-04-15 06:54:37,343 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-04-15 06:54:37,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:54:37,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:54:37,345 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 23 states. [2022-04-15 06:54:37,345 INFO L87 Difference]: Start difference. First operand has 23 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 23 states. [2022-04-15 06:54:37,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:37,349 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2022-04-15 06:54:37,349 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-04-15 06:54:37,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:54:37,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:54:37,349 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:54:37,349 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:54:37,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:54:37,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-04-15 06:54:37,353 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 15 [2022-04-15 06:54:37,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:54:37,354 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-04-15 06:54:37,355 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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-15 06:54:37,357 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 27 transitions. [2022-04-15 06:54:37,417 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:37,418 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-04-15 06:54:37,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 06:54:37,418 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:54:37,418 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:54:37,418 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 06:54:37,419 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:54:37,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:54:37,419 INFO L85 PathProgramCache]: Analyzing trace with hash -537500866, now seen corresponding path program 1 times [2022-04-15 06:54:37,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:54:37,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2086683212] [2022-04-15 06:54:37,421 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:54:37,422 INFO L85 PathProgramCache]: Analyzing trace with hash -537500866, now seen corresponding path program 2 times [2022-04-15 06:54:37,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:54:37,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170433708] [2022-04-15 06:54:37,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:54:37,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:54:37,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:37,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:54:37,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:37,556 INFO L290 TraceCheckUtils]: 0: Hoare triple {237#(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(12, 2);call #Ultimate.allocInit(12, 3); {231#true} is VALID [2022-04-15 06:54:37,556 INFO L290 TraceCheckUtils]: 1: Hoare triple {231#true} assume true; {231#true} is VALID [2022-04-15 06:54:37,557 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {231#true} {231#true} #85#return; {231#true} is VALID [2022-04-15 06:54:37,557 INFO L272 TraceCheckUtils]: 0: Hoare triple {231#true} call ULTIMATE.init(); {237#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:54:37,557 INFO L290 TraceCheckUtils]: 1: Hoare triple {237#(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(12, 2);call #Ultimate.allocInit(12, 3); {231#true} is VALID [2022-04-15 06:54:37,557 INFO L290 TraceCheckUtils]: 2: Hoare triple {231#true} assume true; {231#true} is VALID [2022-04-15 06:54:37,558 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {231#true} {231#true} #85#return; {231#true} is VALID [2022-04-15 06:54:37,558 INFO L272 TraceCheckUtils]: 4: Hoare triple {231#true} call #t~ret9 := main(); {231#true} is VALID [2022-04-15 06:54:37,558 INFO L290 TraceCheckUtils]: 5: Hoare triple {231#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0;~v~0 := 0;~w~0 := 0; {231#true} is VALID [2022-04-15 06:54:37,558 INFO L290 TraceCheckUtils]: 6: Hoare triple {231#true} assume !!(~w~0 % 4294967296 < 268435455);~x~0 := 0; {231#true} is VALID [2022-04-15 06:54:37,558 INFO L290 TraceCheckUtils]: 7: Hoare triple {231#true} assume !!(~x~0 % 4294967296 < 10);~y~0 := 0; {231#true} is VALID [2022-04-15 06:54:37,558 INFO L290 TraceCheckUtils]: 8: Hoare triple {231#true} assume !!(~y~0 % 4294967296 < 10);~z~0 := 0; {231#true} is VALID [2022-04-15 06:54:37,559 INFO L290 TraceCheckUtils]: 9: Hoare triple {231#true} assume !!(~z~0 % 4294967296 < 10);~v~0 := 0; {236#(= main_~v~0 0)} is VALID [2022-04-15 06:54:37,559 INFO L290 TraceCheckUtils]: 10: Hoare triple {236#(= main_~v~0 0)} assume !(~v~0 % 4294967296 < 10); {232#false} is VALID [2022-04-15 06:54:37,559 INFO L272 TraceCheckUtils]: 11: Hoare triple {232#false} call __VERIFIER_assert((if (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 <= 2147483647 then (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 else (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 - 4294967296)); {232#false} is VALID [2022-04-15 06:54:37,559 INFO L290 TraceCheckUtils]: 12: Hoare triple {232#false} ~cond := #in~cond; {232#false} is VALID [2022-04-15 06:54:37,559 INFO L290 TraceCheckUtils]: 13: Hoare triple {232#false} assume 0 == ~cond; {232#false} is VALID [2022-04-15 06:54:37,560 INFO L290 TraceCheckUtils]: 14: Hoare triple {232#false} assume !false; {232#false} is VALID [2022-04-15 06:54:37,560 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-15 06:54:37,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:54:37,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170433708] [2022-04-15 06:54:37,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170433708] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:54:37,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:54:37,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:54:37,561 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:54:37,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2086683212] [2022-04-15 06:54:37,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2086683212] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:54:37,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:54:37,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:54:37,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251127047] [2022-04-15 06:54:37,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:54:37,562 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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 15 [2022-04-15 06:54:37,562 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:54:37,562 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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-15 06:54:37,572 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:37,572 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 06:54:37,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:54:37,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 06:54:37,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 06:54:37,573 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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-15 06:54:37,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:37,666 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2022-04-15 06:54:37,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 06:54:37,667 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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 15 [2022-04-15 06:54:37,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:54:37,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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-15 06:54:37,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2022-04-15 06:54:37,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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-15 06:54:37,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2022-04-15 06:54:37,676 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 61 transitions. [2022-04-15 06:54:37,723 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:37,724 INFO L225 Difference]: With dead ends: 49 [2022-04-15 06:54:37,724 INFO L226 Difference]: Without dead ends: 32 [2022-04-15 06:54:37,724 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-15 06:54:37,725 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 41 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:54:37,726 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 31 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 06:54:37,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-15 06:54:37,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2022-04-15 06:54:37,730 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:54:37,730 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 24 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:54:37,730 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 24 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:54:37,731 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 24 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:54:37,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:37,732 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2022-04-15 06:54:37,732 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2022-04-15 06:54:37,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:54:37,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:54:37,733 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 32 states. [2022-04-15 06:54:37,733 INFO L87 Difference]: Start difference. First operand has 24 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 32 states. [2022-04-15 06:54:37,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:37,735 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2022-04-15 06:54:37,735 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2022-04-15 06:54:37,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:54:37,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:54:37,735 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:54:37,735 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:54:37,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 06:54:37,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-04-15 06:54:37,736 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 15 [2022-04-15 06:54:37,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:54:37,737 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-04-15 06:54:37,737 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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-15 06:54:37,737 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 28 transitions. [2022-04-15 06:54:37,759 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:37,759 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-04-15 06:54:37,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 06:54:37,760 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:54:37,760 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:54:37,760 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 06:54:37,760 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:54:37,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:54:37,761 INFO L85 PathProgramCache]: Analyzing trace with hash -509289700, now seen corresponding path program 1 times [2022-04-15 06:54:37,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:54:37,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [502181079] [2022-04-15 06:54:38,872 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:54:39,115 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:54:39,117 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:54:39,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1836574324, now seen corresponding path program 1 times [2022-04-15 06:54:39,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:54:39,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942638593] [2022-04-15 06:54:39,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:54:39,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:54:39,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:39,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:54:39,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:39,324 INFO L290 TraceCheckUtils]: 0: Hoare triple {463#(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(12, 2);call #Ultimate.allocInit(12, 3); {453#true} is VALID [2022-04-15 06:54:39,326 INFO L290 TraceCheckUtils]: 1: Hoare triple {453#true} assume true; {453#true} is VALID [2022-04-15 06:54:39,326 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {453#true} {453#true} #85#return; {453#true} is VALID [2022-04-15 06:54:39,327 INFO L272 TraceCheckUtils]: 0: Hoare triple {453#true} call ULTIMATE.init(); {463#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:54:39,330 INFO L290 TraceCheckUtils]: 1: Hoare triple {463#(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(12, 2);call #Ultimate.allocInit(12, 3); {453#true} is VALID [2022-04-15 06:54:39,331 INFO L290 TraceCheckUtils]: 2: Hoare triple {453#true} assume true; {453#true} is VALID [2022-04-15 06:54:39,331 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {453#true} {453#true} #85#return; {453#true} is VALID [2022-04-15 06:54:39,332 INFO L272 TraceCheckUtils]: 4: Hoare triple {453#true} call #t~ret9 := main(); {453#true} is VALID [2022-04-15 06:54:39,332 INFO L290 TraceCheckUtils]: 5: Hoare triple {453#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0;~v~0 := 0;~w~0 := 0; {453#true} is VALID [2022-04-15 06:54:39,332 INFO L290 TraceCheckUtils]: 6: Hoare triple {453#true} assume !!(~w~0 % 4294967296 < 268435455);~x~0 := 0; {453#true} is VALID [2022-04-15 06:54:39,332 INFO L290 TraceCheckUtils]: 7: Hoare triple {453#true} assume !!(~x~0 % 4294967296 < 10);~y~0 := 0; {453#true} is VALID [2022-04-15 06:54:39,332 INFO L290 TraceCheckUtils]: 8: Hoare triple {453#true} assume !!(~y~0 % 4294967296 < 10);~z~0 := 0; {453#true} is VALID [2022-04-15 06:54:39,333 INFO L290 TraceCheckUtils]: 9: Hoare triple {453#true} assume !!(~z~0 % 4294967296 < 10);~v~0 := 0; {458#(= main_~v~0 0)} is VALID [2022-04-15 06:54:39,336 INFO L290 TraceCheckUtils]: 10: Hoare triple {458#(= main_~v~0 0)} [91] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~v~0_10 v_main_~v~0_9)) (.cse1 (= |v_main_#t~post8_4| |v_main_#t~post8_3|)) (.cse2 (mod v_main_~v~0_10 4294967296))) (or (and .cse0 .cse1) (and .cse0 (<= 10 .cse2) .cse1) (and (< .cse2 10) (< v_main_~v~0_10 v_main_~v~0_9) (<= (div (+ (* (- 1) v_main_~v~0_9) 10) (- 4294967296)) (+ (div (+ v_main_~v~0_10 (- 4294967295)) 4294967296) 1))))) InVars {main_#t~post8=|v_main_#t~post8_4|, main_~v~0=v_main_~v~0_10} OutVars{main_#t~post8=|v_main_#t~post8_3|, main_~v~0=v_main_~v~0_9} AuxVars[] AssignedVars[main_~v~0, main_#t~post8] {459#(and (< 0 (+ (div main_~v~0 4294967296) 1)) (<= (div (+ (* (- 1) main_~v~0) 10) (- 4294967296)) 0))} is VALID [2022-04-15 06:54:39,337 INFO L290 TraceCheckUtils]: 11: Hoare triple {459#(and (< 0 (+ (div main_~v~0 4294967296) 1)) (<= (div (+ (* (- 1) main_~v~0) 10) (- 4294967296)) 0))} [90] L23-4_primed-->L23-4: Formula: (not (< (mod v_main_~v~0_3 4294967296) 10)) InVars {main_~v~0=v_main_~v~0_3} OutVars{main_~v~0=v_main_~v~0_3} AuxVars[] AssignedVars[] {460#(and (<= (+ (* (div main_~v~0 4294967296) 4294967296) 10 (* (div (+ (* (- 1) main_~v~0) 10) (- 4294967296)) 4294967296)) main_~v~0) (< 0 (+ (div main_~v~0 4294967296) 1)))} is VALID [2022-04-15 06:54:39,339 INFO L272 TraceCheckUtils]: 12: Hoare triple {460#(and (<= (+ (* (div main_~v~0 4294967296) 4294967296) 10 (* (div (+ (* (- 1) main_~v~0) 10) (- 4294967296)) 4294967296)) main_~v~0) (< 0 (+ (div main_~v~0 4294967296) 1)))} call __VERIFIER_assert((if (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 <= 2147483647 then (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 else (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 - 4294967296)); {461#(or (<= 2 |__VERIFIER_assert_#in~cond|) (<= (+ 2 |__VERIFIER_assert_#in~cond|) 0))} is VALID [2022-04-15 06:54:39,340 INFO L290 TraceCheckUtils]: 13: Hoare triple {461#(or (<= 2 |__VERIFIER_assert_#in~cond|) (<= (+ 2 |__VERIFIER_assert_#in~cond|) 0))} ~cond := #in~cond; {462#(or (<= 2 __VERIFIER_assert_~cond) (<= (+ 2 __VERIFIER_assert_~cond) 0))} is VALID [2022-04-15 06:54:39,340 INFO L290 TraceCheckUtils]: 14: Hoare triple {462#(or (<= 2 __VERIFIER_assert_~cond) (<= (+ 2 __VERIFIER_assert_~cond) 0))} assume 0 == ~cond; {454#false} is VALID [2022-04-15 06:54:39,340 INFO L290 TraceCheckUtils]: 15: Hoare triple {454#false} assume !false; {454#false} is VALID [2022-04-15 06:54:39,341 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-15 06:54:39,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:54:39,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942638593] [2022-04-15 06:54:39,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942638593] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:54:39,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:54:39,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 06:54:39,406 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:54:39,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [502181079] [2022-04-15 06:54:39,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [502181079] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:54:39,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:54:39,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 06:54:39,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741658817] [2022-04-15 06:54:39,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:54:39,407 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 7 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 [2022-04-15 06:54:39,408 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:54:39,408 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 1.625) internal successors, (13), 7 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) [2022-04-15 06:54:39,429 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:39,429 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 06:54:39,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:54:39,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 06:54:39,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-15 06:54:39,430 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 9 states, 8 states have (on average 1.625) internal successors, (13), 7 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) [2022-04-15 06:54:39,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:39,947 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2022-04-15 06:54:39,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 06:54:39,947 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 7 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 [2022-04-15 06:54:39,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:54:39,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.625) internal successors, (13), 7 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) [2022-04-15 06:54:39,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 39 transitions. [2022-04-15 06:54:39,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.625) internal successors, (13), 7 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) [2022-04-15 06:54:39,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 39 transitions. [2022-04-15 06:54:39,950 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 39 transitions. [2022-04-15 06:54:39,994 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:39,994 INFO L225 Difference]: With dead ends: 32 [2022-04-15 06:54:39,995 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 06:54:39,995 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2022-04-15 06:54:39,996 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 55 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:54:39,996 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 61 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:54:39,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 06:54:39,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 06:54:39,996 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:54:39,997 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second 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) [2022-04-15 06:54:39,997 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second 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) [2022-04-15 06:54:39,997 INFO L87 Difference]: Start difference. First operand 0 states. Second 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) [2022-04-15 06:54:39,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:39,997 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 06:54:39,997 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 06:54:39,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:54:39,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:54:39,997 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 0 states. [2022-04-15 06:54:39,997 INFO L87 Difference]: Start difference. First 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) Second operand 0 states. [2022-04-15 06:54:39,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:39,997 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 06:54:39,997 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 06:54:39,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:54:39,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:54:39,997 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:54:39,997 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:54:39,998 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) [2022-04-15 06:54:39,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 06:54:39,998 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2022-04-15 06:54:39,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:54:39,998 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 06:54:39,998 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 7 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) [2022-04-15 06:54:39,998 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-15 06:54:39,998 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:39,998 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 06:54:39,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:54:40,000 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 06:54:40,000 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 06:54:40,002 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 06:54:40,253 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-15 06:54:40,254 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-15 06:54:40,254 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-15 06:54:40,254 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-15 06:54:40,254 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-15 06:54:40,254 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-15 06:54:40,254 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-15 06:54:40,254 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 06:54:40,254 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 06:54:40,254 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-15 06:54:40,254 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 12 27) the Hoare annotation is: true [2022-04-15 06:54:40,254 INFO L878 garLoopResultBuilder]: At program point L23-2(line 23) the Hoare annotation is: (and (< (mod main_~v~0 4294967296) 10) (< 0 (+ (div main_~v~0 4294967296) 1)) (<= (div (+ (* (- 1) main_~v~0) 10) (- 4294967296)) 0)) [2022-04-15 06:54:40,254 INFO L878 garLoopResultBuilder]: At program point L23-3(line 23) the Hoare annotation is: (and (< 0 (+ (div main_~v~0 4294967296) 1)) (<= (div (+ (* (- 1) main_~v~0) 10) (- 4294967296)) 0)) [2022-04-15 06:54:40,254 INFO L878 garLoopResultBuilder]: At program point L23-4(line 23) the Hoare annotation is: (let ((.cse0 (div main_~v~0 4294967296))) (and (<= (+ (* .cse0 4294967296) 10 (* (div (+ (* (- 1) main_~v~0) 10) (- 4294967296)) 4294967296)) main_~v~0) (< 0 (+ .cse0 1)))) [2022-04-15 06:54:40,255 INFO L878 garLoopResultBuilder]: At program point L19-2(lines 19 25) the Hoare annotation is: (and (< 0 (+ (div main_~v~0 4294967296) 1)) (<= (div (+ (* (- 1) main_~v~0) 10) (- 4294967296)) 0)) [2022-04-15 06:54:40,255 INFO L878 garLoopResultBuilder]: At program point L19-3(lines 19 25) the Hoare annotation is: (and (< 0 (+ (div main_~v~0 4294967296) 1)) (<= (div (+ (* (- 1) main_~v~0) 10) (- 4294967296)) 0)) [2022-04-15 06:54:40,255 INFO L885 garLoopResultBuilder]: At program point L19-4(lines 19 25) the Hoare annotation is: true [2022-04-15 06:54:40,255 INFO L878 garLoopResultBuilder]: At program point L24(lines 22 25) the Hoare annotation is: (let ((.cse0 (div main_~v~0 4294967296))) (and (<= (+ (* .cse0 4294967296) 10 (* (div (+ (* (- 1) main_~v~0) 10) (- 4294967296)) 4294967296)) main_~v~0) (< 0 (+ .cse0 1)))) [2022-04-15 06:54:40,255 INFO L878 garLoopResultBuilder]: At program point L20-2(lines 20 25) the Hoare annotation is: (and (< 0 (+ (div main_~v~0 4294967296) 1)) (<= (div (+ (* (- 1) main_~v~0) 10) (- 4294967296)) 0)) [2022-04-15 06:54:40,255 INFO L878 garLoopResultBuilder]: At program point L20-3(lines 20 25) the Hoare annotation is: (and (< 0 (+ (div main_~v~0 4294967296) 1)) (<= (div (+ (* (- 1) main_~v~0) 10) (- 4294967296)) 0)) [2022-04-15 06:54:40,255 INFO L878 garLoopResultBuilder]: At program point L21-2(lines 21 25) the Hoare annotation is: (and (< 0 (+ (div main_~v~0 4294967296) 1)) (<= (div (+ (* (- 1) main_~v~0) 10) (- 4294967296)) 0)) [2022-04-15 06:54:40,255 INFO L878 garLoopResultBuilder]: At program point L21-3(lines 21 25) the Hoare annotation is: (and (< 0 (+ (div main_~v~0 4294967296) 1)) (<= (div (+ (* (- 1) main_~v~0) 10) (- 4294967296)) 0)) [2022-04-15 06:54:40,255 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 12 27) the Hoare annotation is: true [2022-04-15 06:54:40,255 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 12 27) the Hoare annotation is: true [2022-04-15 06:54:40,255 INFO L878 garLoopResultBuilder]: At program point L22-2(lines 22 25) the Hoare annotation is: (and (< 0 (+ (div main_~v~0 4294967296) 1)) (<= (div (+ (* (- 1) main_~v~0) 10) (- 4294967296)) 0)) [2022-04-15 06:54:40,255 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 5 10) the Hoare annotation is: true [2022-04-15 06:54:40,255 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 5 10) the Hoare annotation is: (or (<= 2 __VERIFIER_assert_~cond) (and (not (<= 2 |__VERIFIER_assert_#in~cond|)) (not (<= (+ 2 |__VERIFIER_assert_#in~cond|) 0))) (<= (+ 2 __VERIFIER_assert_~cond) 0)) [2022-04-15 06:54:40,255 INFO L878 garLoopResultBuilder]: At program point L7(line 7) the Hoare annotation is: (and (not (<= 2 |__VERIFIER_assert_#in~cond|)) (not (<= (+ 2 |__VERIFIER_assert_#in~cond|) 0))) [2022-04-15 06:54:40,256 INFO L878 garLoopResultBuilder]: At program point L6(lines 6 8) the Hoare annotation is: (or (<= 2 __VERIFIER_assert_~cond) (and (not (<= 2 |__VERIFIER_assert_#in~cond|)) (not (<= (+ 2 |__VERIFIER_assert_#in~cond|) 0))) (<= (+ 2 __VERIFIER_assert_~cond) 0)) [2022-04-15 06:54:40,256 INFO L878 garLoopResultBuilder]: At program point L6-2(lines 5 10) the Hoare annotation is: (or (<= 2 __VERIFIER_assert_~cond) (and (not (<= 2 |__VERIFIER_assert_#in~cond|)) (not (<= (+ 2 |__VERIFIER_assert_#in~cond|) 0))) (<= (+ 2 __VERIFIER_assert_~cond) 0)) [2022-04-15 06:54:40,256 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) the Hoare annotation is: (and (not (<= 2 |__VERIFIER_assert_#in~cond|)) (not (<= (+ 2 |__VERIFIER_assert_#in~cond|) 0))) [2022-04-15 06:54:40,258 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1] [2022-04-15 06:54:40,258 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 06:54:40,261 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 06:54:40,266 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-15 06:54:40,291 INFO L163 areAnnotationChecker]: CFG has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 06:54:40,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 06:54:40 BoogieIcfgContainer [2022-04-15 06:54:40,304 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 06:54:40,305 INFO L158 Benchmark]: Toolchain (without parser) took 4099.53ms. Allocated memory was 213.9MB in the beginning and 326.1MB in the end (delta: 112.2MB). Free memory was 161.0MB in the beginning and 146.4MB in the end (delta: 14.6MB). Peak memory consumption was 127.7MB. Max. memory is 8.0GB. [2022-04-15 06:54:40,305 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 213.9MB. Free memory is still 177.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 06:54:40,306 INFO L158 Benchmark]: CACSL2BoogieTranslator took 168.51ms. Allocated memory is still 213.9MB. Free memory was 160.8MB in the beginning and 186.5MB in the end (delta: -25.6MB). Peak memory consumption was 12.3MB. Max. memory is 8.0GB. [2022-04-15 06:54:40,306 INFO L158 Benchmark]: Boogie Preprocessor took 23.70ms. Allocated memory is still 213.9MB. Free memory was 186.5MB in the beginning and 185.2MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 06:54:40,306 INFO L158 Benchmark]: RCFGBuilder took 291.80ms. Allocated memory is still 213.9MB. Free memory was 185.2MB in the beginning and 172.8MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-15 06:54:40,306 INFO L158 Benchmark]: TraceAbstraction took 3611.73ms. Allocated memory was 213.9MB in the beginning and 326.1MB in the end (delta: 112.2MB). Free memory was 172.2MB in the beginning and 146.4MB in the end (delta: 25.9MB). Peak memory consumption was 138.5MB. Max. memory is 8.0GB. [2022-04-15 06:54:40,307 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 213.9MB. Free memory is still 177.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 168.51ms. Allocated memory is still 213.9MB. Free memory was 160.8MB in the beginning and 186.5MB in the end (delta: -25.6MB). Peak memory consumption was 12.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.70ms. Allocated memory is still 213.9MB. Free memory was 186.5MB in the beginning and 185.2MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 291.80ms. Allocated memory is still 213.9MB. Free memory was 185.2MB in the beginning and 172.8MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 3611.73ms. Allocated memory was 213.9MB in the beginning and 326.1MB in the end (delta: 112.2MB). Free memory was 172.2MB in the beginning and 146.4MB in the end (delta: 25.9MB). Peak memory consumption was 138.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 7]: 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 5 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 121 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 119 mSDsluCounter, 126 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 42 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 152 IncrementalHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 84 mSDtfsCounter, 152 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 33 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=0, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 8 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 40 PreInvPairs, 67 NumberOfFragments, 310 HoareAnnotationTreeSize, 40 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 28 FomulaSimplificationsInter, 341 FormulaSimplificationTreeSizeReductionInter, 0.2s 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: 21]: Loop Invariant Derived loop invariant: 0 < v / 4294967296 + 1 && (-1 * v + 10) / -4294967296 <= 0 - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 0 < v / 4294967296 + 1 && (-1 * v + 10) / -4294967296 <= 0 - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: 0 < v / 4294967296 + 1 && (-1 * v + 10) / -4294967296 <= 0 - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: 0 < v / 4294967296 + 1 && (-1 * v + 10) / -4294967296 <= 0 - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: 0 < v / 4294967296 + 1 && (-1 * v + 10) / -4294967296 <= 0 - ProcedureContractResult [Line: 12]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 5]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: (2 <= cond || (!(2 <= \old(cond)) && !(2 + \old(cond) <= 0))) || 2 + cond <= 0 RESULT: Ultimate proved your program to be correct! [2022-04-15 06:54:40,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...