/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loop-acceleration/underapprox_1-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 12:18:26,326 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 12:18:26,327 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 12:18:26,350 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 12:18:26,351 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 12:18:26,352 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 12:18:26,353 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 12:18:26,354 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 12:18:26,358 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 12:18:26,358 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 12:18:26,359 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 12:18:26,360 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 12:18:26,360 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 12:18:26,361 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 12:18:26,362 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 12:18:26,363 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 12:18:26,364 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 12:18:26,364 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 12:18:26,366 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 12:18:26,367 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 12:18:26,369 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 12:18:26,375 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 12:18:26,380 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 12:18:26,382 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 12:18:26,386 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 12:18:26,388 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 12:18:26,388 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 12:18:26,389 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 12:18:26,389 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 12:18:26,390 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 12:18:26,390 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 12:18:26,391 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 12:18:26,391 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 12:18:26,392 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 12:18:26,392 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 12:18:26,393 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 12:18:26,393 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 12:18:26,394 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 12:18:26,394 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 12:18:26,394 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 12:18:26,401 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 12:18:26,405 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 12:18:26,405 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 12:18:26,419 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 12:18:26,419 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 12:18:26,422 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 12:18:26,422 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 12:18:26,422 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 12:18:26,422 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 12:18:26,422 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 12:18:26,422 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 12:18:26,422 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 12:18:26,423 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 12:18:26,423 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 12:18:26,424 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 12:18:26,424 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 12:18:26,424 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 12:18:26,424 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 12:18:26,424 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:18:26,424 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 12:18:26,424 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 12:18:26,424 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 12:18:26,425 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 12:18:26,425 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 12:18:26,425 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 12:18:26,425 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 12:18:26,638 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 12:18:26,656 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 12:18:26,658 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 12:18:26,659 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 12:18:26,659 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 12:18:26,660 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/underapprox_1-2.c [2022-04-15 12:18:26,727 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c8746761/4af58fd5504c43fdbe8f53ac8d6d0e57/FLAGfed3e84bf [2022-04-15 12:18:27,083 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 12:18:27,084 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/underapprox_1-2.c [2022-04-15 12:18:27,088 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c8746761/4af58fd5504c43fdbe8f53ac8d6d0e57/FLAGfed3e84bf [2022-04-15 12:18:27,099 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c8746761/4af58fd5504c43fdbe8f53ac8d6d0e57 [2022-04-15 12:18:27,102 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 12:18:27,103 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 12:18:27,104 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 12:18:27,104 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 12:18:27,107 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 12:18:27,108 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:18:27" (1/1) ... [2022-04-15 12:18:27,109 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@224c72b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:18:27, skipping insertion in model container [2022-04-15 12:18:27,109 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:18:27" (1/1) ... [2022-04-15 12:18:27,115 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 12:18:27,125 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 12:18:27,306 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/underapprox_1-2.c[327,340] [2022-04-15 12:18:27,322 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:18:27,340 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 12:18:27,356 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/underapprox_1-2.c[327,340] [2022-04-15 12:18:27,365 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:18:27,379 INFO L208 MainTranslator]: Completed translation [2022-04-15 12:18:27,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:18:27 WrapperNode [2022-04-15 12:18:27,380 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 12:18:27,381 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 12:18:27,381 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 12:18:27,382 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 12:18:27,393 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:18:27" (1/1) ... [2022-04-15 12:18:27,393 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:18:27" (1/1) ... [2022-04-15 12:18:27,398 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:18:27" (1/1) ... [2022-04-15 12:18:27,398 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:18:27" (1/1) ... [2022-04-15 12:18:27,404 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:18:27" (1/1) ... [2022-04-15 12:18:27,408 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:18:27" (1/1) ... [2022-04-15 12:18:27,413 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:18:27" (1/1) ... [2022-04-15 12:18:27,415 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 12:18:27,416 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 12:18:27,417 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 12:18:27,417 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 12:18:27,417 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:18:27" (1/1) ... [2022-04-15 12:18:27,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:18:27,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:18:27,449 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 12:18:27,455 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 12:18:27,477 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 12:18:27,477 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 12:18:27,477 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 12:18:27,477 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 12:18:27,477 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 12:18:27,477 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 12:18:27,478 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 12:18:27,478 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 12:18:27,478 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 12:18:27,478 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 12:18:27,478 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 12:18:27,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 12:18:27,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 12:18:27,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 12:18:27,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 12:18:27,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 12:18:27,479 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 12:18:27,534 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 12:18:27,535 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 12:18:27,653 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 12:18:27,660 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 12:18:27,660 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 12:18:27,661 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:18:27 BoogieIcfgContainer [2022-04-15 12:18:27,661 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 12:18:27,663 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 12:18:27,663 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 12:18:27,671 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 12:18:27,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:18:27" (1/3) ... [2022-04-15 12:18:27,673 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ed52826 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:18:27, skipping insertion in model container [2022-04-15 12:18:27,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:18:27" (2/3) ... [2022-04-15 12:18:27,673 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ed52826 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:18:27, skipping insertion in model container [2022-04-15 12:18:27,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:18:27" (3/3) ... [2022-04-15 12:18:27,674 INFO L111 eAbstractionObserver]: Analyzing ICFG underapprox_1-2.c [2022-04-15 12:18:27,679 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 12:18:27,679 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 12:18:27,725 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 12:18:27,731 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 12:18:27,732 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 12:18:27,759 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 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 12:18:27,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 12:18:27,765 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:18:27,765 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:18:27,766 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:18:27,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:18:27,771 INFO L85 PathProgramCache]: Analyzing trace with hash -219174432, now seen corresponding path program 1 times [2022-04-15 12:18:27,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:27,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1016937692] [2022-04-15 12:18:27,786 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:18:27,786 INFO L85 PathProgramCache]: Analyzing trace with hash -219174432, now seen corresponding path program 2 times [2022-04-15 12:18:27,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:27,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909268489] [2022-04-15 12:18:27,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:27,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:27,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:27,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:18:27,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:27,927 INFO L290 TraceCheckUtils]: 0: Hoare triple {26#(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(18, 2);call #Ultimate.allocInit(12, 3); {21#true} is VALID [2022-04-15 12:18:27,928 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-15 12:18:27,928 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} #34#return; {21#true} is VALID [2022-04-15 12:18:27,930 INFO L272 TraceCheckUtils]: 0: Hoare triple {21#true} call ULTIMATE.init(); {26#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:18:27,930 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#(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(18, 2);call #Ultimate.allocInit(12, 3); {21#true} is VALID [2022-04-15 12:18:27,931 INFO L290 TraceCheckUtils]: 2: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-15 12:18:27,931 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21#true} {21#true} #34#return; {21#true} is VALID [2022-04-15 12:18:27,931 INFO L272 TraceCheckUtils]: 4: Hoare triple {21#true} call #t~ret5 := main(); {21#true} is VALID [2022-04-15 12:18:27,931 INFO L290 TraceCheckUtils]: 5: Hoare triple {21#true} ~x~0 := 0;~y~0 := 1; {21#true} is VALID [2022-04-15 12:18:27,932 INFO L290 TraceCheckUtils]: 6: Hoare triple {21#true} assume !true; {22#false} is VALID [2022-04-15 12:18:27,933 INFO L272 TraceCheckUtils]: 7: Hoare triple {22#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 - 4294967296)); {22#false} is VALID [2022-04-15 12:18:27,933 INFO L290 TraceCheckUtils]: 8: Hoare triple {22#false} ~cond := #in~cond; {22#false} is VALID [2022-04-15 12:18:27,933 INFO L290 TraceCheckUtils]: 9: Hoare triple {22#false} assume 0 == ~cond; {22#false} is VALID [2022-04-15 12:18:27,933 INFO L290 TraceCheckUtils]: 10: Hoare triple {22#false} assume !false; {22#false} is VALID [2022-04-15 12:18:27,934 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 12:18:27,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:18:27,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909268489] [2022-04-15 12:18:27,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909268489] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:27,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:27,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 12:18:27,938 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:18:27,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1016937692] [2022-04-15 12:18:27,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1016937692] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:27,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:27,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 12:18:27,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751086171] [2022-04-15 12:18:27,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:18:27,944 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 11 [2022-04-15 12:18:27,946 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:18:27,949 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 12:18:27,966 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:27,966 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 12:18:27,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:27,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 12:18:27,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 12:18:27,992 INFO L87 Difference]: Start difference. First operand has 18 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 12:18:28,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:28,126 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-04-15 12:18:28,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 12:18:28,126 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 11 [2022-04-15 12:18:28,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:18:28,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 12:18:28,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-04-15 12:18:28,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 12:18:28,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-04-15 12:18:28,152 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 32 transitions. [2022-04-15 12:18:28,221 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:28,229 INFO L225 Difference]: With dead ends: 29 [2022-04-15 12:18:28,229 INFO L226 Difference]: Without dead ends: 12 [2022-04-15 12:18:28,231 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 12:18:28,235 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 9 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 20 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 12:18:28,236 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 20 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:18:28,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-04-15 12:18:28,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-04-15 12:18:28,259 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:18:28,260 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:28,260 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:28,261 INFO L87 Difference]: Start difference. First operand 12 states. Second operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:28,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:28,263 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-04-15 12:18:28,264 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-15 12:18:28,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:28,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:28,265 INFO L74 IsIncluded]: Start isIncluded. First operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 12 states. [2022-04-15 12:18:28,265 INFO L87 Difference]: Start difference. First operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 12 states. [2022-04-15 12:18:28,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:28,267 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-04-15 12:18:28,267 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-15 12:18:28,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:28,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:28,268 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:18:28,268 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:18:28,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:28,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2022-04-15 12:18:28,271 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 11 [2022-04-15 12:18:28,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:18:28,271 INFO L478 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2022-04-15 12:18:28,272 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 12:18:28,272 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 12 transitions. [2022-04-15 12:18:28,286 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:28,287 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-15 12:18:28,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 12:18:28,287 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:18:28,288 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:18:28,288 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 12:18:28,288 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:18:28,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:18:28,289 INFO L85 PathProgramCache]: Analyzing trace with hash -222868516, now seen corresponding path program 1 times [2022-04-15 12:18:28,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:28,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [284550122] [2022-04-15 12:18:28,290 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:18:28,290 INFO L85 PathProgramCache]: Analyzing trace with hash -222868516, now seen corresponding path program 2 times [2022-04-15 12:18:28,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:28,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981964440] [2022-04-15 12:18:28,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:28,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:28,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:28,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:18:28,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:28,359 INFO L290 TraceCheckUtils]: 0: Hoare triple {141#(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(18, 2);call #Ultimate.allocInit(12, 3); {135#true} is VALID [2022-04-15 12:18:28,359 INFO L290 TraceCheckUtils]: 1: Hoare triple {135#true} assume true; {135#true} is VALID [2022-04-15 12:18:28,360 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {135#true} {135#true} #34#return; {135#true} is VALID [2022-04-15 12:18:28,360 INFO L272 TraceCheckUtils]: 0: Hoare triple {135#true} call ULTIMATE.init(); {141#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:18:28,361 INFO L290 TraceCheckUtils]: 1: Hoare triple {141#(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(18, 2);call #Ultimate.allocInit(12, 3); {135#true} is VALID [2022-04-15 12:18:28,361 INFO L290 TraceCheckUtils]: 2: Hoare triple {135#true} assume true; {135#true} is VALID [2022-04-15 12:18:28,361 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {135#true} {135#true} #34#return; {135#true} is VALID [2022-04-15 12:18:28,361 INFO L272 TraceCheckUtils]: 4: Hoare triple {135#true} call #t~ret5 := main(); {135#true} is VALID [2022-04-15 12:18:28,362 INFO L290 TraceCheckUtils]: 5: Hoare triple {135#true} ~x~0 := 0;~y~0 := 1; {140#(= main_~x~0 0)} is VALID [2022-04-15 12:18:28,363 INFO L290 TraceCheckUtils]: 6: Hoare triple {140#(= main_~x~0 0)} assume !(~x~0 % 4294967296 < 6); {136#false} is VALID [2022-04-15 12:18:28,363 INFO L272 TraceCheckUtils]: 7: Hoare triple {136#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 - 4294967296)); {136#false} is VALID [2022-04-15 12:18:28,363 INFO L290 TraceCheckUtils]: 8: Hoare triple {136#false} ~cond := #in~cond; {136#false} is VALID [2022-04-15 12:18:28,363 INFO L290 TraceCheckUtils]: 9: Hoare triple {136#false} assume 0 == ~cond; {136#false} is VALID [2022-04-15 12:18:28,363 INFO L290 TraceCheckUtils]: 10: Hoare triple {136#false} assume !false; {136#false} is VALID [2022-04-15 12:18:28,364 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 12:18:28,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:18:28,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981964440] [2022-04-15 12:18:28,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981964440] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:28,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:28,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:18:28,365 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:18:28,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [284550122] [2022-04-15 12:18:28,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [284550122] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:28,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:28,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:18:28,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637065945] [2022-04-15 12:18:28,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:18:28,368 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 11 [2022-04-15 12:18:28,368 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:18:28,368 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 12:18:28,380 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:28,380 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 12:18:28,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:28,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 12:18:28,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 12:18:28,382 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 12:18:28,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:28,436 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-15 12:18:28,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 12:18:28,436 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 11 [2022-04-15 12:18:28,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:18:28,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 12:18:28,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-04-15 12:18:28,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 12:18:28,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-04-15 12:18:28,439 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 18 transitions. [2022-04-15 12:18:28,459 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:28,463 INFO L225 Difference]: With dead ends: 18 [2022-04-15 12:18:28,463 INFO L226 Difference]: Without dead ends: 13 [2022-04-15 12:18:28,464 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 12:18:28,467 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:18:28,468 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 18 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:18:28,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-15 12:18:28,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-15 12:18:28,475 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:18:28,476 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:28,477 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:28,477 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:28,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:28,481 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-15 12:18:28,481 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-15 12:18:28,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:28,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:28,482 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-15 12:18:28,482 INFO L87 Difference]: Start difference. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-15 12:18:28,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:28,485 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-15 12:18:28,485 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-15 12:18:28,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:28,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:28,487 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:18:28,487 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:18:28,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:28,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-04-15 12:18:28,490 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2022-04-15 12:18:28,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:18:28,490 INFO L478 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-04-15 12:18:28,491 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 12:18:28,491 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 13 transitions. [2022-04-15 12:18:28,506 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:28,507 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-15 12:18:28,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 12:18:28,507 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:18:28,508 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:18:28,508 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 12:18:28,509 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:18:28,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:18:28,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1717471862, now seen corresponding path program 1 times [2022-04-15 12:18:28,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:28,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1536254936] [2022-04-15 12:18:31,167 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:18:31,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1867307785, now seen corresponding path program 1 times [2022-04-15 12:18:31,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:31,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275849126] [2022-04-15 12:18:31,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:31,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:31,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:31,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:18:31,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:31,254 INFO L290 TraceCheckUtils]: 0: Hoare triple {241#(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(18, 2);call #Ultimate.allocInit(12, 3); {234#true} is VALID [2022-04-15 12:18:31,254 INFO L290 TraceCheckUtils]: 1: Hoare triple {234#true} assume true; {234#true} is VALID [2022-04-15 12:18:31,254 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {234#true} {234#true} #34#return; {234#true} is VALID [2022-04-15 12:18:31,255 INFO L272 TraceCheckUtils]: 0: Hoare triple {234#true} call ULTIMATE.init(); {241#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:18:31,255 INFO L290 TraceCheckUtils]: 1: Hoare triple {241#(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(18, 2);call #Ultimate.allocInit(12, 3); {234#true} is VALID [2022-04-15 12:18:31,256 INFO L290 TraceCheckUtils]: 2: Hoare triple {234#true} assume true; {234#true} is VALID [2022-04-15 12:18:31,256 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {234#true} {234#true} #34#return; {234#true} is VALID [2022-04-15 12:18:31,256 INFO L272 TraceCheckUtils]: 4: Hoare triple {234#true} call #t~ret5 := main(); {234#true} is VALID [2022-04-15 12:18:31,257 INFO L290 TraceCheckUtils]: 5: Hoare triple {234#true} ~x~0 := 0;~y~0 := 1; {239#(and (= main_~x~0 0) (= main_~y~0 1))} is VALID [2022-04-15 12:18:31,258 INFO L290 TraceCheckUtils]: 6: Hoare triple {239#(and (= main_~x~0 0) (= main_~y~0 1))} [40] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_In_1 v_main_~y~0_Out_2))) (or (and .cse0 (= v_main_~x~0_In_1 v_main_~x~0_Out_2)) (and (<= v_main_~x~0_In_1 v_main_~x~0_Out_2) .cse0 (< (mod (+ v_main_~x~0_Out_2 4294967295) 4294967296) 6) (= (mod v_main_~y~0_Out_2 2) 0) (= v_main_~y~0_Out_2 0)))) InVars {main_~x~0=v_main_~x~0_In_1, main_~y~0=v_main_~y~0_In_1} OutVars{main_#t~post4=|v_main_#t~post4_Out_2|, main_~y~0=v_main_~y~0_Out_2, main_~x~0=v_main_~x~0_Out_2} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {240#(= main_~x~0 0)} is VALID [2022-04-15 12:18:31,258 INFO L290 TraceCheckUtils]: 7: Hoare triple {240#(= main_~x~0 0)} [39] L16-3_primed-->L16-3: Formula: (not (< (mod v_main_~x~0_4 4294967296) 6)) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[] {235#false} is VALID [2022-04-15 12:18:31,259 INFO L272 TraceCheckUtils]: 8: Hoare triple {235#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 - 4294967296)); {235#false} is VALID [2022-04-15 12:18:31,259 INFO L290 TraceCheckUtils]: 9: Hoare triple {235#false} ~cond := #in~cond; {235#false} is VALID [2022-04-15 12:18:31,259 INFO L290 TraceCheckUtils]: 10: Hoare triple {235#false} assume 0 == ~cond; {235#false} is VALID [2022-04-15 12:18:31,259 INFO L290 TraceCheckUtils]: 11: Hoare triple {235#false} assume !false; {235#false} is VALID [2022-04-15 12:18:31,259 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 12:18:31,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:18:31,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275849126] [2022-04-15 12:18:31,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275849126] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:31,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:31,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:18:31,306 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:18:31,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1536254936] [2022-04-15 12:18:31,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1536254936] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:31,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:31,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:18:31,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034686781] [2022-04-15 12:18:31,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:18:31,310 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 12:18:31,310 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:18:31,310 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:31,322 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:31,322 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 12:18:31,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:31,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 12:18:31,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-15 12:18:31,324 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:31,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:31,413 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-15 12:18:31,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 12:18:31,414 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 12:18:31,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:18:31,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:31,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2022-04-15 12:18:31,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:31,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2022-04-15 12:18:31,427 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 19 transitions. [2022-04-15 12:18:31,445 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:31,447 INFO L225 Difference]: With dead ends: 19 [2022-04-15 12:18:31,447 INFO L226 Difference]: Without dead ends: 14 [2022-04-15 12:18:31,448 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-04-15 12:18:31,449 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:18:31,449 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 23 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:18:31,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-15 12:18:31,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-15 12:18:31,452 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:18:31,452 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:31,453 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:31,453 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:31,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:31,454 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-15 12:18:31,454 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-15 12:18:31,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:31,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:31,455 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-15 12:18:31,455 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-15 12:18:31,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:31,456 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-15 12:18:31,456 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-15 12:18:31,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:31,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:31,456 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:18:31,457 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:18:31,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:31,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-15 12:18:31,458 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2022-04-15 12:18:31,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:18:31,458 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-15 12:18:31,458 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:31,458 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 14 transitions. [2022-04-15 12:18:31,479 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:31,479 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-15 12:18:31,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-15 12:18:31,480 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:18:31,480 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:18:31,480 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 12:18:31,480 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:18:31,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:18:31,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1738481436, now seen corresponding path program 2 times [2022-04-15 12:18:31,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:31,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1589656340] [2022-04-15 12:18:31,757 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:18:31,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1808202441, now seen corresponding path program 1 times [2022-04-15 12:18:31,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:31,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620091782] [2022-04-15 12:18:31,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:31,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:31,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:31,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:18:31,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:31,859 INFO L290 TraceCheckUtils]: 0: Hoare triple {350#(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(18, 2);call #Ultimate.allocInit(12, 3); {343#true} is VALID [2022-04-15 12:18:31,860 INFO L290 TraceCheckUtils]: 1: Hoare triple {343#true} assume true; {343#true} is VALID [2022-04-15 12:18:31,860 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {343#true} {343#true} #34#return; {343#true} is VALID [2022-04-15 12:18:31,861 INFO L272 TraceCheckUtils]: 0: Hoare triple {343#true} call ULTIMATE.init(); {350#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:18:31,861 INFO L290 TraceCheckUtils]: 1: Hoare triple {350#(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(18, 2);call #Ultimate.allocInit(12, 3); {343#true} is VALID [2022-04-15 12:18:31,861 INFO L290 TraceCheckUtils]: 2: Hoare triple {343#true} assume true; {343#true} is VALID [2022-04-15 12:18:31,861 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {343#true} {343#true} #34#return; {343#true} is VALID [2022-04-15 12:18:31,861 INFO L272 TraceCheckUtils]: 4: Hoare triple {343#true} call #t~ret5 := main(); {343#true} is VALID [2022-04-15 12:18:31,862 INFO L290 TraceCheckUtils]: 5: Hoare triple {343#true} ~x~0 := 0;~y~0 := 1; {348#(and (= main_~x~0 0) (= main_~y~0 1))} is VALID [2022-04-15 12:18:31,863 INFO L290 TraceCheckUtils]: 6: Hoare triple {348#(and (= main_~x~0 0) (= main_~y~0 1))} [42] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_In_2 v_main_~y~0_Out_4))) (or (and (= v_main_~y~0_Out_4 0) (< (mod (+ v_main_~x~0_Out_4 4294967295) 4294967296) 6) (<= v_main_~x~0_In_2 v_main_~x~0_Out_4) (= (mod v_main_~y~0_Out_4 2) 0) .cse0) (and (= v_main_~x~0_In_2 v_main_~x~0_Out_4) .cse0))) InVars {main_~x~0=v_main_~x~0_In_2, main_~y~0=v_main_~y~0_In_2} OutVars{main_#t~post4=|v_main_#t~post4_Out_4|, main_~y~0=v_main_~y~0_Out_4, main_~x~0=v_main_~x~0_Out_4} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {349#(and (<= main_~x~0 0) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:18:31,864 INFO L290 TraceCheckUtils]: 7: Hoare triple {349#(and (<= main_~x~0 0) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} [41] L16-3_primed-->L16-3: Formula: (not (< (mod v_main_~x~0_4 4294967296) 6)) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[] {344#false} is VALID [2022-04-15 12:18:31,864 INFO L272 TraceCheckUtils]: 8: Hoare triple {344#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 - 4294967296)); {344#false} is VALID [2022-04-15 12:18:31,864 INFO L290 TraceCheckUtils]: 9: Hoare triple {344#false} ~cond := #in~cond; {344#false} is VALID [2022-04-15 12:18:31,864 INFO L290 TraceCheckUtils]: 10: Hoare triple {344#false} assume 0 == ~cond; {344#false} is VALID [2022-04-15 12:18:31,865 INFO L290 TraceCheckUtils]: 11: Hoare triple {344#false} assume !false; {344#false} is VALID [2022-04-15 12:18:31,865 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 12:18:31,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:18:31,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620091782] [2022-04-15 12:18:31,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620091782] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:31,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:31,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:18:31,912 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:18:31,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1589656340] [2022-04-15 12:18:31,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1589656340] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:31,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:31,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:18:31,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254392670] [2022-04-15 12:18:31,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:18:31,913 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-15 12:18:31,913 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:18:31,914 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:31,925 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:31,925 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 12:18:31,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:31,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 12:18:31,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-15 12:18:31,926 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:32,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:32,028 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-15 12:18:32,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 12:18:32,028 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-15 12:18:32,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:18:32,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:32,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2022-04-15 12:18:32,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:32,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2022-04-15 12:18:32,031 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 20 transitions. [2022-04-15 12:18:32,059 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:32,060 INFO L225 Difference]: With dead ends: 20 [2022-04-15 12:18:32,060 INFO L226 Difference]: Without dead ends: 15 [2022-04-15 12:18:32,062 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-04-15 12:18:32,064 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:18:32,067 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 28 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:18:32,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-15 12:18:32,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-15 12:18:32,073 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:18:32,073 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:32,073 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:32,074 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:32,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:32,077 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-15 12:18:32,077 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-15 12:18:32,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:32,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:32,078 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-15 12:18:32,078 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-15 12:18:32,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:32,085 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-15 12:18:32,085 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-15 12:18:32,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:32,086 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:32,086 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:18:32,086 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:18:32,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:32,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-15 12:18:32,087 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2022-04-15 12:18:32,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:18:32,087 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-15 12:18:32,088 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:32,088 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 15 transitions. [2022-04-15 12:18:32,107 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 12:18:32,107 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-15 12:18:32,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 12:18:32,108 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:18:32,108 INFO L499 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:18:32,108 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 12:18:32,108 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:18:32,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:18:32,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1905189066, now seen corresponding path program 3 times [2022-04-15 12:18:32,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:32,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [309336243] [2022-04-15 12:18:32,314 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:18:32,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1749097097, now seen corresponding path program 1 times [2022-04-15 12:18:32,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:32,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066600481] [2022-04-15 12:18:32,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:32,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:32,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:32,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:18:32,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:32,429 INFO L290 TraceCheckUtils]: 0: Hoare triple {468#(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(18, 2);call #Ultimate.allocInit(12, 3); {461#true} is VALID [2022-04-15 12:18:32,429 INFO L290 TraceCheckUtils]: 1: Hoare triple {461#true} assume true; {461#true} is VALID [2022-04-15 12:18:32,429 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {461#true} {461#true} #34#return; {461#true} is VALID [2022-04-15 12:18:32,430 INFO L272 TraceCheckUtils]: 0: Hoare triple {461#true} call ULTIMATE.init(); {468#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:18:32,430 INFO L290 TraceCheckUtils]: 1: Hoare triple {468#(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(18, 2);call #Ultimate.allocInit(12, 3); {461#true} is VALID [2022-04-15 12:18:32,431 INFO L290 TraceCheckUtils]: 2: Hoare triple {461#true} assume true; {461#true} is VALID [2022-04-15 12:18:32,431 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {461#true} {461#true} #34#return; {461#true} is VALID [2022-04-15 12:18:32,431 INFO L272 TraceCheckUtils]: 4: Hoare triple {461#true} call #t~ret5 := main(); {461#true} is VALID [2022-04-15 12:18:32,431 INFO L290 TraceCheckUtils]: 5: Hoare triple {461#true} ~x~0 := 0;~y~0 := 1; {466#(and (= main_~x~0 0) (= main_~y~0 1))} is VALID [2022-04-15 12:18:32,432 INFO L290 TraceCheckUtils]: 6: Hoare triple {466#(and (= main_~x~0 0) (= main_~y~0 1))} [44] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_In_3 v_main_~y~0_Out_6))) (or (and .cse0 (= v_main_~x~0_In_3 v_main_~x~0_Out_6)) (and (= v_main_~y~0_Out_6 0) (< (mod (+ v_main_~x~0_Out_6 4294967295) 4294967296) 6) (= (mod v_main_~y~0_Out_6 2) 0) .cse0 (<= v_main_~x~0_In_3 v_main_~x~0_Out_6)))) InVars {main_~x~0=v_main_~x~0_In_3, main_~y~0=v_main_~y~0_In_3} OutVars{main_#t~post4=|v_main_#t~post4_Out_6|, main_~y~0=v_main_~y~0_Out_6, main_~x~0=v_main_~x~0_Out_6} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {467#(= main_~x~0 0)} is VALID [2022-04-15 12:18:32,433 INFO L290 TraceCheckUtils]: 7: Hoare triple {467#(= main_~x~0 0)} [43] L16-3_primed-->L16-3: Formula: (not (< (mod v_main_~x~0_4 4294967296) 6)) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[] {462#false} is VALID [2022-04-15 12:18:32,433 INFO L272 TraceCheckUtils]: 8: Hoare triple {462#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 - 4294967296)); {462#false} is VALID [2022-04-15 12:18:32,433 INFO L290 TraceCheckUtils]: 9: Hoare triple {462#false} ~cond := #in~cond; {462#false} is VALID [2022-04-15 12:18:32,433 INFO L290 TraceCheckUtils]: 10: Hoare triple {462#false} assume 0 == ~cond; {462#false} is VALID [2022-04-15 12:18:32,433 INFO L290 TraceCheckUtils]: 11: Hoare triple {462#false} assume !false; {462#false} is VALID [2022-04-15 12:18:32,434 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 12:18:32,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:18:32,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066600481] [2022-04-15 12:18:32,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066600481] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:32,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:32,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:18:32,510 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:18:32,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [309336243] [2022-04-15 12:18:32,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [309336243] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:32,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:32,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 12:18:32,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078647212] [2022-04-15 12:18:32,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:18:32,511 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 12:18:32,511 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:18:32,512 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:32,523 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:32,523 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 12:18:32,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:32,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 12:18:32,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-15 12:18:32,524 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:32,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:32,672 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-15 12:18:32,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 12:18:32,672 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 12:18:32,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:18:32,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:32,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2022-04-15 12:18:32,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:32,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2022-04-15 12:18:32,675 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 21 transitions. [2022-04-15 12:18:32,695 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:32,696 INFO L225 Difference]: With dead ends: 21 [2022-04-15 12:18:32,696 INFO L226 Difference]: Without dead ends: 16 [2022-04-15 12:18:32,696 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-04-15 12:18:32,697 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:18:32,697 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 33 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:18:32,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-15 12:18:32,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-15 12:18:32,700 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:18:32,701 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:32,701 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:32,701 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:32,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:32,702 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-15 12:18:32,702 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-15 12:18:32,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:32,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:32,703 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-15 12:18:32,703 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-15 12:18:32,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:32,704 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-15 12:18:32,704 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-15 12:18:32,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:32,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:32,705 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:18:32,705 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:18:32,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:32,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2022-04-15 12:18:32,706 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2022-04-15 12:18:32,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:18:32,706 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2022-04-15 12:18:32,706 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:32,707 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 16 transitions. [2022-04-15 12:18:32,721 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:32,722 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-15 12:18:32,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 12:18:32,722 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:18:32,722 INFO L499 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:18:32,723 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 12:18:32,723 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:18:32,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:18:32,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1105142364, now seen corresponding path program 4 times [2022-04-15 12:18:32,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:32,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2072475541] [2022-04-15 12:18:32,915 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:18:32,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1689991753, now seen corresponding path program 1 times [2022-04-15 12:18:32,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:32,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208478396] [2022-04-15 12:18:32,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:32,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:32,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:32,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:18:32,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:32,989 INFO L290 TraceCheckUtils]: 0: Hoare triple {595#(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(18, 2);call #Ultimate.allocInit(12, 3); {588#true} is VALID [2022-04-15 12:18:32,990 INFO L290 TraceCheckUtils]: 1: Hoare triple {588#true} assume true; {588#true} is VALID [2022-04-15 12:18:32,990 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {588#true} {588#true} #34#return; {588#true} is VALID [2022-04-15 12:18:32,991 INFO L272 TraceCheckUtils]: 0: Hoare triple {588#true} call ULTIMATE.init(); {595#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:18:32,991 INFO L290 TraceCheckUtils]: 1: Hoare triple {595#(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(18, 2);call #Ultimate.allocInit(12, 3); {588#true} is VALID [2022-04-15 12:18:32,991 INFO L290 TraceCheckUtils]: 2: Hoare triple {588#true} assume true; {588#true} is VALID [2022-04-15 12:18:32,991 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {588#true} {588#true} #34#return; {588#true} is VALID [2022-04-15 12:18:32,991 INFO L272 TraceCheckUtils]: 4: Hoare triple {588#true} call #t~ret5 := main(); {588#true} is VALID [2022-04-15 12:18:32,992 INFO L290 TraceCheckUtils]: 5: Hoare triple {588#true} ~x~0 := 0;~y~0 := 1; {593#(and (= main_~x~0 0) (= main_~y~0 1))} is VALID [2022-04-15 12:18:32,993 INFO L290 TraceCheckUtils]: 6: Hoare triple {593#(and (= main_~x~0 0) (= main_~y~0 1))} [46] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_In_4 v_main_~y~0_Out_8))) (or (and .cse0 (= v_main_~x~0_In_4 v_main_~x~0_Out_8)) (and (= (mod v_main_~y~0_Out_8 2) 0) .cse0 (< (mod (+ v_main_~x~0_Out_8 4294967295) 4294967296) 6) (= v_main_~y~0_Out_8 0) (<= v_main_~x~0_In_4 v_main_~x~0_Out_8)))) InVars {main_~x~0=v_main_~x~0_In_4, main_~y~0=v_main_~y~0_In_4} OutVars{main_#t~post4=|v_main_#t~post4_Out_8|, main_~y~0=v_main_~y~0_Out_8, main_~x~0=v_main_~x~0_Out_8} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {594#(= main_~x~0 0)} is VALID [2022-04-15 12:18:32,993 INFO L290 TraceCheckUtils]: 7: Hoare triple {594#(= main_~x~0 0)} [45] L16-3_primed-->L16-3: Formula: (not (< (mod v_main_~x~0_4 4294967296) 6)) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[] {589#false} is VALID [2022-04-15 12:18:32,993 INFO L272 TraceCheckUtils]: 8: Hoare triple {589#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 - 4294967296)); {589#false} is VALID [2022-04-15 12:18:32,994 INFO L290 TraceCheckUtils]: 9: Hoare triple {589#false} ~cond := #in~cond; {589#false} is VALID [2022-04-15 12:18:32,994 INFO L290 TraceCheckUtils]: 10: Hoare triple {589#false} assume 0 == ~cond; {589#false} is VALID [2022-04-15 12:18:32,994 INFO L290 TraceCheckUtils]: 11: Hoare triple {589#false} assume !false; {589#false} is VALID [2022-04-15 12:18:32,994 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 12:18:32,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:18:32,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208478396] [2022-04-15 12:18:32,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208478396] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:32,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:32,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:18:33,064 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:18:33,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2072475541] [2022-04-15 12:18:33,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2072475541] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:33,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:33,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:18:33,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208241105] [2022-04-15 12:18:33,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:18:33,065 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 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 12:18:33,066 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:18:33,066 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 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 12:18:33,079 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 12:18:33,079 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 12:18:33,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:33,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 12:18:33,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-04-15 12:18:33,080 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 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 12:18:33,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:33,281 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-15 12:18:33,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 12:18:33,282 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 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 12:18:33,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:18:33,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 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 12:18:33,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2022-04-15 12:18:33,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 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 12:18:33,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2022-04-15 12:18:33,286 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 22 transitions. [2022-04-15 12:18:33,303 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:33,304 INFO L225 Difference]: With dead ends: 22 [2022-04-15 12:18:33,304 INFO L226 Difference]: Without dead ends: 17 [2022-04-15 12:18:33,305 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-04-15 12:18:33,305 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:18:33,306 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 38 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:18:33,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-15 12:18:33,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-15 12:18:33,311 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:18:33,311 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:33,311 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:33,311 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:33,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:33,313 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-15 12:18:33,313 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-15 12:18:33,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:33,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:33,314 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-15 12:18:33,314 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-15 12:18:33,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:33,317 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-15 12:18:33,317 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-15 12:18:33,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:33,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:33,319 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:18:33,319 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:18:33,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:33,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2022-04-15 12:18:33,320 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2022-04-15 12:18:33,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:18:33,321 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2022-04-15 12:18:33,321 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 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 12:18:33,321 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 17 transitions. [2022-04-15 12:18:33,335 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 12:18:33,335 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-15 12:18:33,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-15 12:18:33,340 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:18:33,340 INFO L499 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:18:33,340 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 12:18:33,340 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:18:33,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:18:33,340 INFO L85 PathProgramCache]: Analyzing trace with hash -63863818, now seen corresponding path program 5 times [2022-04-15 12:18:33,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:33,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [216960505] [2022-04-15 12:18:33,498 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:18:33,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1630886409, now seen corresponding path program 1 times [2022-04-15 12:18:33,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:33,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461887228] [2022-04-15 12:18:33,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:33,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:33,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:33,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:18:33,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:33,561 INFO L290 TraceCheckUtils]: 0: Hoare triple {731#(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(18, 2);call #Ultimate.allocInit(12, 3); {724#true} is VALID [2022-04-15 12:18:33,562 INFO L290 TraceCheckUtils]: 1: Hoare triple {724#true} assume true; {724#true} is VALID [2022-04-15 12:18:33,562 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {724#true} {724#true} #34#return; {724#true} is VALID [2022-04-15 12:18:33,563 INFO L272 TraceCheckUtils]: 0: Hoare triple {724#true} call ULTIMATE.init(); {731#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:18:33,563 INFO L290 TraceCheckUtils]: 1: Hoare triple {731#(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(18, 2);call #Ultimate.allocInit(12, 3); {724#true} is VALID [2022-04-15 12:18:33,563 INFO L290 TraceCheckUtils]: 2: Hoare triple {724#true} assume true; {724#true} is VALID [2022-04-15 12:18:33,563 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {724#true} {724#true} #34#return; {724#true} is VALID [2022-04-15 12:18:33,563 INFO L272 TraceCheckUtils]: 4: Hoare triple {724#true} call #t~ret5 := main(); {724#true} is VALID [2022-04-15 12:18:33,564 INFO L290 TraceCheckUtils]: 5: Hoare triple {724#true} ~x~0 := 0;~y~0 := 1; {729#(and (= main_~x~0 0) (= main_~y~0 1))} is VALID [2022-04-15 12:18:33,565 INFO L290 TraceCheckUtils]: 6: Hoare triple {729#(and (= main_~x~0 0) (= main_~y~0 1))} [48] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_Out_10 0) (= v_main_~y~0_Out_10 v_main_~y~0_In_5) (<= v_main_~x~0_In_5 v_main_~x~0_Out_10) (< (mod (+ 4294967295 v_main_~x~0_Out_10) 4294967296) 6) (= 0 (mod v_main_~y~0_Out_10 2))) (and (= v_main_~y~0_In_5 v_main_~y~0_Out_10) (= v_main_~x~0_In_5 v_main_~x~0_Out_10))) InVars {main_~x~0=v_main_~x~0_In_5, main_~y~0=v_main_~y~0_In_5} OutVars{main_#t~post4=|v_main_#t~post4_Out_10|, main_~y~0=v_main_~y~0_Out_10, main_~x~0=v_main_~x~0_Out_10} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {730#(and (<= main_~x~0 0) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:18:33,565 INFO L290 TraceCheckUtils]: 7: Hoare triple {730#(and (<= main_~x~0 0) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} [47] L16-3_primed-->L16-3: Formula: (not (< (mod v_main_~x~0_4 4294967296) 6)) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[] {725#false} is VALID [2022-04-15 12:18:33,566 INFO L272 TraceCheckUtils]: 8: Hoare triple {725#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 - 4294967296)); {725#false} is VALID [2022-04-15 12:18:33,566 INFO L290 TraceCheckUtils]: 9: Hoare triple {725#false} ~cond := #in~cond; {725#false} is VALID [2022-04-15 12:18:33,566 INFO L290 TraceCheckUtils]: 10: Hoare triple {725#false} assume 0 == ~cond; {725#false} is VALID [2022-04-15 12:18:33,566 INFO L290 TraceCheckUtils]: 11: Hoare triple {725#false} assume !false; {725#false} is VALID [2022-04-15 12:18:33,566 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 12:18:33,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:18:33,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461887228] [2022-04-15 12:18:33,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461887228] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:33,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:33,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:18:33,662 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:18:33,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [216960505] [2022-04-15 12:18:33,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [216960505] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:33,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:33,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 12:18:33,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748748666] [2022-04-15 12:18:33,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:18:33,663 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 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 16 [2022-04-15 12:18:33,663 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:18:33,663 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 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 12:18:33,677 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:33,677 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 12:18:33,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:33,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 12:18:33,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-04-15 12:18:33,678 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 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 12:18:33,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:33,903 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-15 12:18:33,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 12:18:33,903 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 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 16 [2022-04-15 12:18:33,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:18:33,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 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 12:18:33,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 23 transitions. [2022-04-15 12:18:33,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 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 12:18:33,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 23 transitions. [2022-04-15 12:18:33,906 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 23 transitions. [2022-04-15 12:18:33,926 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:33,927 INFO L225 Difference]: With dead ends: 23 [2022-04-15 12:18:33,927 INFO L226 Difference]: Without dead ends: 18 [2022-04-15 12:18:33,928 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-04-15 12:18:33,928 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:18:33,928 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 43 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:18:33,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-15 12:18:33,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-15 12:18:33,931 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:18:33,931 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:33,931 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:33,931 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:33,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:33,932 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-15 12:18:33,932 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-15 12:18:33,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:33,932 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:33,932 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-15 12:18:33,933 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-15 12:18:33,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:33,933 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-15 12:18:33,934 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-15 12:18:33,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:33,934 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:33,934 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:18:33,934 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:18:33,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:33,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2022-04-15 12:18:33,935 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2022-04-15 12:18:33,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:18:33,935 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2022-04-15 12:18:33,935 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 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 12:18:33,935 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 18 transitions. [2022-04-15 12:18:33,953 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:33,953 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-15 12:18:33,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 12:18:33,953 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:18:33,954 INFO L499 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:18:33,954 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-15 12:18:33,954 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:18:33,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:18:33,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1943317092, now seen corresponding path program 6 times [2022-04-15 12:18:33,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:33,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1189491857] [2022-04-15 12:18:34,135 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:18:34,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1571781065, now seen corresponding path program 1 times [2022-04-15 12:18:34,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:34,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896099168] [2022-04-15 12:18:34,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:34,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:34,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:34,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:18:34,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:34,220 INFO L290 TraceCheckUtils]: 0: Hoare triple {876#(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(18, 2);call #Ultimate.allocInit(12, 3); {869#true} is VALID [2022-04-15 12:18:34,221 INFO L290 TraceCheckUtils]: 1: Hoare triple {869#true} assume true; {869#true} is VALID [2022-04-15 12:18:34,221 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {869#true} {869#true} #34#return; {869#true} is VALID [2022-04-15 12:18:34,221 INFO L272 TraceCheckUtils]: 0: Hoare triple {869#true} call ULTIMATE.init(); {876#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:18:34,221 INFO L290 TraceCheckUtils]: 1: Hoare triple {876#(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(18, 2);call #Ultimate.allocInit(12, 3); {869#true} is VALID [2022-04-15 12:18:34,222 INFO L290 TraceCheckUtils]: 2: Hoare triple {869#true} assume true; {869#true} is VALID [2022-04-15 12:18:34,222 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {869#true} {869#true} #34#return; {869#true} is VALID [2022-04-15 12:18:34,222 INFO L272 TraceCheckUtils]: 4: Hoare triple {869#true} call #t~ret5 := main(); {869#true} is VALID [2022-04-15 12:18:34,224 INFO L290 TraceCheckUtils]: 5: Hoare triple {869#true} ~x~0 := 0;~y~0 := 1; {874#(and (= main_~x~0 0) (= main_~y~0 1))} is VALID [2022-04-15 12:18:34,225 INFO L290 TraceCheckUtils]: 6: Hoare triple {874#(and (= main_~x~0 0) (= main_~y~0 1))} [50] L16-2-->L16-3_primed: Formula: (or (and (<= v_main_~x~0_In_6 v_main_~x~0_Out_12) (= v_main_~y~0_Out_12 v_main_~y~0_In_6) (< (mod (+ 4294967295 v_main_~x~0_Out_12) 4294967296) 6) (= v_main_~y~0_Out_12 0) (= (mod v_main_~y~0_Out_12 2) 0)) (and (= v_main_~x~0_In_6 v_main_~x~0_Out_12) (= v_main_~y~0_In_6 v_main_~y~0_Out_12))) InVars {main_~x~0=v_main_~x~0_In_6, main_~y~0=v_main_~y~0_In_6} OutVars{main_#t~post4=|v_main_#t~post4_Out_12|, main_~y~0=v_main_~y~0_Out_12, main_~x~0=v_main_~x~0_Out_12} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {875#(and (<= main_~x~0 0) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:18:34,226 INFO L290 TraceCheckUtils]: 7: Hoare triple {875#(and (<= main_~x~0 0) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} [49] L16-3_primed-->L16-3: Formula: (not (< (mod v_main_~x~0_4 4294967296) 6)) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[] {870#false} is VALID [2022-04-15 12:18:34,227 INFO L272 TraceCheckUtils]: 8: Hoare triple {870#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 - 4294967296)); {870#false} is VALID [2022-04-15 12:18:34,227 INFO L290 TraceCheckUtils]: 9: Hoare triple {870#false} ~cond := #in~cond; {870#false} is VALID [2022-04-15 12:18:34,235 INFO L290 TraceCheckUtils]: 10: Hoare triple {870#false} assume 0 == ~cond; {870#false} is VALID [2022-04-15 12:18:34,236 INFO L290 TraceCheckUtils]: 11: Hoare triple {870#false} assume !false; {870#false} is VALID [2022-04-15 12:18:34,236 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 12:18:34,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:18:34,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896099168] [2022-04-15 12:18:34,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896099168] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:34,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:34,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:18:34,373 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:18:34,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1189491857] [2022-04-15 12:18:34,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1189491857] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:34,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:34,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 12:18:34,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317516149] [2022-04-15 12:18:34,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:18:34,374 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 10 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 12:18:34,375 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:18:34,376 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 10 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 12:18:34,396 WARN L143 InductivityCheck]: Transition 882#(and (= 64 main_~y~0) (= main_~x~0 6)) ( _ , call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 3 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 - 4294967296)); , 883#(and (= main_~x~0 6) (= |__VERIFIER_assert_#in~cond| 1)) ) not inductive [2022-04-15 12:18:34,397 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-15 12:18:34,397 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: inductivity failed at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.checkInductivity(InductivityCheck.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.(InductivityCheck.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.constructInterpolantAutomaton(BasicCegarLoop.java:682) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.constructRefinementAutomaton(AbstractCegarLoop.java:547) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:411) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:261) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-15 12:18:34,404 INFO L158 Benchmark]: Toolchain (without parser) took 7301.27ms. Allocated memory was 185.6MB in the beginning and 233.8MB in the end (delta: 48.2MB). Free memory was 134.3MB in the beginning and 122.0MB in the end (delta: 12.4MB). Peak memory consumption was 60.5MB. Max. memory is 8.0GB. [2022-04-15 12:18:34,404 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 185.6MB. Free memory was 151.1MB in the beginning and 151.0MB in the end (delta: 69.6kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 12:18:34,405 INFO L158 Benchmark]: CACSL2BoogieTranslator took 276.53ms. Allocated memory was 185.6MB in the beginning and 233.8MB in the end (delta: 48.2MB). Free memory was 134.1MB in the beginning and 211.0MB in the end (delta: -76.9MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-15 12:18:34,405 INFO L158 Benchmark]: Boogie Preprocessor took 34.53ms. Allocated memory is still 233.8MB. Free memory was 211.0MB in the beginning and 209.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 12:18:34,405 INFO L158 Benchmark]: RCFGBuilder took 244.87ms. Allocated memory is still 233.8MB. Free memory was 209.6MB in the beginning and 199.1MB in the end (delta: 10.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 12:18:34,405 INFO L158 Benchmark]: TraceAbstraction took 6740.28ms. Allocated memory is still 233.8MB. Free memory was 198.4MB in the beginning and 122.3MB in the end (delta: 76.1MB). Peak memory consumption was 77.1MB. Max. memory is 8.0GB. [2022-04-15 12:18:34,406 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.12ms. Allocated memory is still 185.6MB. Free memory was 151.1MB in the beginning and 151.0MB in the end (delta: 69.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 276.53ms. Allocated memory was 185.6MB in the beginning and 233.8MB in the end (delta: 48.2MB). Free memory was 134.1MB in the beginning and 211.0MB in the end (delta: -76.9MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.53ms. Allocated memory is still 233.8MB. Free memory was 211.0MB in the beginning and 209.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 244.87ms. Allocated memory is still 233.8MB. Free memory was 209.6MB in the beginning and 199.1MB in the end (delta: 10.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 6740.28ms. Allocated memory is still 233.8MB. Free memory was 198.4MB in the beginning and 122.3MB in the end (delta: 76.1MB). Peak memory consumption was 77.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: inductivity failed de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: inductivity failed: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-15 12:18:34,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...