/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-simple/deep-nested.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 13:13:54,063 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 13:13:54,065 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 13:13:54,116 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 13:13:54,117 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 13:13:54,117 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 13:13:54,119 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 13:13:54,127 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 13:13:54,128 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 13:13:54,129 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 13:13:54,129 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 13:13:54,130 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 13:13:54,130 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 13:13:54,131 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 13:13:54,131 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 13:13:54,132 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 13:13:54,132 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 13:13:54,133 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 13:13:54,134 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 13:13:54,135 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 13:13:54,135 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 13:13:54,137 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 13:13:54,138 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 13:13:54,139 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 13:13:54,140 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 13:13:54,145 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 13:13:54,145 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 13:13:54,146 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 13:13:54,146 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 13:13:54,146 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 13:13:54,148 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 13:13:54,148 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 13:13:54,149 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 13:13:54,149 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 13:13:54,150 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 13:13:54,150 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 13:13:54,151 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 13:13:54,151 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 13:13:54,151 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 13:13:54,151 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 13:13:54,152 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 13:13:54,154 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 13:13:54,154 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 13:13:54,161 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 13:13:54,161 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 13:13:54,162 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 13:13:54,162 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 13:13:54,163 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 13:13:54,163 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 13:13:54,163 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 13:13:54,163 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 13:13:54,163 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 13:13:54,164 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 13:13:54,164 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 13:13:54,164 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 13:13:54,164 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 13:13:54,164 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 13:13:54,164 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 13:13:54,164 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 13:13:54,165 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 13:13:54,165 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 13:13:54,165 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 13:13:54,165 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 13:13:54,165 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 13:13:54,165 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 13:13:54,165 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 13:13:54,361 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 13:13:54,399 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 13:13:54,401 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 13:13:54,402 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 13:13:54,402 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 13:13:54,403 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-simple/deep-nested.c [2022-04-15 13:13:54,448 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4870644a6/ed4c0ebe86164aa6864241f8c3bbb236/FLAG60c0902bd [2022-04-15 13:13:54,818 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 13:13:54,818 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-simple/deep-nested.c [2022-04-15 13:13:54,822 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4870644a6/ed4c0ebe86164aa6864241f8c3bbb236/FLAG60c0902bd [2022-04-15 13:13:54,835 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4870644a6/ed4c0ebe86164aa6864241f8c3bbb236 [2022-04-15 13:13:54,837 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 13:13:54,839 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 13:13:54,839 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 13:13:54,840 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 13:13:54,842 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 13:13:54,843 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:13:54" (1/1) ... [2022-04-15 13:13:54,844 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f09cd89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:13:54, skipping insertion in model container [2022-04-15 13:13:54,844 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:13:54" (1/1) ... [2022-04-15 13:13:54,849 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 13:13:54,858 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 13:13:55,031 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-simple/deep-nested.c[625,638] [2022-04-15 13:13:55,035 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 13:13:55,044 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 13:13:55,063 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-simple/deep-nested.c[625,638] [2022-04-15 13:13:55,068 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 13:13:55,078 INFO L208 MainTranslator]: Completed translation [2022-04-15 13:13:55,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:13:55 WrapperNode [2022-04-15 13:13:55,078 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 13:13:55,079 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 13:13:55,079 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 13:13:55,080 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 13:13:55,087 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:13:55" (1/1) ... [2022-04-15 13:13:55,087 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:13:55" (1/1) ... [2022-04-15 13:13:55,092 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:13:55" (1/1) ... [2022-04-15 13:13:55,092 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:13:55" (1/1) ... [2022-04-15 13:13:55,104 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:13:55" (1/1) ... [2022-04-15 13:13:55,111 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:13:55" (1/1) ... [2022-04-15 13:13:55,116 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:13:55" (1/1) ... [2022-04-15 13:13:55,118 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 13:13:55,119 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 13:13:55,119 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 13:13:55,119 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 13:13:55,120 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:13:55" (1/1) ... [2022-04-15 13:13:55,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 13:13:55,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:13:55,141 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 13:13:55,147 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 13:13:55,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 13:13:55,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 13:13:55,173 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 13:13:55,174 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 13:13:55,174 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 13:13:55,174 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 13:13:55,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 13:13:55,174 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 13:13:55,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 13:13:55,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 13:13:55,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 13:13:55,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 13:13:55,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 13:13:55,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 13:13:55,218 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 13:13:55,220 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 13:13:55,319 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 13:13:55,323 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 13:13:55,323 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-04-15 13:13:55,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:13:55 BoogieIcfgContainer [2022-04-15 13:13:55,333 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 13:13:55,334 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 13:13:55,334 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 13:13:55,349 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 13:13:55,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 01:13:54" (1/3) ... [2022-04-15 13:13:55,350 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8dfe1d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:13:55, skipping insertion in model container [2022-04-15 13:13:55,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:13:55" (2/3) ... [2022-04-15 13:13:55,350 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8dfe1d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:13:55, skipping insertion in model container [2022-04-15 13:13:55,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:13:55" (3/3) ... [2022-04-15 13:13:55,351 INFO L111 eAbstractionObserver]: Analyzing ICFG deep-nested.c [2022-04-15 13:13:55,354 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 13:13:55,359 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 13:13:55,408 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 13:13:55,429 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 13:13:55,430 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 13:13:55,441 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 19 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:13:55,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-15 13:13:55,454 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:13:55,455 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:13:55,455 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:13:55,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:13:55,459 INFO L85 PathProgramCache]: Analyzing trace with hash 764687304, now seen corresponding path program 1 times [2022-04-15 13:13:55,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:13:55,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [476666651] [2022-04-15 13:13:55,472 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:13:55,473 INFO L85 PathProgramCache]: Analyzing trace with hash 764687304, now seen corresponding path program 2 times [2022-04-15 13:13:55,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:13:55,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720350600] [2022-04-15 13:13:55,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:13:55,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:13:55,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:13:55,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:13:55,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:13:55,808 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#(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(14, 2);call #Ultimate.allocInit(12, 3); {27#true} is VALID [2022-04-15 13:13:55,809 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-15 13:13:55,809 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27#true} {27#true} #79#return; {27#true} is VALID [2022-04-15 13:13:55,811 INFO L272 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {34#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:13:55,811 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#(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(14, 2);call #Ultimate.allocInit(12, 3); {27#true} is VALID [2022-04-15 13:13:55,811 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-15 13:13:55,811 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #79#return; {27#true} is VALID [2022-04-15 13:13:55,811 INFO L272 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret9 := main(); {27#true} is VALID [2022-04-15 13:13:55,812 INFO L290 TraceCheckUtils]: 5: Hoare triple {27#true} havoc ~a~0;havoc ~b~0;havoc ~c~0;havoc ~d~0;havoc ~e~0;havoc ~uint32_max~0;~uint32_max~0 := 4294967295;~a~0 := 0; {32#(and (<= 4294967295 main_~uint32_max~0) (<= main_~uint32_max~0 4294967295))} is VALID [2022-04-15 13:13:55,813 INFO L290 TraceCheckUtils]: 6: Hoare triple {32#(and (<= 4294967295 main_~uint32_max~0) (<= main_~uint32_max~0 4294967295))} assume !!(~a~0 % 4294967296 < (~uint32_max~0 - 1) % 4294967296);~b~0 := 0; {32#(and (<= 4294967295 main_~uint32_max~0) (<= main_~uint32_max~0 4294967295))} is VALID [2022-04-15 13:13:55,814 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#(and (<= 4294967295 main_~uint32_max~0) (<= main_~uint32_max~0 4294967295))} assume !!(~b~0 % 4294967296 < (~uint32_max~0 - 1) % 4294967296);~c~0 := 0; {32#(and (<= 4294967295 main_~uint32_max~0) (<= main_~uint32_max~0 4294967295))} is VALID [2022-04-15 13:13:55,816 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#(and (<= 4294967295 main_~uint32_max~0) (<= main_~uint32_max~0 4294967295))} assume !!(~c~0 % 4294967296 < (~uint32_max~0 - 1) % 4294967296);~d~0 := 0; {32#(and (<= 4294967295 main_~uint32_max~0) (<= main_~uint32_max~0 4294967295))} is VALID [2022-04-15 13:13:55,817 INFO L290 TraceCheckUtils]: 9: Hoare triple {32#(and (<= 4294967295 main_~uint32_max~0) (<= main_~uint32_max~0 4294967295))} assume !!(~d~0 % 4294967296 < (~uint32_max~0 - 1) % 4294967296);~e~0 := 0; {33#(and (<= 4294967295 main_~uint32_max~0) (not (<= (+ 2 (div main_~e~0 4294967296)) (div (+ 4294967294 main_~uint32_max~0) 4294967296))) (= main_~e~0 0))} is VALID [2022-04-15 13:13:55,818 INFO L290 TraceCheckUtils]: 10: Hoare triple {33#(and (<= 4294967295 main_~uint32_max~0) (not (<= (+ 2 (div main_~e~0 4294967296)) (div (+ 4294967294 main_~uint32_max~0) 4294967296))) (= main_~e~0 0))} assume !!(~e~0 % 4294967296 < (~uint32_max~0 - 1) % 4294967296); {33#(and (<= 4294967295 main_~uint32_max~0) (not (<= (+ 2 (div main_~e~0 4294967296)) (div (+ 4294967294 main_~uint32_max~0) 4294967296))) (= main_~e~0 0))} is VALID [2022-04-15 13:13:55,820 INFO L290 TraceCheckUtils]: 11: Hoare triple {33#(and (<= 4294967295 main_~uint32_max~0) (not (<= (+ 2 (div main_~e~0 4294967296)) (div (+ 4294967294 main_~uint32_max~0) 4294967296))) (= main_~e~0 0))} assume (((~a~0 % 4294967296 == ~b~0 % 4294967296 && ~b~0 % 4294967296 == ~c~0 % 4294967296) && ~c~0 % 4294967296 == ~d~0 % 4294967296) && ~d~0 % 4294967296 == ~e~0 % 4294967296) && ~e~0 % 4294967296 == (~uint32_max~0 - 2) % 4294967296; {28#false} is VALID [2022-04-15 13:13:55,820 INFO L290 TraceCheckUtils]: 12: Hoare triple {28#false} assume !false; {28#false} is VALID [2022-04-15 13:13:55,820 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 13:13:55,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:13:55,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720350600] [2022-04-15 13:13:55,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720350600] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:13:55,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:13:55,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 13:13:55,824 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:13:55,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [476666651] [2022-04-15 13:13:55,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [476666651] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:13:55,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:13:55,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 13:13:55,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343644909] [2022-04-15 13:13:55,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:13:55,829 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 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 13:13:55,831 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:13:55,834 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:55,855 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 13:13:55,855 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 13:13:55,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:13:55,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 13:13:55,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 13:13:55,875 INFO L87 Difference]: Start difference. First operand has 24 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 19 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:56,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:13:56,126 INFO L93 Difference]: Finished difference Result 45 states and 68 transitions. [2022-04-15 13:13:56,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 13:13:56,126 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 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 13:13:56,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:13:56,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:56,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-04-15 13:13:56,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:56,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-04-15 13:13:56,141 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 68 transitions. [2022-04-15 13:13:56,202 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:13:56,207 INFO L225 Difference]: With dead ends: 45 [2022-04-15 13:13:56,207 INFO L226 Difference]: Without dead ends: 22 [2022-04-15 13:13:56,209 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-04-15 13:13:56,211 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 43 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:13:56,212 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 30 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 13:13:56,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-15 13:13:56,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-04-15 13:13:56,249 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:13:56,249 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 21 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:56,250 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 21 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:56,250 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 21 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:56,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:13:56,252 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2022-04-15 13:13:56,252 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-04-15 13:13:56,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:13:56,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:13:56,253 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-15 13:13:56,253 INFO L87 Difference]: Start difference. First operand has 21 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-15 13:13:56,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:13:56,255 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2022-04-15 13:13:56,255 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-04-15 13:13:56,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:13:56,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:13:56,255 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:13:56,255 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:13:56,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:56,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2022-04-15 13:13:56,258 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2022-04-15 13:13:56,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:13:56,258 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2022-04-15 13:13:56,258 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:56,258 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 25 transitions. [2022-04-15 13:13:56,279 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:13:56,279 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-04-15 13:13:56,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-15 13:13:56,280 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:13:56,280 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:13:56,280 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 13:13:56,280 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:13:56,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:13:56,281 INFO L85 PathProgramCache]: Analyzing trace with hash 296825287, now seen corresponding path program 1 times [2022-04-15 13:13:56,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:13:56,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1046703669] [2022-04-15 13:13:56,365 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException [2022-04-15 13:13:56,365 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 13:13:56,365 INFO L85 PathProgramCache]: Analyzing trace with hash 296825287, now seen corresponding path program 2 times [2022-04-15 13:13:56,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:13:56,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406300380] [2022-04-15 13:13:56,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:13:56,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:13:56,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:13:56,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:13:56,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:13:56,540 INFO L290 TraceCheckUtils]: 0: Hoare triple {223#(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(14, 2);call #Ultimate.allocInit(12, 3); {217#true} is VALID [2022-04-15 13:13:56,540 INFO L290 TraceCheckUtils]: 1: Hoare triple {217#true} assume true; {217#true} is VALID [2022-04-15 13:13:56,541 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {217#true} {217#true} #79#return; {217#true} is VALID [2022-04-15 13:13:56,541 INFO L272 TraceCheckUtils]: 0: Hoare triple {217#true} call ULTIMATE.init(); {223#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:13:56,541 INFO L290 TraceCheckUtils]: 1: Hoare triple {223#(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(14, 2);call #Ultimate.allocInit(12, 3); {217#true} is VALID [2022-04-15 13:13:56,541 INFO L290 TraceCheckUtils]: 2: Hoare triple {217#true} assume true; {217#true} is VALID [2022-04-15 13:13:56,542 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {217#true} {217#true} #79#return; {217#true} is VALID [2022-04-15 13:13:56,542 INFO L272 TraceCheckUtils]: 4: Hoare triple {217#true} call #t~ret9 := main(); {217#true} is VALID [2022-04-15 13:13:56,542 INFO L290 TraceCheckUtils]: 5: Hoare triple {217#true} havoc ~a~0;havoc ~b~0;havoc ~c~0;havoc ~d~0;havoc ~e~0;havoc ~uint32_max~0;~uint32_max~0 := 4294967295;~a~0 := 0; {222#(and (= main_~a~0 0) (<= 4294967295 main_~uint32_max~0) (<= (div (+ 4294967295 main_~uint32_max~0) 4294967296) (+ (div main_~a~0 4294967296) 1)))} is VALID [2022-04-15 13:13:56,543 INFO L290 TraceCheckUtils]: 6: Hoare triple {222#(and (= main_~a~0 0) (<= 4294967295 main_~uint32_max~0) (<= (div (+ 4294967295 main_~uint32_max~0) 4294967296) (+ (div main_~a~0 4294967296) 1)))} assume !!(~a~0 % 4294967296 < (~uint32_max~0 - 1) % 4294967296);~b~0 := 0; {222#(and (= main_~a~0 0) (<= 4294967295 main_~uint32_max~0) (<= (div (+ 4294967295 main_~uint32_max~0) 4294967296) (+ (div main_~a~0 4294967296) 1)))} is VALID [2022-04-15 13:13:56,543 INFO L290 TraceCheckUtils]: 7: Hoare triple {222#(and (= main_~a~0 0) (<= 4294967295 main_~uint32_max~0) (<= (div (+ 4294967295 main_~uint32_max~0) 4294967296) (+ (div main_~a~0 4294967296) 1)))} assume !!(~b~0 % 4294967296 < (~uint32_max~0 - 1) % 4294967296);~c~0 := 0; {222#(and (= main_~a~0 0) (<= 4294967295 main_~uint32_max~0) (<= (div (+ 4294967295 main_~uint32_max~0) 4294967296) (+ (div main_~a~0 4294967296) 1)))} is VALID [2022-04-15 13:13:56,544 INFO L290 TraceCheckUtils]: 8: Hoare triple {222#(and (= main_~a~0 0) (<= 4294967295 main_~uint32_max~0) (<= (div (+ 4294967295 main_~uint32_max~0) 4294967296) (+ (div main_~a~0 4294967296) 1)))} assume !!(~c~0 % 4294967296 < (~uint32_max~0 - 1) % 4294967296);~d~0 := 0; {222#(and (= main_~a~0 0) (<= 4294967295 main_~uint32_max~0) (<= (div (+ 4294967295 main_~uint32_max~0) 4294967296) (+ (div main_~a~0 4294967296) 1)))} is VALID [2022-04-15 13:13:56,545 INFO L290 TraceCheckUtils]: 9: Hoare triple {222#(and (= main_~a~0 0) (<= 4294967295 main_~uint32_max~0) (<= (div (+ 4294967295 main_~uint32_max~0) 4294967296) (+ (div main_~a~0 4294967296) 1)))} assume !!(~d~0 % 4294967296 < (~uint32_max~0 - 1) % 4294967296);~e~0 := 0; {222#(and (= main_~a~0 0) (<= 4294967295 main_~uint32_max~0) (<= (div (+ 4294967295 main_~uint32_max~0) 4294967296) (+ (div main_~a~0 4294967296) 1)))} is VALID [2022-04-15 13:13:56,545 INFO L290 TraceCheckUtils]: 10: Hoare triple {222#(and (= main_~a~0 0) (<= 4294967295 main_~uint32_max~0) (<= (div (+ 4294967295 main_~uint32_max~0) 4294967296) (+ (div main_~a~0 4294967296) 1)))} assume !!(~e~0 % 4294967296 < (~uint32_max~0 - 1) % 4294967296); {222#(and (= main_~a~0 0) (<= 4294967295 main_~uint32_max~0) (<= (div (+ 4294967295 main_~uint32_max~0) 4294967296) (+ (div main_~a~0 4294967296) 1)))} is VALID [2022-04-15 13:13:56,546 INFO L290 TraceCheckUtils]: 11: Hoare triple {222#(and (= main_~a~0 0) (<= 4294967295 main_~uint32_max~0) (<= (div (+ 4294967295 main_~uint32_max~0) 4294967296) (+ (div main_~a~0 4294967296) 1)))} assume !((((~a~0 % 4294967296 == ~b~0 % 4294967296 && ~b~0 % 4294967296 == ~c~0 % 4294967296) && ~c~0 % 4294967296 == ~d~0 % 4294967296) && ~d~0 % 4294967296 == ~e~0 % 4294967296) && ~e~0 % 4294967296 == (~uint32_max~0 - 2) % 4294967296); {222#(and (= main_~a~0 0) (<= 4294967295 main_~uint32_max~0) (<= (div (+ 4294967295 main_~uint32_max~0) 4294967296) (+ (div main_~a~0 4294967296) 1)))} is VALID [2022-04-15 13:13:56,546 INFO L290 TraceCheckUtils]: 12: Hoare triple {222#(and (= main_~a~0 0) (<= 4294967295 main_~uint32_max~0) (<= (div (+ 4294967295 main_~uint32_max~0) 4294967296) (+ (div main_~a~0 4294967296) 1)))} #t~pre8 := 1 + ~e~0;~e~0 := 1 + ~e~0;havoc #t~pre8; {222#(and (= main_~a~0 0) (<= 4294967295 main_~uint32_max~0) (<= (div (+ 4294967295 main_~uint32_max~0) 4294967296) (+ (div main_~a~0 4294967296) 1)))} is VALID [2022-04-15 13:13:56,547 INFO L290 TraceCheckUtils]: 13: Hoare triple {222#(and (= main_~a~0 0) (<= 4294967295 main_~uint32_max~0) (<= (div (+ 4294967295 main_~uint32_max~0) 4294967296) (+ (div main_~a~0 4294967296) 1)))} assume !!(~e~0 % 4294967296 < (~uint32_max~0 - 1) % 4294967296); {222#(and (= main_~a~0 0) (<= 4294967295 main_~uint32_max~0) (<= (div (+ 4294967295 main_~uint32_max~0) 4294967296) (+ (div main_~a~0 4294967296) 1)))} is VALID [2022-04-15 13:13:56,548 INFO L290 TraceCheckUtils]: 14: Hoare triple {222#(and (= main_~a~0 0) (<= 4294967295 main_~uint32_max~0) (<= (div (+ 4294967295 main_~uint32_max~0) 4294967296) (+ (div main_~a~0 4294967296) 1)))} assume (((~a~0 % 4294967296 == ~b~0 % 4294967296 && ~b~0 % 4294967296 == ~c~0 % 4294967296) && ~c~0 % 4294967296 == ~d~0 % 4294967296) && ~d~0 % 4294967296 == ~e~0 % 4294967296) && ~e~0 % 4294967296 == (~uint32_max~0 - 2) % 4294967296; {218#false} is VALID [2022-04-15 13:13:56,548 INFO L290 TraceCheckUtils]: 15: Hoare triple {218#false} assume !false; {218#false} is VALID [2022-04-15 13:13:56,549 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 13:13:56,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:13:56,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406300380] [2022-04-15 13:13:56,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406300380] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:13:56,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:13:56,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:13:56,549 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:13:56,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1046703669] [2022-04-15 13:13:56,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1046703669] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:13:56,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:13:56,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:13:56,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168246629] [2022-04-15 13:13:56,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:13:56,551 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 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 13:13:56,551 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:13:56,551 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:56,564 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 13:13:56,564 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 13:13:56,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:13:56,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 13:13:56,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 13:13:56,565 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:56,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:13:56,700 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2022-04-15 13:13:56,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 13:13:56,701 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 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 13:13:56,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:13:56,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:56,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-04-15 13:13:56,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:56,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-04-15 13:13:56,703 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 40 transitions. [2022-04-15 13:13:56,743 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:13:56,744 INFO L225 Difference]: With dead ends: 36 [2022-04-15 13:13:56,744 INFO L226 Difference]: Without dead ends: 34 [2022-04-15 13:13:56,744 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 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 13:13:56,745 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 39 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:13:56,745 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 19 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:13:56,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-15 13:13:56,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2022-04-15 13:13:56,780 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:13:56,781 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 32 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 28 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:56,781 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 32 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 28 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:56,781 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 32 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 28 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:56,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:13:56,783 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2022-04-15 13:13:56,783 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2022-04-15 13:13:56,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:13:56,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:13:56,783 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 28 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34 states. [2022-04-15 13:13:56,783 INFO L87 Difference]: Start difference. First operand has 32 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 28 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34 states. [2022-04-15 13:13:56,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:13:56,785 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2022-04-15 13:13:56,785 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2022-04-15 13:13:56,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:13:56,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:13:56,785 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:13:56,785 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:13:56,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 28 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:56,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2022-04-15 13:13:56,787 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 16 [2022-04-15 13:13:56,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:13:56,787 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2022-04-15 13:13:56,787 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:56,787 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 40 transitions. [2022-04-15 13:13:56,827 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:13:56,828 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2022-04-15 13:13:56,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 13:13:56,829 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:13:56,829 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:13:56,830 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 13:13:56,830 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:13:56,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:13:56,830 INFO L85 PathProgramCache]: Analyzing trace with hash -17409223, now seen corresponding path program 1 times [2022-04-15 13:13:56,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:13:56,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1405353196] [2022-04-15 13:13:56,943 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:13:56,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1773718599, now seen corresponding path program 1 times [2022-04-15 13:13:56,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:13:56,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703760419] [2022-04-15 13:13:56,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:13:56,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:13:56,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:13:57,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:13:57,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:13:57,144 INFO L290 TraceCheckUtils]: 0: Hoare triple {439#(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(14, 2);call #Ultimate.allocInit(12, 3); {432#true} is VALID [2022-04-15 13:13:57,144 INFO L290 TraceCheckUtils]: 1: Hoare triple {432#true} assume true; {432#true} is VALID [2022-04-15 13:13:57,144 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {432#true} {432#true} #79#return; {432#true} is VALID [2022-04-15 13:13:57,145 INFO L272 TraceCheckUtils]: 0: Hoare triple {432#true} call ULTIMATE.init(); {439#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:13:57,145 INFO L290 TraceCheckUtils]: 1: Hoare triple {439#(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(14, 2);call #Ultimate.allocInit(12, 3); {432#true} is VALID [2022-04-15 13:13:57,145 INFO L290 TraceCheckUtils]: 2: Hoare triple {432#true} assume true; {432#true} is VALID [2022-04-15 13:13:57,145 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {432#true} {432#true} #79#return; {432#true} is VALID [2022-04-15 13:13:57,146 INFO L272 TraceCheckUtils]: 4: Hoare triple {432#true} call #t~ret9 := main(); {432#true} is VALID [2022-04-15 13:13:57,146 INFO L290 TraceCheckUtils]: 5: Hoare triple {432#true} havoc ~a~0;havoc ~b~0;havoc ~c~0;havoc ~d~0;havoc ~e~0;havoc ~uint32_max~0;~uint32_max~0 := 4294967295;~a~0 := 0; {437#(and (<= 4294967295 main_~uint32_max~0) (<= main_~uint32_max~0 4294967295))} is VALID [2022-04-15 13:13:57,147 INFO L290 TraceCheckUtils]: 6: Hoare triple {437#(and (<= 4294967295 main_~uint32_max~0) (<= main_~uint32_max~0 4294967295))} [83] L10-3-->L11-3_primed: Formula: true InVars {} OutVars{main_~b~0=v_main_~b~0_Out_2, main_#t~pre4=|v_main_#t~pre4_Out_2|, main_~a~0=v_main_~a~0_Out_2} AuxVars[] AssignedVars[main_~b~0, main_#t~pre4, main_~a~0] {437#(and (<= 4294967295 main_~uint32_max~0) (<= main_~uint32_max~0 4294967295))} is VALID [2022-04-15 13:13:57,149 INFO L290 TraceCheckUtils]: 7: Hoare triple {437#(and (<= 4294967295 main_~uint32_max~0) (<= main_~uint32_max~0 4294967295))} [82] L11-3_primed-->L11-3: Formula: (and (< (mod v_main_~a~0_7 4294967296) (mod (+ v_main_~uint32_max~0_5 4294967295) 4294967296)) (= v_main_~b~0_4 0)) InVars {main_~uint32_max~0=v_main_~uint32_max~0_5, main_~a~0=v_main_~a~0_7} OutVars{main_~uint32_max~0=v_main_~uint32_max~0_5, main_~b~0=v_main_~b~0_4, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~b~0] {438#(and (<= (div (+ 4294967295 main_~uint32_max~0) 4294967296) (+ (div main_~b~0 4294967296) 1)) (= main_~b~0 0) (<= 4294967295 main_~uint32_max~0))} is VALID [2022-04-15 13:13:57,150 INFO L290 TraceCheckUtils]: 8: Hoare triple {438#(and (<= (div (+ 4294967295 main_~uint32_max~0) 4294967296) (+ (div main_~b~0 4294967296) 1)) (= main_~b~0 0) (<= 4294967295 main_~uint32_max~0))} assume !!(~b~0 % 4294967296 < (~uint32_max~0 - 1) % 4294967296);~c~0 := 0; {438#(and (<= (div (+ 4294967295 main_~uint32_max~0) 4294967296) (+ (div main_~b~0 4294967296) 1)) (= main_~b~0 0) (<= 4294967295 main_~uint32_max~0))} is VALID [2022-04-15 13:13:57,153 INFO L290 TraceCheckUtils]: 9: Hoare triple {438#(and (<= (div (+ 4294967295 main_~uint32_max~0) 4294967296) (+ (div main_~b~0 4294967296) 1)) (= main_~b~0 0) (<= 4294967295 main_~uint32_max~0))} assume !!(~c~0 % 4294967296 < (~uint32_max~0 - 1) % 4294967296);~d~0 := 0; {438#(and (<= (div (+ 4294967295 main_~uint32_max~0) 4294967296) (+ (div main_~b~0 4294967296) 1)) (= main_~b~0 0) (<= 4294967295 main_~uint32_max~0))} is VALID [2022-04-15 13:13:57,154 INFO L290 TraceCheckUtils]: 10: Hoare triple {438#(and (<= (div (+ 4294967295 main_~uint32_max~0) 4294967296) (+ (div main_~b~0 4294967296) 1)) (= main_~b~0 0) (<= 4294967295 main_~uint32_max~0))} assume !!(~d~0 % 4294967296 < (~uint32_max~0 - 1) % 4294967296);~e~0 := 0; {438#(and (<= (div (+ 4294967295 main_~uint32_max~0) 4294967296) (+ (div main_~b~0 4294967296) 1)) (= main_~b~0 0) (<= 4294967295 main_~uint32_max~0))} is VALID [2022-04-15 13:13:57,155 INFO L290 TraceCheckUtils]: 11: Hoare triple {438#(and (<= (div (+ 4294967295 main_~uint32_max~0) 4294967296) (+ (div main_~b~0 4294967296) 1)) (= main_~b~0 0) (<= 4294967295 main_~uint32_max~0))} assume !!(~e~0 % 4294967296 < (~uint32_max~0 - 1) % 4294967296); {438#(and (<= (div (+ 4294967295 main_~uint32_max~0) 4294967296) (+ (div main_~b~0 4294967296) 1)) (= main_~b~0 0) (<= 4294967295 main_~uint32_max~0))} is VALID [2022-04-15 13:13:57,155 INFO L290 TraceCheckUtils]: 12: Hoare triple {438#(and (<= (div (+ 4294967295 main_~uint32_max~0) 4294967296) (+ (div main_~b~0 4294967296) 1)) (= main_~b~0 0) (<= 4294967295 main_~uint32_max~0))} assume !((((~a~0 % 4294967296 == ~b~0 % 4294967296 && ~b~0 % 4294967296 == ~c~0 % 4294967296) && ~c~0 % 4294967296 == ~d~0 % 4294967296) && ~d~0 % 4294967296 == ~e~0 % 4294967296) && ~e~0 % 4294967296 == (~uint32_max~0 - 2) % 4294967296); {438#(and (<= (div (+ 4294967295 main_~uint32_max~0) 4294967296) (+ (div main_~b~0 4294967296) 1)) (= main_~b~0 0) (<= 4294967295 main_~uint32_max~0))} is VALID [2022-04-15 13:13:57,156 INFO L290 TraceCheckUtils]: 13: Hoare triple {438#(and (<= (div (+ 4294967295 main_~uint32_max~0) 4294967296) (+ (div main_~b~0 4294967296) 1)) (= main_~b~0 0) (<= 4294967295 main_~uint32_max~0))} #t~pre8 := 1 + ~e~0;~e~0 := 1 + ~e~0;havoc #t~pre8; {438#(and (<= (div (+ 4294967295 main_~uint32_max~0) 4294967296) (+ (div main_~b~0 4294967296) 1)) (= main_~b~0 0) (<= 4294967295 main_~uint32_max~0))} is VALID [2022-04-15 13:13:57,156 INFO L290 TraceCheckUtils]: 14: Hoare triple {438#(and (<= (div (+ 4294967295 main_~uint32_max~0) 4294967296) (+ (div main_~b~0 4294967296) 1)) (= main_~b~0 0) (<= 4294967295 main_~uint32_max~0))} assume !!(~e~0 % 4294967296 < (~uint32_max~0 - 1) % 4294967296); {438#(and (<= (div (+ 4294967295 main_~uint32_max~0) 4294967296) (+ (div main_~b~0 4294967296) 1)) (= main_~b~0 0) (<= 4294967295 main_~uint32_max~0))} is VALID [2022-04-15 13:13:57,157 INFO L290 TraceCheckUtils]: 15: Hoare triple {438#(and (<= (div (+ 4294967295 main_~uint32_max~0) 4294967296) (+ (div main_~b~0 4294967296) 1)) (= main_~b~0 0) (<= 4294967295 main_~uint32_max~0))} assume (((~a~0 % 4294967296 == ~b~0 % 4294967296 && ~b~0 % 4294967296 == ~c~0 % 4294967296) && ~c~0 % 4294967296 == ~d~0 % 4294967296) && ~d~0 % 4294967296 == ~e~0 % 4294967296) && ~e~0 % 4294967296 == (~uint32_max~0 - 2) % 4294967296; {433#false} is VALID [2022-04-15 13:13:57,157 INFO L290 TraceCheckUtils]: 16: Hoare triple {433#false} assume !false; {433#false} is VALID [2022-04-15 13:13:57,158 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 13:13:57,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:13:57,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703760419] [2022-04-15 13:13:57,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703760419] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:13:57,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:13:57,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 13:13:57,198 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:13:57,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1405353196] [2022-04-15 13:13:57,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1405353196] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:13:57,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:13:57,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 13:13:57,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098600254] [2022-04-15 13:13:57,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:13:57,200 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 13:13:57,200 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:13:57,200 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:57,217 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 13:13:57,217 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 13:13:57,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:13:57,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 13:13:57,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 13:13:57,218 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:57,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:13:57,469 INFO L93 Difference]: Finished difference Result 68 states and 89 transitions. [2022-04-15 13:13:57,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 13:13:57,469 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 13:13:57,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:13:57,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:57,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2022-04-15 13:13:57,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:57,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2022-04-15 13:13:57,472 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 54 transitions. [2022-04-15 13:13:57,525 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:13:57,526 INFO L225 Difference]: With dead ends: 68 [2022-04-15 13:13:57,526 INFO L226 Difference]: Without dead ends: 53 [2022-04-15 13:13:57,526 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-04-15 13:13:57,527 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 68 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:13:57,527 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 23 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 13:13:57,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-15 13:13:57,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 42. [2022-04-15 13:13:57,598 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:13:57,598 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 42 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 38 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:57,598 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 42 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 38 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:57,599 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 42 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 38 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:57,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:13:57,600 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2022-04-15 13:13:57,600 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 67 transitions. [2022-04-15 13:13:57,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:13:57,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:13:57,601 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 38 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 53 states. [2022-04-15 13:13:57,601 INFO L87 Difference]: Start difference. First operand has 42 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 38 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 53 states. [2022-04-15 13:13:57,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:13:57,603 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2022-04-15 13:13:57,603 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 67 transitions. [2022-04-15 13:13:57,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:13:57,603 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:13:57,603 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:13:57,603 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:13:57,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 38 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:57,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 53 transitions. [2022-04-15 13:13:57,605 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 53 transitions. Word has length 19 [2022-04-15 13:13:57,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:13:57,605 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 53 transitions. [2022-04-15 13:13:57,605 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:57,605 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 53 transitions. [2022-04-15 13:13:57,662 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:13:57,663 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 53 transitions. [2022-04-15 13:13:57,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 13:13:57,663 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:13:57,663 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:13:57,663 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 13:13:57,664 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:13:57,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:13:57,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1173178741, now seen corresponding path program 1 times [2022-04-15 13:13:57,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:13:57,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [581566710] [2022-04-15 13:13:57,901 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Basisvector must contain only constants! [2022-04-15 13:13:57,901 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 13:13:57,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1173178741, now seen corresponding path program 2 times [2022-04-15 13:13:57,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:13:57,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471721298] [2022-04-15 13:13:57,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:13:57,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:13:57,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:13:58,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:13:58,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:13:58,029 INFO L290 TraceCheckUtils]: 0: Hoare triple {782#(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(14, 2);call #Ultimate.allocInit(12, 3); {773#true} is VALID [2022-04-15 13:13:58,029 INFO L290 TraceCheckUtils]: 1: Hoare triple {773#true} assume true; {773#true} is VALID [2022-04-15 13:13:58,030 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {773#true} {773#true} #79#return; {773#true} is VALID [2022-04-15 13:13:58,031 INFO L272 TraceCheckUtils]: 0: Hoare triple {773#true} call ULTIMATE.init(); {782#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:13:58,031 INFO L290 TraceCheckUtils]: 1: Hoare triple {782#(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(14, 2);call #Ultimate.allocInit(12, 3); {773#true} is VALID [2022-04-15 13:13:58,031 INFO L290 TraceCheckUtils]: 2: Hoare triple {773#true} assume true; {773#true} is VALID [2022-04-15 13:13:58,031 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {773#true} {773#true} #79#return; {773#true} is VALID [2022-04-15 13:13:58,031 INFO L272 TraceCheckUtils]: 4: Hoare triple {773#true} call #t~ret9 := main(); {773#true} is VALID [2022-04-15 13:13:58,032 INFO L290 TraceCheckUtils]: 5: Hoare triple {773#true} havoc ~a~0;havoc ~b~0;havoc ~c~0;havoc ~d~0;havoc ~e~0;havoc ~uint32_max~0;~uint32_max~0 := 4294967295;~a~0 := 0; {778#(and (<= (div (+ 4294967294 main_~uint32_max~0) 4294967296) 1) (<= 4294967295 main_~uint32_max~0))} is VALID [2022-04-15 13:13:58,033 INFO L290 TraceCheckUtils]: 6: Hoare triple {778#(and (<= (div (+ 4294967294 main_~uint32_max~0) 4294967296) 1) (<= 4294967295 main_~uint32_max~0))} assume !!(~a~0 % 4294967296 < (~uint32_max~0 - 1) % 4294967296);~b~0 := 0; {778#(and (<= (div (+ 4294967294 main_~uint32_max~0) 4294967296) 1) (<= 4294967295 main_~uint32_max~0))} is VALID [2022-04-15 13:13:58,033 INFO L290 TraceCheckUtils]: 7: Hoare triple {778#(and (<= (div (+ 4294967294 main_~uint32_max~0) 4294967296) 1) (<= 4294967295 main_~uint32_max~0))} assume !!(~b~0 % 4294967296 < (~uint32_max~0 - 1) % 4294967296);~c~0 := 0; {779#(and (<= (div (+ 4294967294 main_~uint32_max~0) 4294967296) 1) (<= 4294967295 main_~uint32_max~0) (= main_~c~0 0))} is VALID [2022-04-15 13:13:58,034 INFO L290 TraceCheckUtils]: 8: Hoare triple {779#(and (<= (div (+ 4294967294 main_~uint32_max~0) 4294967296) 1) (<= 4294967295 main_~uint32_max~0) (= main_~c~0 0))} assume !(~c~0 % 4294967296 < (~uint32_max~0 - 1) % 4294967296); {780#(and (<= 2 (div (+ 4294967295 main_~uint32_max~0) 4294967296)) (<= (div (+ 4294967294 main_~uint32_max~0) 4294967296) 1))} is VALID [2022-04-15 13:13:58,035 INFO L290 TraceCheckUtils]: 9: Hoare triple {780#(and (<= 2 (div (+ 4294967295 main_~uint32_max~0) 4294967296)) (<= (div (+ 4294967294 main_~uint32_max~0) 4294967296) 1))} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {780#(and (<= 2 (div (+ 4294967295 main_~uint32_max~0) 4294967296)) (<= (div (+ 4294967294 main_~uint32_max~0) 4294967296) 1))} is VALID [2022-04-15 13:13:58,035 INFO L290 TraceCheckUtils]: 10: Hoare triple {780#(and (<= 2 (div (+ 4294967295 main_~uint32_max~0) 4294967296)) (<= (div (+ 4294967294 main_~uint32_max~0) 4294967296) 1))} assume !(~b~0 % 4294967296 < (~uint32_max~0 - 1) % 4294967296); {780#(and (<= 2 (div (+ 4294967295 main_~uint32_max~0) 4294967296)) (<= (div (+ 4294967294 main_~uint32_max~0) 4294967296) 1))} is VALID [2022-04-15 13:13:58,036 INFO L290 TraceCheckUtils]: 11: Hoare triple {780#(and (<= 2 (div (+ 4294967295 main_~uint32_max~0) 4294967296)) (<= (div (+ 4294967294 main_~uint32_max~0) 4294967296) 1))} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {780#(and (<= 2 (div (+ 4294967295 main_~uint32_max~0) 4294967296)) (<= (div (+ 4294967294 main_~uint32_max~0) 4294967296) 1))} is VALID [2022-04-15 13:13:58,036 INFO L290 TraceCheckUtils]: 12: Hoare triple {780#(and (<= 2 (div (+ 4294967295 main_~uint32_max~0) 4294967296)) (<= (div (+ 4294967294 main_~uint32_max~0) 4294967296) 1))} assume !!(~a~0 % 4294967296 < (~uint32_max~0 - 1) % 4294967296);~b~0 := 0; {780#(and (<= 2 (div (+ 4294967295 main_~uint32_max~0) 4294967296)) (<= (div (+ 4294967294 main_~uint32_max~0) 4294967296) 1))} is VALID [2022-04-15 13:13:58,037 INFO L290 TraceCheckUtils]: 13: Hoare triple {780#(and (<= 2 (div (+ 4294967295 main_~uint32_max~0) 4294967296)) (<= (div (+ 4294967294 main_~uint32_max~0) 4294967296) 1))} assume !!(~b~0 % 4294967296 < (~uint32_max~0 - 1) % 4294967296);~c~0 := 0; {780#(and (<= 2 (div (+ 4294967295 main_~uint32_max~0) 4294967296)) (<= (div (+ 4294967294 main_~uint32_max~0) 4294967296) 1))} is VALID [2022-04-15 13:13:58,037 INFO L290 TraceCheckUtils]: 14: Hoare triple {780#(and (<= 2 (div (+ 4294967295 main_~uint32_max~0) 4294967296)) (<= (div (+ 4294967294 main_~uint32_max~0) 4294967296) 1))} assume !(~c~0 % 4294967296 < (~uint32_max~0 - 1) % 4294967296); {780#(and (<= 2 (div (+ 4294967295 main_~uint32_max~0) 4294967296)) (<= (div (+ 4294967294 main_~uint32_max~0) 4294967296) 1))} is VALID [2022-04-15 13:13:58,038 INFO L290 TraceCheckUtils]: 15: Hoare triple {780#(and (<= 2 (div (+ 4294967295 main_~uint32_max~0) 4294967296)) (<= (div (+ 4294967294 main_~uint32_max~0) 4294967296) 1))} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {780#(and (<= 2 (div (+ 4294967295 main_~uint32_max~0) 4294967296)) (<= (div (+ 4294967294 main_~uint32_max~0) 4294967296) 1))} is VALID [2022-04-15 13:13:58,038 INFO L290 TraceCheckUtils]: 16: Hoare triple {780#(and (<= 2 (div (+ 4294967295 main_~uint32_max~0) 4294967296)) (<= (div (+ 4294967294 main_~uint32_max~0) 4294967296) 1))} assume !!(~b~0 % 4294967296 < (~uint32_max~0 - 1) % 4294967296);~c~0 := 0; {780#(and (<= 2 (div (+ 4294967295 main_~uint32_max~0) 4294967296)) (<= (div (+ 4294967294 main_~uint32_max~0) 4294967296) 1))} is VALID [2022-04-15 13:13:58,039 INFO L290 TraceCheckUtils]: 17: Hoare triple {780#(and (<= 2 (div (+ 4294967295 main_~uint32_max~0) 4294967296)) (<= (div (+ 4294967294 main_~uint32_max~0) 4294967296) 1))} assume !!(~c~0 % 4294967296 < (~uint32_max~0 - 1) % 4294967296);~d~0 := 0; {780#(and (<= 2 (div (+ 4294967295 main_~uint32_max~0) 4294967296)) (<= (div (+ 4294967294 main_~uint32_max~0) 4294967296) 1))} is VALID [2022-04-15 13:13:58,039 INFO L290 TraceCheckUtils]: 18: Hoare triple {780#(and (<= 2 (div (+ 4294967295 main_~uint32_max~0) 4294967296)) (<= (div (+ 4294967294 main_~uint32_max~0) 4294967296) 1))} assume !!(~d~0 % 4294967296 < (~uint32_max~0 - 1) % 4294967296);~e~0 := 0; {780#(and (<= 2 (div (+ 4294967295 main_~uint32_max~0) 4294967296)) (<= (div (+ 4294967294 main_~uint32_max~0) 4294967296) 1))} is VALID [2022-04-15 13:13:58,040 INFO L290 TraceCheckUtils]: 19: Hoare triple {780#(and (<= 2 (div (+ 4294967295 main_~uint32_max~0) 4294967296)) (<= (div (+ 4294967294 main_~uint32_max~0) 4294967296) 1))} assume !!(~e~0 % 4294967296 < (~uint32_max~0 - 1) % 4294967296); {780#(and (<= 2 (div (+ 4294967295 main_~uint32_max~0) 4294967296)) (<= (div (+ 4294967294 main_~uint32_max~0) 4294967296) 1))} is VALID [2022-04-15 13:13:58,040 INFO L290 TraceCheckUtils]: 20: Hoare triple {780#(and (<= 2 (div (+ 4294967295 main_~uint32_max~0) 4294967296)) (<= (div (+ 4294967294 main_~uint32_max~0) 4294967296) 1))} assume !((((~a~0 % 4294967296 == ~b~0 % 4294967296 && ~b~0 % 4294967296 == ~c~0 % 4294967296) && ~c~0 % 4294967296 == ~d~0 % 4294967296) && ~d~0 % 4294967296 == ~e~0 % 4294967296) && ~e~0 % 4294967296 == (~uint32_max~0 - 2) % 4294967296); {780#(and (<= 2 (div (+ 4294967295 main_~uint32_max~0) 4294967296)) (<= (div (+ 4294967294 main_~uint32_max~0) 4294967296) 1))} is VALID [2022-04-15 13:13:58,041 INFO L290 TraceCheckUtils]: 21: Hoare triple {780#(and (<= 2 (div (+ 4294967295 main_~uint32_max~0) 4294967296)) (<= (div (+ 4294967294 main_~uint32_max~0) 4294967296) 1))} #t~pre8 := 1 + ~e~0;~e~0 := 1 + ~e~0;havoc #t~pre8; {780#(and (<= 2 (div (+ 4294967295 main_~uint32_max~0) 4294967296)) (<= (div (+ 4294967294 main_~uint32_max~0) 4294967296) 1))} is VALID [2022-04-15 13:13:58,041 INFO L290 TraceCheckUtils]: 22: Hoare triple {780#(and (<= 2 (div (+ 4294967295 main_~uint32_max~0) 4294967296)) (<= (div (+ 4294967294 main_~uint32_max~0) 4294967296) 1))} assume !!(~e~0 % 4294967296 < (~uint32_max~0 - 1) % 4294967296); {781#(and (<= (+ main_~e~0 3) (+ main_~uint32_max~0 (* 4294967296 (div main_~e~0 4294967296)))) (<= (div (+ 4294967294 main_~uint32_max~0) 4294967296) 1))} is VALID [2022-04-15 13:13:58,042 INFO L290 TraceCheckUtils]: 23: Hoare triple {781#(and (<= (+ main_~e~0 3) (+ main_~uint32_max~0 (* 4294967296 (div main_~e~0 4294967296)))) (<= (div (+ 4294967294 main_~uint32_max~0) 4294967296) 1))} assume (((~a~0 % 4294967296 == ~b~0 % 4294967296 && ~b~0 % 4294967296 == ~c~0 % 4294967296) && ~c~0 % 4294967296 == ~d~0 % 4294967296) && ~d~0 % 4294967296 == ~e~0 % 4294967296) && ~e~0 % 4294967296 == (~uint32_max~0 - 2) % 4294967296; {774#false} is VALID [2022-04-15 13:13:58,042 INFO L290 TraceCheckUtils]: 24: Hoare triple {774#false} assume !false; {774#false} is VALID [2022-04-15 13:13:58,043 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 13:13:58,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:13:58,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471721298] [2022-04-15 13:13:58,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471721298] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:13:58,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603495511] [2022-04-15 13:13:58,043 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:13:58,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:13:58,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:13:58,045 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:13:58,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 13:13:58,092 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 13:13:58,092 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:13:58,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-15 13:13:58,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:13:58,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:13:58,558 INFO L272 TraceCheckUtils]: 0: Hoare triple {773#true} call ULTIMATE.init(); {773#true} is VALID [2022-04-15 13:13:58,559 INFO L290 TraceCheckUtils]: 1: Hoare triple {773#true} #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(14, 2);call #Ultimate.allocInit(12, 3); {773#true} is VALID [2022-04-15 13:13:58,559 INFO L290 TraceCheckUtils]: 2: Hoare triple {773#true} assume true; {773#true} is VALID [2022-04-15 13:13:58,559 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {773#true} {773#true} #79#return; {773#true} is VALID [2022-04-15 13:13:58,559 INFO L272 TraceCheckUtils]: 4: Hoare triple {773#true} call #t~ret9 := main(); {773#true} is VALID [2022-04-15 13:13:58,559 INFO L290 TraceCheckUtils]: 5: Hoare triple {773#true} havoc ~a~0;havoc ~b~0;havoc ~c~0;havoc ~d~0;havoc ~e~0;havoc ~uint32_max~0;~uint32_max~0 := 4294967295;~a~0 := 0; {801#(= 4294967295 main_~uint32_max~0)} is VALID [2022-04-15 13:13:58,560 INFO L290 TraceCheckUtils]: 6: Hoare triple {801#(= 4294967295 main_~uint32_max~0)} assume !!(~a~0 % 4294967296 < (~uint32_max~0 - 1) % 4294967296);~b~0 := 0; {801#(= 4294967295 main_~uint32_max~0)} is VALID [2022-04-15 13:13:58,560 INFO L290 TraceCheckUtils]: 7: Hoare triple {801#(= 4294967295 main_~uint32_max~0)} assume !!(~b~0 % 4294967296 < (~uint32_max~0 - 1) % 4294967296);~c~0 := 0; {801#(= 4294967295 main_~uint32_max~0)} is VALID [2022-04-15 13:13:58,562 INFO L290 TraceCheckUtils]: 8: Hoare triple {801#(= 4294967295 main_~uint32_max~0)} assume !(~c~0 % 4294967296 < (~uint32_max~0 - 1) % 4294967296); {801#(= 4294967295 main_~uint32_max~0)} is VALID [2022-04-15 13:13:58,563 INFO L290 TraceCheckUtils]: 9: Hoare triple {801#(= 4294967295 main_~uint32_max~0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {801#(= 4294967295 main_~uint32_max~0)} is VALID [2022-04-15 13:13:58,563 INFO L290 TraceCheckUtils]: 10: Hoare triple {801#(= 4294967295 main_~uint32_max~0)} assume !(~b~0 % 4294967296 < (~uint32_max~0 - 1) % 4294967296); {801#(= 4294967295 main_~uint32_max~0)} is VALID [2022-04-15 13:13:58,564 INFO L290 TraceCheckUtils]: 11: Hoare triple {801#(= 4294967295 main_~uint32_max~0)} #t~pre4 := 1 + ~a~0;~a~0 := 1 + ~a~0;havoc #t~pre4; {801#(= 4294967295 main_~uint32_max~0)} is VALID [2022-04-15 13:13:58,564 INFO L290 TraceCheckUtils]: 12: Hoare triple {801#(= 4294967295 main_~uint32_max~0)} assume !!(~a~0 % 4294967296 < (~uint32_max~0 - 1) % 4294967296);~b~0 := 0; {801#(= 4294967295 main_~uint32_max~0)} is VALID [2022-04-15 13:13:58,564 INFO L290 TraceCheckUtils]: 13: Hoare triple {801#(= 4294967295 main_~uint32_max~0)} assume !!(~b~0 % 4294967296 < (~uint32_max~0 - 1) % 4294967296);~c~0 := 0; {801#(= 4294967295 main_~uint32_max~0)} is VALID [2022-04-15 13:13:58,565 INFO L290 TraceCheckUtils]: 14: Hoare triple {801#(= 4294967295 main_~uint32_max~0)} assume !(~c~0 % 4294967296 < (~uint32_max~0 - 1) % 4294967296); {801#(= 4294967295 main_~uint32_max~0)} is VALID [2022-04-15 13:13:58,565 INFO L290 TraceCheckUtils]: 15: Hoare triple {801#(= 4294967295 main_~uint32_max~0)} #t~pre5 := 1 + ~b~0;~b~0 := 1 + ~b~0;havoc #t~pre5; {801#(= 4294967295 main_~uint32_max~0)} is VALID [2022-04-15 13:13:58,566 INFO L290 TraceCheckUtils]: 16: Hoare triple {801#(= 4294967295 main_~uint32_max~0)} assume !!(~b~0 % 4294967296 < (~uint32_max~0 - 1) % 4294967296);~c~0 := 0; {835#(and (= main_~c~0 0) (= 4294967295 main_~uint32_max~0))} is VALID [2022-04-15 13:13:58,566 INFO L290 TraceCheckUtils]: 17: Hoare triple {835#(and (= main_~c~0 0) (= 4294967295 main_~uint32_max~0))} assume !!(~c~0 % 4294967296 < (~uint32_max~0 - 1) % 4294967296);~d~0 := 0; {835#(and (= main_~c~0 0) (= 4294967295 main_~uint32_max~0))} is VALID [2022-04-15 13:13:58,567 INFO L290 TraceCheckUtils]: 18: Hoare triple {835#(and (= main_~c~0 0) (= 4294967295 main_~uint32_max~0))} assume !!(~d~0 % 4294967296 < (~uint32_max~0 - 1) % 4294967296);~e~0 := 0; {835#(and (= main_~c~0 0) (= 4294967295 main_~uint32_max~0))} is VALID [2022-04-15 13:13:58,567 INFO L290 TraceCheckUtils]: 19: Hoare triple {835#(and (= main_~c~0 0) (= 4294967295 main_~uint32_max~0))} assume !!(~e~0 % 4294967296 < (~uint32_max~0 - 1) % 4294967296); {835#(and (= main_~c~0 0) (= 4294967295 main_~uint32_max~0))} is VALID [2022-04-15 13:13:58,568 INFO L290 TraceCheckUtils]: 20: Hoare triple {835#(and (= main_~c~0 0) (= 4294967295 main_~uint32_max~0))} assume !((((~a~0 % 4294967296 == ~b~0 % 4294967296 && ~b~0 % 4294967296 == ~c~0 % 4294967296) && ~c~0 % 4294967296 == ~d~0 % 4294967296) && ~d~0 % 4294967296 == ~e~0 % 4294967296) && ~e~0 % 4294967296 == (~uint32_max~0 - 2) % 4294967296); {835#(and (= main_~c~0 0) (= 4294967295 main_~uint32_max~0))} is VALID [2022-04-15 13:13:58,570 INFO L290 TraceCheckUtils]: 21: Hoare triple {835#(and (= main_~c~0 0) (= 4294967295 main_~uint32_max~0))} #t~pre8 := 1 + ~e~0;~e~0 := 1 + ~e~0;havoc #t~pre8; {835#(and (= main_~c~0 0) (= 4294967295 main_~uint32_max~0))} is VALID [2022-04-15 13:13:58,571 INFO L290 TraceCheckUtils]: 22: Hoare triple {835#(and (= main_~c~0 0) (= 4294967295 main_~uint32_max~0))} assume !!(~e~0 % 4294967296 < (~uint32_max~0 - 1) % 4294967296); {835#(and (= main_~c~0 0) (= 4294967295 main_~uint32_max~0))} is VALID [2022-04-15 13:13:58,571 INFO L290 TraceCheckUtils]: 23: Hoare triple {835#(and (= main_~c~0 0) (= 4294967295 main_~uint32_max~0))} assume (((~a~0 % 4294967296 == ~b~0 % 4294967296 && ~b~0 % 4294967296 == ~c~0 % 4294967296) && ~c~0 % 4294967296 == ~d~0 % 4294967296) && ~d~0 % 4294967296 == ~e~0 % 4294967296) && ~e~0 % 4294967296 == (~uint32_max~0 - 2) % 4294967296; {774#false} is VALID [2022-04-15 13:13:58,571 INFO L290 TraceCheckUtils]: 24: Hoare triple {774#false} assume !false; {774#false} is VALID [2022-04-15 13:13:58,571 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-15 13:13:58,572 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 13:13:58,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [603495511] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:13:58,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 13:13:58,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2022-04-15 13:13:58,572 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:13:58,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [581566710] [2022-04-15 13:13:58,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [581566710] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:13:58,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:13:58,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:13:58,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146171715] [2022-04-15 13:13:58,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:13:58,573 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-15 13:13:58,573 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:13:58,574 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:58,588 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 13:13:58,588 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 13:13:58,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:13:58,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 13:13:58,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-04-15 13:13:58,589 INFO L87 Difference]: Start difference. First operand 42 states and 53 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:58,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:13:58,757 INFO L93 Difference]: Finished difference Result 101 states and 133 transitions. [2022-04-15 13:13:58,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 13:13:58,757 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-15 13:13:58,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:13:58,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:58,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2022-04-15 13:13:58,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:58,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2022-04-15 13:13:58,759 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 51 transitions. [2022-04-15 13:13:58,798 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:13:58,799 INFO L225 Difference]: With dead ends: 101 [2022-04-15 13:13:58,799 INFO L226 Difference]: Without dead ends: 67 [2022-04-15 13:13:58,800 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-04-15 13:13:58,800 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 22 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:13:58,801 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 21 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:13:58,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-15 13:13:58,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 51. [2022-04-15 13:13:58,876 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:13:58,876 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 51 states, 47 states have (on average 1.297872340425532) internal successors, (61), 47 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:58,876 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 51 states, 47 states have (on average 1.297872340425532) internal successors, (61), 47 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:58,877 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 51 states, 47 states have (on average 1.297872340425532) internal successors, (61), 47 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:58,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:13:58,880 INFO L93 Difference]: Finished difference Result 67 states and 84 transitions. [2022-04-15 13:13:58,880 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 84 transitions. [2022-04-15 13:13:58,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:13:58,884 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:13:58,884 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 47 states have (on average 1.297872340425532) internal successors, (61), 47 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 67 states. [2022-04-15 13:13:58,884 INFO L87 Difference]: Start difference. First operand has 51 states, 47 states have (on average 1.297872340425532) internal successors, (61), 47 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 67 states. [2022-04-15 13:13:58,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:13:58,888 INFO L93 Difference]: Finished difference Result 67 states and 84 transitions. [2022-04-15 13:13:58,888 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 84 transitions. [2022-04-15 13:13:58,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:13:58,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:13:58,889 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:13:58,889 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:13:58,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 47 states have (on average 1.297872340425532) internal successors, (61), 47 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:58,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 64 transitions. [2022-04-15 13:13:58,892 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 64 transitions. Word has length 25 [2022-04-15 13:13:58,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:13:58,892 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 64 transitions. [2022-04-15 13:13:58,892 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:58,892 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 64 transitions. [2022-04-15 13:13:58,976 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:13:58,977 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 64 transitions. [2022-04-15 13:13:58,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-15 13:13:58,978 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:13:58,978 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:13:58,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 13:13:59,187 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:13:59,188 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:13:59,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:13:59,188 INFO L85 PathProgramCache]: Analyzing trace with hash -642600209, now seen corresponding path program 1 times [2022-04-15 13:13:59,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:13:59,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1028954371]