/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loop-acceleration/const_1-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 12:16:16,164 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 12:16:16,165 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 12:16:16,215 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 12:16:16,216 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 12:16:16,216 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 12:16:16,217 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 12:16:16,219 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 12:16:16,220 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 12:16:16,220 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 12:16:16,221 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 12:16:16,222 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 12:16:16,222 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 12:16:16,223 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 12:16:16,224 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 12:16:16,225 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 12:16:16,225 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 12:16:16,226 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 12:16:16,227 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 12:16:16,229 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 12:16:16,230 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 12:16:16,242 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 12:16:16,243 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 12:16:16,244 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 12:16:16,245 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 12:16:16,247 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 12:16:16,247 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 12:16:16,248 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 12:16:16,248 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 12:16:16,249 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 12:16:16,249 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 12:16:16,250 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 12:16:16,250 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 12:16:16,251 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 12:16:16,252 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 12:16:16,252 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 12:16:16,253 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 12:16:16,253 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 12:16:16,253 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 12:16:16,254 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 12:16:16,254 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 12:16:16,263 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 12:16:16,264 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 12:16:16,276 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 12:16:16,276 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 12:16:16,277 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 12:16:16,277 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 12:16:16,278 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 12:16:16,278 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 12:16:16,278 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 12:16:16,278 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 12:16:16,278 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 12:16:16,278 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 12:16:16,278 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 12:16:16,278 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 12:16:16,279 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 12:16:16,279 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 12:16:16,279 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 12:16:16,279 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:16:16,279 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 12:16:16,279 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 12:16:16,279 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 12:16:16,279 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 12:16:16,280 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 12:16:16,280 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 12:16:16,280 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 12:16:16,516 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 12:16:16,538 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 12:16:16,540 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 12:16:16,541 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 12:16:16,541 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 12:16:16,542 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/const_1-2.c [2022-04-15 12:16:16,586 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35a143e30/3ecee026e259485481088723d7298b24/FLAGfe5d07bbd [2022-04-15 12:16:16,946 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 12:16:16,947 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/const_1-2.c [2022-04-15 12:16:16,951 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35a143e30/3ecee026e259485481088723d7298b24/FLAGfe5d07bbd [2022-04-15 12:16:16,964 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35a143e30/3ecee026e259485481088723d7298b24 [2022-04-15 12:16:16,966 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 12:16:16,967 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 12:16:16,969 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 12:16:16,969 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 12:16:16,972 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 12:16:16,972 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:16:16" (1/1) ... [2022-04-15 12:16:16,974 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55ccd849 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:16:16, skipping insertion in model container [2022-04-15 12:16:16,974 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:16:16" (1/1) ... [2022-04-15 12:16:16,978 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 12:16:16,987 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 12:16:17,126 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/const_1-2.c[321,334] [2022-04-15 12:16:17,137 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:16:17,150 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 12:16:17,159 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/const_1-2.c[321,334] [2022-04-15 12:16:17,160 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:16:17,173 INFO L208 MainTranslator]: Completed translation [2022-04-15 12:16:17,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:16:17 WrapperNode [2022-04-15 12:16:17,174 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 12:16:17,175 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 12:16:17,175 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 12:16:17,175 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 12:16:17,182 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:16:17" (1/1) ... [2022-04-15 12:16:17,182 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:16:17" (1/1) ... [2022-04-15 12:16:17,186 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:16:17" (1/1) ... [2022-04-15 12:16:17,186 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:16:17" (1/1) ... [2022-04-15 12:16:17,191 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:16:17" (1/1) ... [2022-04-15 12:16:17,194 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:16:17" (1/1) ... [2022-04-15 12:16:17,198 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:16:17" (1/1) ... [2022-04-15 12:16:17,200 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 12:16:17,201 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 12:16:17,201 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 12:16:17,201 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 12:16:17,201 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:16:17" (1/1) ... [2022-04-15 12:16:17,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:16:17,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:16:17,223 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 12:16:17,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 12:16:17,259 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 12:16:17,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 12:16:17,260 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 12:16:17,260 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 12:16:17,260 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 12:16:17,260 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 12:16:17,260 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 12:16:17,261 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 12:16:17,261 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 12:16:17,261 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 12:16:17,261 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 12:16:17,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 12:16:17,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 12:16:17,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 12:16:17,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 12:16:17,262 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 12:16:17,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 12:16:17,305 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 12:16:17,306 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 12:16:17,446 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 12:16:17,450 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 12:16:17,450 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 12:16:17,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:16:17 BoogieIcfgContainer [2022-04-15 12:16:17,452 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 12:16:17,453 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 12:16:17,453 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 12:16:17,456 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 12:16:17,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:16:16" (1/3) ... [2022-04-15 12:16:17,456 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@319628ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:16:17, skipping insertion in model container [2022-04-15 12:16:17,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:16:17" (2/3) ... [2022-04-15 12:16:17,457 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@319628ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:16:17, skipping insertion in model container [2022-04-15 12:16:17,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:16:17" (3/3) ... [2022-04-15 12:16:17,457 INFO L111 eAbstractionObserver]: Analyzing ICFG const_1-2.c [2022-04-15 12:16:17,461 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 12:16:17,461 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 12:16:17,500 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 12:16:17,504 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 12:16:17,504 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 12:16:17,535 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:16:17,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 12:16:17,539 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:17,539 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:17,540 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:17,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:17,543 INFO L85 PathProgramCache]: Analyzing trace with hash -219174432, now seen corresponding path program 1 times [2022-04-15 12:16:17,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:17,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1776228843] [2022-04-15 12:16:17,556 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:16:17,556 INFO L85 PathProgramCache]: Analyzing trace with hash -219174432, now seen corresponding path program 2 times [2022-04-15 12:16:17,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:17,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446744582] [2022-04-15 12:16:17,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:17,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:17,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:17,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:17,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:17,709 INFO L290 TraceCheckUtils]: 0: Hoare triple {26#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {21#true} is VALID [2022-04-15 12:16:17,709 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-15 12:16:17,709 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} #34#return; {21#true} is VALID [2022-04-15 12:16:17,713 INFO L272 TraceCheckUtils]: 0: Hoare triple {21#true} call ULTIMATE.init(); {26#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:17,713 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {21#true} is VALID [2022-04-15 12:16:17,714 INFO L290 TraceCheckUtils]: 2: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-15 12:16:17,714 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21#true} {21#true} #34#return; {21#true} is VALID [2022-04-15 12:16:17,714 INFO L272 TraceCheckUtils]: 4: Hoare triple {21#true} call #t~ret5 := main(); {21#true} is VALID [2022-04-15 12:16:17,714 INFO L290 TraceCheckUtils]: 5: Hoare triple {21#true} ~x~0 := 1;~y~0 := 0; {21#true} is VALID [2022-04-15 12:16:17,715 INFO L290 TraceCheckUtils]: 6: Hoare triple {21#true} assume !true; {22#false} is VALID [2022-04-15 12:16:17,715 INFO L272 TraceCheckUtils]: 7: Hoare triple {22#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {22#false} is VALID [2022-04-15 12:16:17,716 INFO L290 TraceCheckUtils]: 8: Hoare triple {22#false} ~cond := #in~cond; {22#false} is VALID [2022-04-15 12:16:17,716 INFO L290 TraceCheckUtils]: 9: Hoare triple {22#false} assume 0 == ~cond; {22#false} is VALID [2022-04-15 12:16:17,716 INFO L290 TraceCheckUtils]: 10: Hoare triple {22#false} assume !false; {22#false} is VALID [2022-04-15 12:16:17,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:16:17,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:17,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446744582] [2022-04-15 12:16:17,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446744582] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:17,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:17,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 12:16:17,722 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:17,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1776228843] [2022-04-15 12:16:17,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1776228843] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:17,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:17,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 12:16:17,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734514944] [2022-04-15 12:16:17,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:17,727 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 12:16:17,728 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:17,730 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:17,752 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:17,753 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 12:16:17,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:17,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 12:16:17,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 12:16:17,772 INFO L87 Difference]: Start difference. First operand has 18 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:17,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:17,842 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-04-15 12:16:17,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 12:16:17,843 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 12:16:17,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:17,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:17,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-04-15 12:16:17,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:17,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-04-15 12:16:17,851 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 32 transitions. [2022-04-15 12:16:17,890 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:17,897 INFO L225 Difference]: With dead ends: 29 [2022-04-15 12:16:17,897 INFO L226 Difference]: Without dead ends: 12 [2022-04-15 12:16:17,900 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 12:16:17,903 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 9 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:17,904 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 20 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:16:17,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-04-15 12:16:17,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-04-15 12:16:17,928 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:17,929 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:17,930 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:17,931 INFO L87 Difference]: Start difference. First operand 12 states. Second operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:17,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:17,936 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-04-15 12:16:17,937 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-15 12:16:17,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:17,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:17,938 INFO L74 IsIncluded]: Start isIncluded. First operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 12 states. [2022-04-15 12:16:17,938 INFO L87 Difference]: Start difference. First operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 12 states. [2022-04-15 12:16:17,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:17,940 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-04-15 12:16:17,940 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-15 12:16:17,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:17,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:17,941 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:17,941 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:17,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:17,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2022-04-15 12:16:17,945 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 11 [2022-04-15 12:16:17,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:17,945 INFO L478 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2022-04-15 12:16:17,946 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:17,946 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 12 transitions. [2022-04-15 12:16:17,965 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:17,965 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-15 12:16:17,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 12:16:17,966 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:17,967 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:17,967 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 12:16:17,970 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:17,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:17,973 INFO L85 PathProgramCache]: Analyzing trace with hash -222868516, now seen corresponding path program 1 times [2022-04-15 12:16:17,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:17,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [813848327] [2022-04-15 12:16:17,973 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:16:17,974 INFO L85 PathProgramCache]: Analyzing trace with hash -222868516, now seen corresponding path program 2 times [2022-04-15 12:16:17,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:17,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47974642] [2022-04-15 12:16:17,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:17,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:18,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:18,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:18,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:18,069 INFO L290 TraceCheckUtils]: 0: Hoare triple {141#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {135#true} is VALID [2022-04-15 12:16:18,069 INFO L290 TraceCheckUtils]: 1: Hoare triple {135#true} assume true; {135#true} is VALID [2022-04-15 12:16:18,071 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {135#true} {135#true} #34#return; {135#true} is VALID [2022-04-15 12:16:18,072 INFO L272 TraceCheckUtils]: 0: Hoare triple {135#true} call ULTIMATE.init(); {141#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:18,072 INFO L290 TraceCheckUtils]: 1: Hoare triple {141#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {135#true} is VALID [2022-04-15 12:16:18,072 INFO L290 TraceCheckUtils]: 2: Hoare triple {135#true} assume true; {135#true} is VALID [2022-04-15 12:16:18,073 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {135#true} {135#true} #34#return; {135#true} is VALID [2022-04-15 12:16:18,073 INFO L272 TraceCheckUtils]: 4: Hoare triple {135#true} call #t~ret5 := main(); {135#true} is VALID [2022-04-15 12:16:18,074 INFO L290 TraceCheckUtils]: 5: Hoare triple {135#true} ~x~0 := 1;~y~0 := 0; {140#(= main_~y~0 0)} is VALID [2022-04-15 12:16:18,075 INFO L290 TraceCheckUtils]: 6: Hoare triple {140#(= main_~y~0 0)} assume !(~y~0 % 4294967296 < 1024); {136#false} is VALID [2022-04-15 12:16:18,075 INFO L272 TraceCheckUtils]: 7: Hoare triple {136#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {136#false} is VALID [2022-04-15 12:16:18,075 INFO L290 TraceCheckUtils]: 8: Hoare triple {136#false} ~cond := #in~cond; {136#false} is VALID [2022-04-15 12:16:18,076 INFO L290 TraceCheckUtils]: 9: Hoare triple {136#false} assume 0 == ~cond; {136#false} is VALID [2022-04-15 12:16:18,076 INFO L290 TraceCheckUtils]: 10: Hoare triple {136#false} assume !false; {136#false} is VALID [2022-04-15 12:16:18,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:16:18,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:18,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47974642] [2022-04-15 12:16:18,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47974642] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:18,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:18,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:16:18,077 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:18,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [813848327] [2022-04-15 12:16:18,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [813848327] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:18,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:18,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:16:18,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126619751] [2022-04-15 12:16:18,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:18,079 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 12:16:18,079 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:18,079 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:18,089 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:18,090 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 12:16:18,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:18,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 12:16:18,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 12:16:18,091 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:18,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:18,145 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-15 12:16:18,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 12:16:18,146 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 12:16:18,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:18,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:18,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-04-15 12:16:18,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:18,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-04-15 12:16:18,159 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 18 transitions. [2022-04-15 12:16:18,185 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:18,186 INFO L225 Difference]: With dead ends: 18 [2022-04-15 12:16:18,186 INFO L226 Difference]: Without dead ends: 13 [2022-04-15 12:16:18,187 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 12:16:18,188 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:18,188 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 18 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:16:18,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-15 12:16:18,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-15 12:16:18,191 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:18,192 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:18,192 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:18,192 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:18,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:18,193 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-15 12:16:18,194 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-15 12:16:18,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:18,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:18,194 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-15 12:16:18,194 INFO L87 Difference]: Start difference. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-15 12:16:18,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:18,195 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-15 12:16:18,195 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-15 12:16:18,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:18,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:18,196 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:18,196 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:18,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:18,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-04-15 12:16:18,197 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2022-04-15 12:16:18,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:18,197 INFO L478 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-04-15 12:16:18,198 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:18,198 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 13 transitions. [2022-04-15 12:16:18,211 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:18,211 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-15 12:16:18,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 12:16:18,212 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:18,212 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:18,212 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 12:16:18,212 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:18,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:18,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1717471862, now seen corresponding path program 1 times [2022-04-15 12:16:18,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:18,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1441249562] [2022-04-15 12:16:18,367 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:16:18,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1867307785, now seen corresponding path program 1 times [2022-04-15 12:16:18,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:18,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059472047] [2022-04-15 12:16:18,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:18,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:18,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:18,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:18,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:18,456 INFO L290 TraceCheckUtils]: 0: Hoare triple {240#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {234#true} is VALID [2022-04-15 12:16:18,457 INFO L290 TraceCheckUtils]: 1: Hoare triple {234#true} assume true; {234#true} is VALID [2022-04-15 12:16:18,457 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {234#true} {234#true} #34#return; {234#true} is VALID [2022-04-15 12:16:18,457 INFO L272 TraceCheckUtils]: 0: Hoare triple {234#true} call ULTIMATE.init(); {240#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:18,458 INFO L290 TraceCheckUtils]: 1: Hoare triple {240#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {234#true} is VALID [2022-04-15 12:16:18,458 INFO L290 TraceCheckUtils]: 2: Hoare triple {234#true} assume true; {234#true} is VALID [2022-04-15 12:16:18,458 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {234#true} {234#true} #34#return; {234#true} is VALID [2022-04-15 12:16:18,458 INFO L272 TraceCheckUtils]: 4: Hoare triple {234#true} call #t~ret5 := main(); {234#true} is VALID [2022-04-15 12:16:18,459 INFO L290 TraceCheckUtils]: 5: Hoare triple {234#true} ~x~0 := 1;~y~0 := 0; {239#(= main_~y~0 0)} is VALID [2022-04-15 12:16:18,460 INFO L290 TraceCheckUtils]: 6: Hoare triple {239#(= main_~y~0 0)} [40] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_In_1 v_main_~y~0_Out_2))) (or .cse0 (and (= |v_main_#t~post4_Out_2| 1) .cse0 (< (mod (+ 4294967295 v_main_~y~0_Out_2) 4294967296) 1024) (= v_main_~y~0_Out_2 0) (= v_main_~x~0_Out_2 0)))) InVars {main_~y~0=v_main_~y~0_In_1} OutVars{main_#t~post4=|v_main_#t~post4_Out_2|, main_~y~0=v_main_~y~0_Out_2, main_~x~0=v_main_~x~0_Out_2} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {239#(= main_~y~0 0)} is VALID [2022-04-15 12:16:18,460 INFO L290 TraceCheckUtils]: 7: Hoare triple {239#(= main_~y~0 0)} [39] L16-3_primed-->L16-3: Formula: (not (< (mod v_main_~y~0_4 4294967296) 1024)) InVars {main_~y~0=v_main_~y~0_4} OutVars{main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[] {235#false} is VALID [2022-04-15 12:16:18,460 INFO L272 TraceCheckUtils]: 8: Hoare triple {235#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {235#false} is VALID [2022-04-15 12:16:18,461 INFO L290 TraceCheckUtils]: 9: Hoare triple {235#false} ~cond := #in~cond; {235#false} is VALID [2022-04-15 12:16:18,462 INFO L290 TraceCheckUtils]: 10: Hoare triple {235#false} assume 0 == ~cond; {235#false} is VALID [2022-04-15 12:16:18,465 INFO L290 TraceCheckUtils]: 11: Hoare triple {235#false} assume !false; {235#false} is VALID [2022-04-15 12:16:18,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:16:18,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:18,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059472047] [2022-04-15 12:16:18,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059472047] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:18,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:18,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:16:18,500 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:18,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1441249562] [2022-04-15 12:16:18,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1441249562] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:18,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:18,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:16:18,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000880392] [2022-04-15 12:16:18,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:18,502 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 12:16:18,502 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:18,502 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:18,510 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:18,510 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 12:16:18,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:18,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 12:16:18,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 12:16:18,511 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:18,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:18,568 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-15 12:16:18,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 12:16:18,568 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 12:16:18,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:18,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:18,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2022-04-15 12:16:18,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:18,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2022-04-15 12:16:18,571 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 19 transitions. [2022-04-15 12:16:18,583 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:18,584 INFO L225 Difference]: With dead ends: 19 [2022-04-15 12:16:18,584 INFO L226 Difference]: Without dead ends: 14 [2022-04-15 12:16:18,584 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-15 12:16:18,585 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:18,586 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 23 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:16:18,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-15 12:16:18,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-15 12:16:18,588 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:18,588 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:18,588 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:18,588 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:18,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:18,589 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-15 12:16:18,589 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-15 12:16:18,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:18,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:18,590 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-15 12:16:18,590 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-15 12:16:18,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:18,591 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-15 12:16:18,591 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-15 12:16:18,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:18,591 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:18,591 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:18,591 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:18,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:18,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-15 12:16:18,592 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2022-04-15 12:16:18,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:18,592 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-15 12:16:18,592 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:18,592 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 14 transitions. [2022-04-15 12:16:18,603 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:18,603 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-15 12:16:18,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-15 12:16:18,603 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:18,603 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:18,603 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 12:16:18,604 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:18,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:18,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1738481436, now seen corresponding path program 2 times [2022-04-15 12:16:18,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:18,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [923369537] [2022-04-15 12:16:18,691 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:16:18,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1808202441, now seen corresponding path program 1 times [2022-04-15 12:16:18,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:18,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784585852] [2022-04-15 12:16:18,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:18,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:18,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:18,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:18,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:18,785 INFO L290 TraceCheckUtils]: 0: Hoare triple {348#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {342#true} is VALID [2022-04-15 12:16:18,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {342#true} assume true; {342#true} is VALID [2022-04-15 12:16:18,785 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {342#true} {342#true} #34#return; {342#true} is VALID [2022-04-15 12:16:18,786 INFO L272 TraceCheckUtils]: 0: Hoare triple {342#true} call ULTIMATE.init(); {348#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:18,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {348#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {342#true} is VALID [2022-04-15 12:16:18,786 INFO L290 TraceCheckUtils]: 2: Hoare triple {342#true} assume true; {342#true} is VALID [2022-04-15 12:16:18,786 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {342#true} {342#true} #34#return; {342#true} is VALID [2022-04-15 12:16:18,786 INFO L272 TraceCheckUtils]: 4: Hoare triple {342#true} call #t~ret5 := main(); {342#true} is VALID [2022-04-15 12:16:18,787 INFO L290 TraceCheckUtils]: 5: Hoare triple {342#true} ~x~0 := 1;~y~0 := 0; {347#(= main_~y~0 0)} is VALID [2022-04-15 12:16:18,787 INFO L290 TraceCheckUtils]: 6: Hoare triple {347#(= main_~y~0 0)} [42] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_In_2 v_main_~y~0_Out_4))) (or (and (= v_main_~y~0_Out_4 0) (< (mod (+ 4294967295 v_main_~y~0_Out_4) 4294967296) 1024) (= |v_main_#t~post4_Out_4| 1) .cse0 (= v_main_~x~0_Out_4 0)) .cse0)) InVars {main_~y~0=v_main_~y~0_In_2} OutVars{main_#t~post4=|v_main_#t~post4_Out_4|, main_~y~0=v_main_~y~0_Out_4, main_~x~0=v_main_~x~0_Out_4} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {347#(= main_~y~0 0)} is VALID [2022-04-15 12:16:18,795 INFO L290 TraceCheckUtils]: 7: Hoare triple {347#(= main_~y~0 0)} [41] L16-3_primed-->L16-3: Formula: (not (< (mod v_main_~y~0_4 4294967296) 1024)) InVars {main_~y~0=v_main_~y~0_4} OutVars{main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[] {343#false} is VALID [2022-04-15 12:16:18,795 INFO L272 TraceCheckUtils]: 8: Hoare triple {343#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {343#false} is VALID [2022-04-15 12:16:18,796 INFO L290 TraceCheckUtils]: 9: Hoare triple {343#false} ~cond := #in~cond; {343#false} is VALID [2022-04-15 12:16:18,796 INFO L290 TraceCheckUtils]: 10: Hoare triple {343#false} assume 0 == ~cond; {343#false} is VALID [2022-04-15 12:16:18,796 INFO L290 TraceCheckUtils]: 11: Hoare triple {343#false} assume !false; {343#false} is VALID [2022-04-15 12:16:18,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:16:18,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:18,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784585852] [2022-04-15 12:16:18,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784585852] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:18,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:18,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:16:18,833 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:18,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [923369537] [2022-04-15 12:16:18,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [923369537] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:18,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:18,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:16:18,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148370908] [2022-04-15 12:16:18,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:18,835 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-15 12:16:18,835 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:18,835 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:18,844 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:18,845 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 12:16:18,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:18,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 12:16:18,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 12:16:18,846 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:18,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:18,937 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-15 12:16:18,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 12:16:18,938 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-15 12:16:18,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:18,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:18,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2022-04-15 12:16:18,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:18,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2022-04-15 12:16:18,942 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 20 transitions. [2022-04-15 12:16:18,957 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:18,958 INFO L225 Difference]: With dead ends: 20 [2022-04-15 12:16:18,958 INFO L226 Difference]: Without dead ends: 15 [2022-04-15 12:16:18,959 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-04-15 12:16:18,965 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:18,966 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 28 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:16:18,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-15 12:16:18,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-15 12:16:18,971 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:18,971 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:18,972 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:18,972 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:18,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:18,974 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-15 12:16:18,974 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-15 12:16:18,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:18,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:18,975 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-15 12:16:18,975 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-15 12:16:18,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:18,979 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-15 12:16:18,979 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-15 12:16:18,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:18,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:18,979 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:18,979 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:18,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:18,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-15 12:16:18,980 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2022-04-15 12:16:18,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:18,981 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-15 12:16:18,981 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:18,981 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 15 transitions. [2022-04-15 12:16:19,003 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:19,003 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-15 12:16:19,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 12:16:19,004 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:19,004 INFO L499 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:19,004 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 12:16:19,005 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:19,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:19,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1905189066, now seen corresponding path program 3 times [2022-04-15 12:16:19,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:19,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [30718158] [2022-04-15 12:16:19,114 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:16:19,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1749097097, now seen corresponding path program 1 times [2022-04-15 12:16:19,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:19,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857571609] [2022-04-15 12:16:19,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:19,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:19,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:19,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:19,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:19,202 INFO L290 TraceCheckUtils]: 0: Hoare triple {465#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {459#true} is VALID [2022-04-15 12:16:19,202 INFO L290 TraceCheckUtils]: 1: Hoare triple {459#true} assume true; {459#true} is VALID [2022-04-15 12:16:19,202 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {459#true} {459#true} #34#return; {459#true} is VALID [2022-04-15 12:16:19,203 INFO L272 TraceCheckUtils]: 0: Hoare triple {459#true} call ULTIMATE.init(); {465#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:19,203 INFO L290 TraceCheckUtils]: 1: Hoare triple {465#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {459#true} is VALID [2022-04-15 12:16:19,203 INFO L290 TraceCheckUtils]: 2: Hoare triple {459#true} assume true; {459#true} is VALID [2022-04-15 12:16:19,203 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {459#true} {459#true} #34#return; {459#true} is VALID [2022-04-15 12:16:19,204 INFO L272 TraceCheckUtils]: 4: Hoare triple {459#true} call #t~ret5 := main(); {459#true} is VALID [2022-04-15 12:16:19,204 INFO L290 TraceCheckUtils]: 5: Hoare triple {459#true} ~x~0 := 1;~y~0 := 0; {464#(= main_~y~0 0)} is VALID [2022-04-15 12:16:19,205 INFO L290 TraceCheckUtils]: 6: Hoare triple {464#(= main_~y~0 0)} [44] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_In_3 v_main_~y~0_Out_6))) (or .cse0 (and (= v_main_~y~0_Out_6 0) .cse0 (= |v_main_#t~post4_Out_6| 1) (= v_main_~x~0_Out_6 0) (< (mod (+ 4294967295 v_main_~y~0_Out_6) 4294967296) 1024)))) InVars {main_~y~0=v_main_~y~0_In_3} OutVars{main_#t~post4=|v_main_#t~post4_Out_6|, main_~y~0=v_main_~y~0_Out_6, main_~x~0=v_main_~x~0_Out_6} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {464#(= main_~y~0 0)} is VALID [2022-04-15 12:16:19,205 INFO L290 TraceCheckUtils]: 7: Hoare triple {464#(= main_~y~0 0)} [43] L16-3_primed-->L16-3: Formula: (not (< (mod v_main_~y~0_4 4294967296) 1024)) InVars {main_~y~0=v_main_~y~0_4} OutVars{main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[] {460#false} is VALID [2022-04-15 12:16:19,205 INFO L272 TraceCheckUtils]: 8: Hoare triple {460#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {460#false} is VALID [2022-04-15 12:16:19,205 INFO L290 TraceCheckUtils]: 9: Hoare triple {460#false} ~cond := #in~cond; {460#false} is VALID [2022-04-15 12:16:19,206 INFO L290 TraceCheckUtils]: 10: Hoare triple {460#false} assume 0 == ~cond; {460#false} is VALID [2022-04-15 12:16:19,206 INFO L290 TraceCheckUtils]: 11: Hoare triple {460#false} assume !false; {460#false} is VALID [2022-04-15 12:16:19,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:16:19,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:19,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857571609] [2022-04-15 12:16:19,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857571609] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:19,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:19,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:16:19,260 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:19,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [30718158] [2022-04-15 12:16:19,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [30718158] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:19,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:19,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 12:16:19,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499576442] [2022-04-15 12:16:19,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:19,262 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 12:16:19,262 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:19,262 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:19,271 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:19,271 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 12:16:19,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:19,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 12:16:19,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-15 12:16:19,272 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:19,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:19,391 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-15 12:16:19,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 12:16:19,391 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 12:16:19,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:19,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:19,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2022-04-15 12:16:19,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:19,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2022-04-15 12:16:19,394 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 21 transitions. [2022-04-15 12:16:19,428 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:19,429 INFO L225 Difference]: With dead ends: 21 [2022-04-15 12:16:19,429 INFO L226 Difference]: Without dead ends: 16 [2022-04-15 12:16:19,429 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-15 12:16:19,430 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:19,430 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 33 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:16:19,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-15 12:16:19,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-15 12:16:19,433 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:19,433 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:19,434 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:19,434 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:19,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:19,435 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-15 12:16:19,435 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-15 12:16:19,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:19,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:19,436 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-15 12:16:19,436 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-15 12:16:19,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:19,437 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-15 12:16:19,437 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-15 12:16:19,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:19,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:19,437 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:19,437 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:19,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:19,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2022-04-15 12:16:19,438 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2022-04-15 12:16:19,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:19,439 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2022-04-15 12:16:19,439 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:19,439 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 16 transitions. [2022-04-15 12:16:19,454 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:19,454 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-15 12:16:19,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 12:16:19,454 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:19,455 INFO L499 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:19,455 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 12:16:19,455 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:19,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:19,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1105142364, now seen corresponding path program 4 times [2022-04-15 12:16:19,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:19,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2080946396] [2022-04-15 12:16:19,572 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:16:19,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1689991753, now seen corresponding path program 1 times [2022-04-15 12:16:19,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:19,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340235255] [2022-04-15 12:16:19,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:19,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:19,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:19,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:19,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:19,611 INFO L290 TraceCheckUtils]: 0: Hoare triple {591#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {585#true} is VALID [2022-04-15 12:16:19,611 INFO L290 TraceCheckUtils]: 1: Hoare triple {585#true} assume true; {585#true} is VALID [2022-04-15 12:16:19,611 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {585#true} {585#true} #34#return; {585#true} is VALID [2022-04-15 12:16:19,612 INFO L272 TraceCheckUtils]: 0: Hoare triple {585#true} call ULTIMATE.init(); {591#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:19,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {591#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {585#true} is VALID [2022-04-15 12:16:19,612 INFO L290 TraceCheckUtils]: 2: Hoare triple {585#true} assume true; {585#true} is VALID [2022-04-15 12:16:19,612 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {585#true} {585#true} #34#return; {585#true} is VALID [2022-04-15 12:16:19,612 INFO L272 TraceCheckUtils]: 4: Hoare triple {585#true} call #t~ret5 := main(); {585#true} is VALID [2022-04-15 12:16:19,613 INFO L290 TraceCheckUtils]: 5: Hoare triple {585#true} ~x~0 := 1;~y~0 := 0; {590#(= main_~y~0 0)} is VALID [2022-04-15 12:16:19,614 INFO L290 TraceCheckUtils]: 6: Hoare triple {590#(= main_~y~0 0)} [46] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_In_4 v_main_~y~0_Out_8))) (or .cse0 (and .cse0 (< (mod (+ 4294967295 v_main_~y~0_Out_8) 4294967296) 1024) (= v_main_~x~0_Out_8 0) (= |v_main_#t~post4_Out_8| 1) (= v_main_~y~0_Out_8 0)))) InVars {main_~y~0=v_main_~y~0_In_4} OutVars{main_#t~post4=|v_main_#t~post4_Out_8|, main_~y~0=v_main_~y~0_Out_8, main_~x~0=v_main_~x~0_Out_8} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {590#(= main_~y~0 0)} is VALID [2022-04-15 12:16:19,614 INFO L290 TraceCheckUtils]: 7: Hoare triple {590#(= main_~y~0 0)} [45] L16-3_primed-->L16-3: Formula: (not (< (mod v_main_~y~0_4 4294967296) 1024)) InVars {main_~y~0=v_main_~y~0_4} OutVars{main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[] {586#false} is VALID [2022-04-15 12:16:19,614 INFO L272 TraceCheckUtils]: 8: Hoare triple {586#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {586#false} is VALID [2022-04-15 12:16:19,615 INFO L290 TraceCheckUtils]: 9: Hoare triple {586#false} ~cond := #in~cond; {586#false} is VALID [2022-04-15 12:16:19,615 INFO L290 TraceCheckUtils]: 10: Hoare triple {586#false} assume 0 == ~cond; {586#false} is VALID [2022-04-15 12:16:19,615 INFO L290 TraceCheckUtils]: 11: Hoare triple {586#false} assume !false; {586#false} is VALID [2022-04-15 12:16:19,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:16:19,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:19,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340235255] [2022-04-15 12:16:19,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340235255] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:19,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:19,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:16:19,682 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:19,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2080946396] [2022-04-15 12:16:19,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2080946396] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:19,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:19,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:16:19,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75502839] [2022-04-15 12:16:19,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:19,684 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 12:16:19,684 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:19,684 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:19,696 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:19,696 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 12:16:19,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:19,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 12:16:19,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-15 12:16:19,698 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:19,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:19,848 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-15 12:16:19,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 12:16:19,849 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 12:16:19,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:19,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:19,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2022-04-15 12:16:19,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:19,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2022-04-15 12:16:19,854 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 22 transitions. [2022-04-15 12:16:19,869 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:19,871 INFO L225 Difference]: With dead ends: 22 [2022-04-15 12:16:19,871 INFO L226 Difference]: Without dead ends: 17 [2022-04-15 12:16:19,872 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-15 12:16:19,873 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:19,873 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 38 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:16:19,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-15 12:16:19,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-15 12:16:19,878 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:19,878 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:19,878 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:19,879 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:19,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:19,881 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-15 12:16:19,881 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-15 12:16:19,881 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:19,881 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:19,881 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-15 12:16:19,882 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-15 12:16:19,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:19,883 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-15 12:16:19,883 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-15 12:16:19,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:19,884 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:19,884 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:19,884 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:19,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:19,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2022-04-15 12:16:19,885 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2022-04-15 12:16:19,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:19,886 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2022-04-15 12:16:19,886 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:19,886 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 17 transitions. [2022-04-15 12:16:19,898 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:19,899 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-15 12:16:19,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-15 12:16:19,899 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:19,899 INFO L499 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:19,899 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 12:16:19,900 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:19,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:19,902 INFO L85 PathProgramCache]: Analyzing trace with hash -63863818, now seen corresponding path program 5 times [2022-04-15 12:16:19,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:19,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2142343161] [2022-04-15 12:16:19,986 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:16:19,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1630886409, now seen corresponding path program 1 times [2022-04-15 12:16:19,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:19,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899924325] [2022-04-15 12:16:19,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:19,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:19,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:20,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:20,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:20,068 INFO L290 TraceCheckUtils]: 0: Hoare triple {726#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {720#true} is VALID [2022-04-15 12:16:20,069 INFO L290 TraceCheckUtils]: 1: Hoare triple {720#true} assume true; {720#true} is VALID [2022-04-15 12:16:20,069 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {720#true} {720#true} #34#return; {720#true} is VALID [2022-04-15 12:16:20,069 INFO L272 TraceCheckUtils]: 0: Hoare triple {720#true} call ULTIMATE.init(); {726#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:20,070 INFO L290 TraceCheckUtils]: 1: Hoare triple {726#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {720#true} is VALID [2022-04-15 12:16:20,070 INFO L290 TraceCheckUtils]: 2: Hoare triple {720#true} assume true; {720#true} is VALID [2022-04-15 12:16:20,070 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {720#true} {720#true} #34#return; {720#true} is VALID [2022-04-15 12:16:20,070 INFO L272 TraceCheckUtils]: 4: Hoare triple {720#true} call #t~ret5 := main(); {720#true} is VALID [2022-04-15 12:16:20,070 INFO L290 TraceCheckUtils]: 5: Hoare triple {720#true} ~x~0 := 1;~y~0 := 0; {725#(= main_~y~0 0)} is VALID [2022-04-15 12:16:20,071 INFO L290 TraceCheckUtils]: 6: Hoare triple {725#(= main_~y~0 0)} [48] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_Out_10 0) (= v_main_~x~0_Out_10 0) (= |v_main_#t~post4_Out_10| 1) (= v_main_~y~0_Out_10 v_main_~y~0_In_5) (< (mod (+ 4294967295 v_main_~y~0_Out_10) 4294967296) 1024)) (= v_main_~y~0_In_5 v_main_~y~0_Out_10)) InVars {main_~y~0=v_main_~y~0_In_5} OutVars{main_#t~post4=|v_main_#t~post4_Out_10|, main_~y~0=v_main_~y~0_Out_10, main_~x~0=v_main_~x~0_Out_10} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {725#(= main_~y~0 0)} is VALID [2022-04-15 12:16:20,071 INFO L290 TraceCheckUtils]: 7: Hoare triple {725#(= main_~y~0 0)} [47] L16-3_primed-->L16-3: Formula: (not (< (mod v_main_~y~0_4 4294967296) 1024)) InVars {main_~y~0=v_main_~y~0_4} OutVars{main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[] {721#false} is VALID [2022-04-15 12:16:20,072 INFO L272 TraceCheckUtils]: 8: Hoare triple {721#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {721#false} is VALID [2022-04-15 12:16:20,072 INFO L290 TraceCheckUtils]: 9: Hoare triple {721#false} ~cond := #in~cond; {721#false} is VALID [2022-04-15 12:16:20,072 INFO L290 TraceCheckUtils]: 10: Hoare triple {721#false} assume 0 == ~cond; {721#false} is VALID [2022-04-15 12:16:20,072 INFO L290 TraceCheckUtils]: 11: Hoare triple {721#false} assume !false; {721#false} is VALID [2022-04-15 12:16:20,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:16:20,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:20,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899924325] [2022-04-15 12:16:20,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899924325] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:20,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:20,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:16:20,137 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:20,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2142343161] [2022-04-15 12:16:20,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2142343161] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:20,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:20,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 12:16:20,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904590655] [2022-04-15 12:16:20,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:20,138 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 12:16:20,140 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:20,140 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:20,151 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:20,151 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 12:16:20,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:20,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 12:16:20,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-04-15 12:16:20,152 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:20,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:20,354 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-15 12:16:20,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 12:16:20,354 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 12:16:20,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:20,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:20,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 23 transitions. [2022-04-15 12:16:20,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:20,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 23 transitions. [2022-04-15 12:16:20,356 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 23 transitions. [2022-04-15 12:16:20,373 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:20,374 INFO L225 Difference]: With dead ends: 23 [2022-04-15 12:16:20,374 INFO L226 Difference]: Without dead ends: 18 [2022-04-15 12:16:20,375 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-15 12:16:20,375 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:20,375 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 43 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:16:20,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-15 12:16:20,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-15 12:16:20,377 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:20,378 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:20,378 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:20,378 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:20,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:20,378 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-15 12:16:20,379 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-15 12:16:20,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:20,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:20,379 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-15 12:16:20,379 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-15 12:16:20,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:20,380 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-15 12:16:20,380 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-15 12:16:20,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:20,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:20,380 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:20,380 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:20,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:20,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2022-04-15 12:16:20,381 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2022-04-15 12:16:20,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:20,381 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2022-04-15 12:16:20,381 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:20,381 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 18 transitions. [2022-04-15 12:16:20,394 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:20,395 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-15 12:16:20,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 12:16:20,395 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:20,395 INFO L499 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:20,395 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-15 12:16:20,395 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:20,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:20,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1943317092, now seen corresponding path program 6 times [2022-04-15 12:16:20,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:20,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2045671945] [2022-04-15 12:16:20,457 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:16:20,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1571781065, now seen corresponding path program 1 times [2022-04-15 12:16:20,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:20,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947220327] [2022-04-15 12:16:20,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:20,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:20,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:20,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:20,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:20,536 INFO L290 TraceCheckUtils]: 0: Hoare triple {870#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {864#true} is VALID [2022-04-15 12:16:20,536 INFO L290 TraceCheckUtils]: 1: Hoare triple {864#true} assume true; {864#true} is VALID [2022-04-15 12:16:20,536 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {864#true} {864#true} #34#return; {864#true} is VALID [2022-04-15 12:16:20,537 INFO L272 TraceCheckUtils]: 0: Hoare triple {864#true} call ULTIMATE.init(); {870#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:20,537 INFO L290 TraceCheckUtils]: 1: Hoare triple {870#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {864#true} is VALID [2022-04-15 12:16:20,537 INFO L290 TraceCheckUtils]: 2: Hoare triple {864#true} assume true; {864#true} is VALID [2022-04-15 12:16:20,537 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {864#true} {864#true} #34#return; {864#true} is VALID [2022-04-15 12:16:20,537 INFO L272 TraceCheckUtils]: 4: Hoare triple {864#true} call #t~ret5 := main(); {864#true} is VALID [2022-04-15 12:16:20,538 INFO L290 TraceCheckUtils]: 5: Hoare triple {864#true} ~x~0 := 1;~y~0 := 0; {869#(= main_~y~0 0)} is VALID [2022-04-15 12:16:20,538 INFO L290 TraceCheckUtils]: 6: Hoare triple {869#(= main_~y~0 0)} [50] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_Out_12 0) (= v_main_~y~0_Out_12 v_main_~y~0_In_6) (= v_main_~y~0_Out_12 0) (= |v_main_#t~post4_Out_12| 1) (< (mod (+ 4294967295 v_main_~y~0_Out_12) 4294967296) 1024)) (= v_main_~y~0_In_6 v_main_~y~0_Out_12)) InVars {main_~y~0=v_main_~y~0_In_6} OutVars{main_#t~post4=|v_main_#t~post4_Out_12|, main_~y~0=v_main_~y~0_Out_12, main_~x~0=v_main_~x~0_Out_12} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {869#(= main_~y~0 0)} is VALID [2022-04-15 12:16:20,539 INFO L290 TraceCheckUtils]: 7: Hoare triple {869#(= main_~y~0 0)} [49] L16-3_primed-->L16-3: Formula: (not (< (mod v_main_~y~0_4 4294967296) 1024)) InVars {main_~y~0=v_main_~y~0_4} OutVars{main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[] {865#false} is VALID [2022-04-15 12:16:20,539 INFO L272 TraceCheckUtils]: 8: Hoare triple {865#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {865#false} is VALID [2022-04-15 12:16:20,539 INFO L290 TraceCheckUtils]: 9: Hoare triple {865#false} ~cond := #in~cond; {865#false} is VALID [2022-04-15 12:16:20,539 INFO L290 TraceCheckUtils]: 10: Hoare triple {865#false} assume 0 == ~cond; {865#false} is VALID [2022-04-15 12:16:20,539 INFO L290 TraceCheckUtils]: 11: Hoare triple {865#false} assume !false; {865#false} is VALID [2022-04-15 12:16:20,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:16:20,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:20,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947220327] [2022-04-15 12:16:20,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947220327] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:20,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:20,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:16:20,654 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:20,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2045671945] [2022-04-15 12:16:20,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2045671945] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:20,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:20,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 12:16:20,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587914704] [2022-04-15 12:16:20,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:20,656 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 12:16:20,656 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:20,656 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:20,673 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:20,674 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 12:16:20,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:20,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 12:16:20,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-04-15 12:16:20,675 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:20,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:20,951 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-15 12:16:20,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 12:16:20,951 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 12:16:20,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:20,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:20,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 24 transitions. [2022-04-15 12:16:20,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:20,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 24 transitions. [2022-04-15 12:16:20,954 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 24 transitions. [2022-04-15 12:16:20,973 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:20,973 INFO L225 Difference]: With dead ends: 24 [2022-04-15 12:16:20,974 INFO L226 Difference]: Without dead ends: 19 [2022-04-15 12:16:20,974 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-15 12:16:20,974 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:20,975 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 48 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:16:20,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-15 12:16:20,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-15 12:16:20,976 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:20,977 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:20,977 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:20,977 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:20,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:20,978 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-15 12:16:20,978 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-15 12:16:20,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:20,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:20,978 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-15 12:16:20,978 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-15 12:16:20,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:20,979 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-15 12:16:20,979 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-15 12:16:20,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:20,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:20,979 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:20,979 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:20,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:20,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2022-04-15 12:16:20,980 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2022-04-15 12:16:20,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:20,980 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2022-04-15 12:16:20,980 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:20,980 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 19 transitions. [2022-04-15 12:16:21,012 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:21,013 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-15 12:16:21,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 12:16:21,014 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:21,014 INFO L499 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:21,014 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-15 12:16:21,014 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:21,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:21,015 INFO L85 PathProgramCache]: Analyzing trace with hash -76826442, now seen corresponding path program 7 times [2022-04-15 12:16:21,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:21,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1059581393] [2022-04-15 12:16:21,076 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:16:21,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1512675721, now seen corresponding path program 1 times [2022-04-15 12:16:21,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:21,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785766498] [2022-04-15 12:16:21,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:21,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:21,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:21,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:21,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:21,121 INFO L290 TraceCheckUtils]: 0: Hoare triple {1023#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1017#true} is VALID [2022-04-15 12:16:21,121 INFO L290 TraceCheckUtils]: 1: Hoare triple {1017#true} assume true; {1017#true} is VALID [2022-04-15 12:16:21,121 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1017#true} {1017#true} #34#return; {1017#true} is VALID [2022-04-15 12:16:21,127 INFO L272 TraceCheckUtils]: 0: Hoare triple {1017#true} call ULTIMATE.init(); {1023#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:21,128 INFO L290 TraceCheckUtils]: 1: Hoare triple {1023#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1017#true} is VALID [2022-04-15 12:16:21,128 INFO L290 TraceCheckUtils]: 2: Hoare triple {1017#true} assume true; {1017#true} is VALID [2022-04-15 12:16:21,128 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1017#true} {1017#true} #34#return; {1017#true} is VALID [2022-04-15 12:16:21,128 INFO L272 TraceCheckUtils]: 4: Hoare triple {1017#true} call #t~ret5 := main(); {1017#true} is VALID [2022-04-15 12:16:21,129 INFO L290 TraceCheckUtils]: 5: Hoare triple {1017#true} ~x~0 := 1;~y~0 := 0; {1022#(= main_~y~0 0)} is VALID [2022-04-15 12:16:21,129 INFO L290 TraceCheckUtils]: 6: Hoare triple {1022#(= main_~y~0 0)} [52] L16-2-->L16-3_primed: Formula: (or (= v_main_~y~0_In_7 v_main_~y~0_Out_14) (and (= v_main_~y~0_Out_14 0) (= v_main_~x~0_Out_14 0) (= |v_main_#t~post4_Out_14| 1) (< (mod (+ 4294967295 v_main_~y~0_Out_14) 4294967296) 1024) (= v_main_~y~0_Out_14 v_main_~y~0_In_7))) InVars {main_~y~0=v_main_~y~0_In_7} OutVars{main_#t~post4=|v_main_#t~post4_Out_14|, main_~y~0=v_main_~y~0_Out_14, main_~x~0=v_main_~x~0_Out_14} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {1022#(= main_~y~0 0)} is VALID [2022-04-15 12:16:21,130 INFO L290 TraceCheckUtils]: 7: Hoare triple {1022#(= main_~y~0 0)} [51] L16-3_primed-->L16-3: Formula: (not (< (mod v_main_~y~0_4 4294967296) 1024)) InVars {main_~y~0=v_main_~y~0_4} OutVars{main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[] {1018#false} is VALID [2022-04-15 12:16:21,130 INFO L272 TraceCheckUtils]: 8: Hoare triple {1018#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {1018#false} is VALID [2022-04-15 12:16:21,130 INFO L290 TraceCheckUtils]: 9: Hoare triple {1018#false} ~cond := #in~cond; {1018#false} is VALID [2022-04-15 12:16:21,130 INFO L290 TraceCheckUtils]: 10: Hoare triple {1018#false} assume 0 == ~cond; {1018#false} is VALID [2022-04-15 12:16:21,130 INFO L290 TraceCheckUtils]: 11: Hoare triple {1018#false} assume !false; {1018#false} is VALID [2022-04-15 12:16:21,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:16:21,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:21,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785766498] [2022-04-15 12:16:21,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785766498] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:21,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:21,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:16:21,231 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:21,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1059581393] [2022-04-15 12:16:21,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1059581393] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:21,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:21,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 12:16:21,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064319844] [2022-04-15 12:16:21,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:21,233 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-15 12:16:21,233 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:21,234 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:21,247 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:21,247 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 12:16:21,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:21,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 12:16:21,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-04-15 12:16:21,248 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:21,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:21,541 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-15 12:16:21,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 12:16:21,541 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-15 12:16:21,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:21,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:21,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 25 transitions. [2022-04-15 12:16:21,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:21,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 25 transitions. [2022-04-15 12:16:21,550 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 25 transitions. [2022-04-15 12:16:21,569 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 12:16:21,570 INFO L225 Difference]: With dead ends: 25 [2022-04-15 12:16:21,571 INFO L226 Difference]: Without dead ends: 20 [2022-04-15 12:16:21,571 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-04-15 12:16:21,573 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:21,573 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 53 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:16:21,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-15 12:16:21,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-04-15 12:16:21,576 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:21,577 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:21,577 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:21,577 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:21,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:21,579 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-15 12:16:21,579 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-15 12:16:21,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:21,580 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:21,580 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-15 12:16:21,580 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-15 12:16:21,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:21,581 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-15 12:16:21,581 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-15 12:16:21,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:21,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:21,581 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:21,581 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:21,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:21,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2022-04-15 12:16:21,582 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2022-04-15 12:16:21,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:21,582 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2022-04-15 12:16:21,582 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:21,582 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 20 transitions. [2022-04-15 12:16:21,598 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:21,598 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-15 12:16:21,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 12:16:21,598 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:21,599 INFO L499 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:21,599 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-15 12:16:21,599 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:21,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:21,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1949808860, now seen corresponding path program 8 times [2022-04-15 12:16:21,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:21,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1488411416] [2022-04-15 12:16:21,667 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:16:21,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1453570377, now seen corresponding path program 1 times [2022-04-15 12:16:21,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:21,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551292928] [2022-04-15 12:16:21,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:21,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:21,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:21,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:21,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:21,709 INFO L290 TraceCheckUtils]: 0: Hoare triple {1185#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1179#true} is VALID [2022-04-15 12:16:21,709 INFO L290 TraceCheckUtils]: 1: Hoare triple {1179#true} assume true; {1179#true} is VALID [2022-04-15 12:16:21,709 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1179#true} {1179#true} #34#return; {1179#true} is VALID [2022-04-15 12:16:21,710 INFO L272 TraceCheckUtils]: 0: Hoare triple {1179#true} call ULTIMATE.init(); {1185#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:21,710 INFO L290 TraceCheckUtils]: 1: Hoare triple {1185#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1179#true} is VALID [2022-04-15 12:16:21,710 INFO L290 TraceCheckUtils]: 2: Hoare triple {1179#true} assume true; {1179#true} is VALID [2022-04-15 12:16:21,710 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1179#true} {1179#true} #34#return; {1179#true} is VALID [2022-04-15 12:16:21,710 INFO L272 TraceCheckUtils]: 4: Hoare triple {1179#true} call #t~ret5 := main(); {1179#true} is VALID [2022-04-15 12:16:21,711 INFO L290 TraceCheckUtils]: 5: Hoare triple {1179#true} ~x~0 := 1;~y~0 := 0; {1184#(= main_~y~0 0)} is VALID [2022-04-15 12:16:21,711 INFO L290 TraceCheckUtils]: 6: Hoare triple {1184#(= main_~y~0 0)} [54] L16-2-->L16-3_primed: Formula: (or (and (< (mod (+ 4294967295 v_main_~y~0_Out_16) 4294967296) 1024) (= v_main_~x~0_Out_16 0) (= v_main_~y~0_Out_16 v_main_~y~0_In_8) (= v_main_~y~0_Out_16 0) (= |v_main_#t~post4_Out_16| 1)) (= v_main_~y~0_In_8 v_main_~y~0_Out_16)) InVars {main_~y~0=v_main_~y~0_In_8} OutVars{main_#t~post4=|v_main_#t~post4_Out_16|, main_~y~0=v_main_~y~0_Out_16, main_~x~0=v_main_~x~0_Out_16} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {1184#(= main_~y~0 0)} is VALID [2022-04-15 12:16:21,712 INFO L290 TraceCheckUtils]: 7: Hoare triple {1184#(= main_~y~0 0)} [53] L16-3_primed-->L16-3: Formula: (not (< (mod v_main_~y~0_4 4294967296) 1024)) InVars {main_~y~0=v_main_~y~0_4} OutVars{main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[] {1180#false} is VALID [2022-04-15 12:16:21,712 INFO L272 TraceCheckUtils]: 8: Hoare triple {1180#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {1180#false} is VALID [2022-04-15 12:16:21,712 INFO L290 TraceCheckUtils]: 9: Hoare triple {1180#false} ~cond := #in~cond; {1180#false} is VALID [2022-04-15 12:16:21,712 INFO L290 TraceCheckUtils]: 10: Hoare triple {1180#false} assume 0 == ~cond; {1180#false} is VALID [2022-04-15 12:16:21,712 INFO L290 TraceCheckUtils]: 11: Hoare triple {1180#false} assume !false; {1180#false} is VALID [2022-04-15 12:16:21,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:16:21,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:21,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551292928] [2022-04-15 12:16:21,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551292928] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:21,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:21,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:16:21,849 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:21,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1488411416] [2022-04-15 12:16:21,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1488411416] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:21,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:21,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 12:16:21,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816582505] [2022-04-15 12:16:21,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:21,850 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 12:16:21,850 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:21,850 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:21,862 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:21,862 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 12:16:21,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:21,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 12:16:21,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-04-15 12:16:21,863 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:22,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:22,230 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-15 12:16:22,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 12:16:22,230 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 12:16:22,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:22,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:22,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 26 transitions. [2022-04-15 12:16:22,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:22,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 26 transitions. [2022-04-15 12:16:22,245 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 26 transitions. [2022-04-15 12:16:22,263 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:22,264 INFO L225 Difference]: With dead ends: 26 [2022-04-15 12:16:22,264 INFO L226 Difference]: Without dead ends: 21 [2022-04-15 12:16:22,265 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2022-04-15 12:16:22,266 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:22,267 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 58 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:16:22,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-15 12:16:22,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-04-15 12:16:22,269 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:22,269 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:22,269 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:22,270 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:22,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:22,271 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-15 12:16:22,271 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-15 12:16:22,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:22,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:22,273 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-15 12:16:22,273 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-15 12:16:22,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:22,273 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-15 12:16:22,273 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-15 12:16:22,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:22,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:22,273 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:22,274 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:22,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:22,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2022-04-15 12:16:22,275 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2022-04-15 12:16:22,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:22,275 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2022-04-15 12:16:22,275 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:22,275 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 21 transitions. [2022-04-15 12:16:22,290 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:22,290 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-15 12:16:22,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 12:16:22,290 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:22,290 INFO L499 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:22,291 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-15 12:16:22,291 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:22,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:22,291 INFO L85 PathProgramCache]: Analyzing trace with hash 350993782, now seen corresponding path program 9 times [2022-04-15 12:16:22,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:22,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2125948517] [2022-04-15 12:16:22,369 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:16:22,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1394465033, now seen corresponding path program 1 times [2022-04-15 12:16:22,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:22,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215394384] [2022-04-15 12:16:22,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:22,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:22,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:22,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:22,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:22,427 INFO L290 TraceCheckUtils]: 0: Hoare triple {1356#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1350#true} is VALID [2022-04-15 12:16:22,427 INFO L290 TraceCheckUtils]: 1: Hoare triple {1350#true} assume true; {1350#true} is VALID [2022-04-15 12:16:22,428 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1350#true} {1350#true} #34#return; {1350#true} is VALID [2022-04-15 12:16:22,428 INFO L272 TraceCheckUtils]: 0: Hoare triple {1350#true} call ULTIMATE.init(); {1356#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:22,428 INFO L290 TraceCheckUtils]: 1: Hoare triple {1356#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1350#true} is VALID [2022-04-15 12:16:22,428 INFO L290 TraceCheckUtils]: 2: Hoare triple {1350#true} assume true; {1350#true} is VALID [2022-04-15 12:16:22,428 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1350#true} {1350#true} #34#return; {1350#true} is VALID [2022-04-15 12:16:22,428 INFO L272 TraceCheckUtils]: 4: Hoare triple {1350#true} call #t~ret5 := main(); {1350#true} is VALID [2022-04-15 12:16:22,429 INFO L290 TraceCheckUtils]: 5: Hoare triple {1350#true} ~x~0 := 1;~y~0 := 0; {1355#(= main_~y~0 0)} is VALID [2022-04-15 12:16:22,429 INFO L290 TraceCheckUtils]: 6: Hoare triple {1355#(= main_~y~0 0)} [56] L16-2-->L16-3_primed: Formula: (or (= v_main_~y~0_In_9 v_main_~y~0_Out_18) (and (= v_main_~y~0_Out_18 0) (= v_main_~y~0_Out_18 v_main_~y~0_In_9) (= |v_main_#t~post4_Out_18| 1) (< (mod (+ 4294967295 v_main_~y~0_Out_18) 4294967296) 1024) (= v_main_~x~0_Out_18 0))) InVars {main_~y~0=v_main_~y~0_In_9} OutVars{main_#t~post4=|v_main_#t~post4_Out_18|, main_~y~0=v_main_~y~0_Out_18, main_~x~0=v_main_~x~0_Out_18} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {1355#(= main_~y~0 0)} is VALID [2022-04-15 12:16:22,430 INFO L290 TraceCheckUtils]: 7: Hoare triple {1355#(= main_~y~0 0)} [55] L16-3_primed-->L16-3: Formula: (not (< (mod v_main_~y~0_4 4294967296) 1024)) InVars {main_~y~0=v_main_~y~0_4} OutVars{main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[] {1351#false} is VALID [2022-04-15 12:16:22,430 INFO L272 TraceCheckUtils]: 8: Hoare triple {1351#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {1351#false} is VALID [2022-04-15 12:16:22,430 INFO L290 TraceCheckUtils]: 9: Hoare triple {1351#false} ~cond := #in~cond; {1351#false} is VALID [2022-04-15 12:16:22,430 INFO L290 TraceCheckUtils]: 10: Hoare triple {1351#false} assume 0 == ~cond; {1351#false} is VALID [2022-04-15 12:16:22,430 INFO L290 TraceCheckUtils]: 11: Hoare triple {1351#false} assume !false; {1351#false} is VALID [2022-04-15 12:16:22,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:16:22,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:22,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215394384] [2022-04-15 12:16:22,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215394384] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:22,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:22,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:16:22,574 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:22,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2125948517] [2022-04-15 12:16:22,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2125948517] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:22,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:22,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 12:16:22,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568074459] [2022-04-15 12:16:22,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:22,575 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-15 12:16:22,576 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:22,576 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:22,590 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:22,590 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 12:16:22,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:22,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 12:16:22,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2022-04-15 12:16:22,591 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:22,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:22,966 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-15 12:16:22,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 12:16:22,967 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-15 12:16:22,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:22,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:22,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 27 transitions. [2022-04-15 12:16:22,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:22,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 27 transitions. [2022-04-15 12:16:22,969 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 27 transitions. [2022-04-15 12:16:22,990 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:22,991 INFO L225 Difference]: With dead ends: 27 [2022-04-15 12:16:22,991 INFO L226 Difference]: Without dead ends: 22 [2022-04-15 12:16:22,992 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2022-04-15 12:16:22,992 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:22,993 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 63 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:16:22,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-15 12:16:22,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-04-15 12:16:22,995 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:22,995 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:22,995 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:22,995 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:22,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:22,996 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-15 12:16:22,996 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-15 12:16:22,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:22,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:22,997 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-15 12:16:22,997 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-15 12:16:22,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:22,997 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-15 12:16:22,998 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-15 12:16:22,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:22,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:22,998 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:22,998 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:22,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:22,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2022-04-15 12:16:22,999 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2022-04-15 12:16:22,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:22,999 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2022-04-15 12:16:22,999 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:22,999 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 22 transitions. [2022-04-15 12:16:23,019 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:23,019 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-15 12:16:23,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 12:16:23,020 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:23,020 INFO L499 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:23,020 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-15 12:16:23,020 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:23,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:23,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1967633380, now seen corresponding path program 10 times [2022-04-15 12:16:23,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:23,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [924890614] [2022-04-15 12:16:23,093 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:16:23,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1335359689, now seen corresponding path program 1 times [2022-04-15 12:16:23,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:23,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519474063] [2022-04-15 12:16:23,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:23,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:23,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:23,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:23,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:23,125 INFO L290 TraceCheckUtils]: 0: Hoare triple {1536#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1530#true} is VALID [2022-04-15 12:16:23,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {1530#true} assume true; {1530#true} is VALID [2022-04-15 12:16:23,125 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1530#true} {1530#true} #34#return; {1530#true} is VALID [2022-04-15 12:16:23,126 INFO L272 TraceCheckUtils]: 0: Hoare triple {1530#true} call ULTIMATE.init(); {1536#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:23,126 INFO L290 TraceCheckUtils]: 1: Hoare triple {1536#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1530#true} is VALID [2022-04-15 12:16:23,126 INFO L290 TraceCheckUtils]: 2: Hoare triple {1530#true} assume true; {1530#true} is VALID [2022-04-15 12:16:23,126 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1530#true} {1530#true} #34#return; {1530#true} is VALID [2022-04-15 12:16:23,127 INFO L272 TraceCheckUtils]: 4: Hoare triple {1530#true} call #t~ret5 := main(); {1530#true} is VALID [2022-04-15 12:16:23,127 INFO L290 TraceCheckUtils]: 5: Hoare triple {1530#true} ~x~0 := 1;~y~0 := 0; {1535#(= main_~y~0 0)} is VALID [2022-04-15 12:16:23,127 INFO L290 TraceCheckUtils]: 6: Hoare triple {1535#(= main_~y~0 0)} [58] L16-2-->L16-3_primed: Formula: (or (= v_main_~y~0_In_10 v_main_~y~0_Out_20) (and (= v_main_~x~0_Out_20 0) (= v_main_~y~0_Out_20 v_main_~y~0_In_10) (< (mod (+ 4294967295 v_main_~y~0_Out_20) 4294967296) 1024) (= v_main_~y~0_Out_20 0) (= |v_main_#t~post4_Out_20| 1))) InVars {main_~y~0=v_main_~y~0_In_10} OutVars{main_#t~post4=|v_main_#t~post4_Out_20|, main_~y~0=v_main_~y~0_Out_20, main_~x~0=v_main_~x~0_Out_20} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {1535#(= main_~y~0 0)} is VALID [2022-04-15 12:16:23,128 INFO L290 TraceCheckUtils]: 7: Hoare triple {1535#(= main_~y~0 0)} [57] L16-3_primed-->L16-3: Formula: (not (< (mod v_main_~y~0_4 4294967296) 1024)) InVars {main_~y~0=v_main_~y~0_4} OutVars{main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[] {1531#false} is VALID [2022-04-15 12:16:23,128 INFO L272 TraceCheckUtils]: 8: Hoare triple {1531#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {1531#false} is VALID [2022-04-15 12:16:23,128 INFO L290 TraceCheckUtils]: 9: Hoare triple {1531#false} ~cond := #in~cond; {1531#false} is VALID [2022-04-15 12:16:23,128 INFO L290 TraceCheckUtils]: 10: Hoare triple {1531#false} assume 0 == ~cond; {1531#false} is VALID [2022-04-15 12:16:23,128 INFO L290 TraceCheckUtils]: 11: Hoare triple {1531#false} assume !false; {1531#false} is VALID [2022-04-15 12:16:23,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:16:23,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:23,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519474063] [2022-04-15 12:16:23,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519474063] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:23,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:23,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:16:23,283 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:23,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [924890614] [2022-04-15 12:16:23,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [924890614] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:23,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:23,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 12:16:23,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337298737] [2022-04-15 12:16:23,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:23,284 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-15 12:16:23,284 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:23,285 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:23,299 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:23,299 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 12:16:23,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:23,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 12:16:23,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2022-04-15 12:16:23,301 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:23,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:23,756 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-15 12:16:23,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 12:16:23,757 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-15 12:16:23,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:23,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:23,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 28 transitions. [2022-04-15 12:16:23,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:23,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 28 transitions. [2022-04-15 12:16:23,761 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 28 transitions. [2022-04-15 12:16:23,781 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:23,782 INFO L225 Difference]: With dead ends: 28 [2022-04-15 12:16:23,783 INFO L226 Difference]: Without dead ends: 23 [2022-04-15 12:16:23,783 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2022-04-15 12:16:23,784 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:23,784 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 68 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:16:23,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-15 12:16:23,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-15 12:16:23,787 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:23,788 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:23,791 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:23,791 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:23,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:23,792 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-15 12:16:23,792 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-04-15 12:16:23,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:23,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:23,792 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-15 12:16:23,792 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-15 12:16:23,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:23,793 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-15 12:16:23,793 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-04-15 12:16:23,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:23,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:23,793 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:23,793 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:23,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:23,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2022-04-15 12:16:23,794 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2022-04-15 12:16:23,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:23,794 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2022-04-15 12:16:23,794 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:23,794 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 23 transitions. [2022-04-15 12:16:23,811 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:23,812 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-04-15 12:16:23,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 12:16:23,812 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:23,812 INFO L499 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:23,812 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-15 12:16:23,812 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:23,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:23,813 INFO L85 PathProgramCache]: Analyzing trace with hash -830631370, now seen corresponding path program 11 times [2022-04-15 12:16:23,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:23,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [161708300] [2022-04-15 12:16:23,872 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:16:23,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1276254345, now seen corresponding path program 1 times [2022-04-15 12:16:23,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:23,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547027784] [2022-04-15 12:16:23,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:23,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:23,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:23,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:23,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:23,917 INFO L290 TraceCheckUtils]: 0: Hoare triple {1725#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1719#true} is VALID [2022-04-15 12:16:23,917 INFO L290 TraceCheckUtils]: 1: Hoare triple {1719#true} assume true; {1719#true} is VALID [2022-04-15 12:16:23,917 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1719#true} {1719#true} #34#return; {1719#true} is VALID [2022-04-15 12:16:23,919 INFO L272 TraceCheckUtils]: 0: Hoare triple {1719#true} call ULTIMATE.init(); {1725#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:23,919 INFO L290 TraceCheckUtils]: 1: Hoare triple {1725#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1719#true} is VALID [2022-04-15 12:16:23,919 INFO L290 TraceCheckUtils]: 2: Hoare triple {1719#true} assume true; {1719#true} is VALID [2022-04-15 12:16:23,919 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1719#true} {1719#true} #34#return; {1719#true} is VALID [2022-04-15 12:16:23,919 INFO L272 TraceCheckUtils]: 4: Hoare triple {1719#true} call #t~ret5 := main(); {1719#true} is VALID [2022-04-15 12:16:23,919 INFO L290 TraceCheckUtils]: 5: Hoare triple {1719#true} ~x~0 := 1;~y~0 := 0; {1724#(= main_~y~0 0)} is VALID [2022-04-15 12:16:23,920 INFO L290 TraceCheckUtils]: 6: Hoare triple {1724#(= main_~y~0 0)} [60] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_Out_22 v_main_~y~0_In_11) (< (mod (+ 4294967295 v_main_~y~0_Out_22) 4294967296) 1024) (= v_main_~y~0_Out_22 0) (= |v_main_#t~post4_Out_22| 1) (= v_main_~x~0_Out_22 0)) (= v_main_~y~0_In_11 v_main_~y~0_Out_22)) InVars {main_~y~0=v_main_~y~0_In_11} OutVars{main_#t~post4=|v_main_#t~post4_Out_22|, main_~y~0=v_main_~y~0_Out_22, main_~x~0=v_main_~x~0_Out_22} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {1724#(= main_~y~0 0)} is VALID [2022-04-15 12:16:23,920 INFO L290 TraceCheckUtils]: 7: Hoare triple {1724#(= main_~y~0 0)} [59] L16-3_primed-->L16-3: Formula: (not (< (mod v_main_~y~0_4 4294967296) 1024)) InVars {main_~y~0=v_main_~y~0_4} OutVars{main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[] {1720#false} is VALID [2022-04-15 12:16:23,920 INFO L272 TraceCheckUtils]: 8: Hoare triple {1720#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {1720#false} is VALID [2022-04-15 12:16:23,920 INFO L290 TraceCheckUtils]: 9: Hoare triple {1720#false} ~cond := #in~cond; {1720#false} is VALID [2022-04-15 12:16:23,920 INFO L290 TraceCheckUtils]: 10: Hoare triple {1720#false} assume 0 == ~cond; {1720#false} is VALID [2022-04-15 12:16:23,921 INFO L290 TraceCheckUtils]: 11: Hoare triple {1720#false} assume !false; {1720#false} is VALID [2022-04-15 12:16:23,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:16:23,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:23,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547027784] [2022-04-15 12:16:23,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547027784] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:23,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:23,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:16:24,083 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:24,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [161708300] [2022-04-15 12:16:24,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [161708300] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:24,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:24,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 12:16:24,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618754289] [2022-04-15 12:16:24,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:24,084 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-15 12:16:24,084 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:24,085 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:24,114 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:24,115 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 12:16:24,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:24,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 12:16:24,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2022-04-15 12:16:24,115 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:24,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:24,611 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-04-15 12:16:24,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 12:16:24,611 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-15 12:16:24,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:24,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:24,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 29 transitions. [2022-04-15 12:16:24,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:24,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 29 transitions. [2022-04-15 12:16:24,615 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 29 transitions. [2022-04-15 12:16:24,636 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:24,637 INFO L225 Difference]: With dead ends: 29 [2022-04-15 12:16:24,637 INFO L226 Difference]: Without dead ends: 24 [2022-04-15 12:16:24,637 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2022-04-15 12:16:24,638 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:24,638 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 73 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:16:24,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-15 12:16:24,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-15 12:16:24,640 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:24,640 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:24,640 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:24,641 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:24,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:24,641 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-15 12:16:24,641 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-15 12:16:24,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:24,641 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:24,641 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-15 12:16:24,642 INFO L87 Difference]: Start difference. First operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-15 12:16:24,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:24,642 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-15 12:16:24,642 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-15 12:16:24,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:24,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:24,642 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:24,642 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:24,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:24,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2022-04-15 12:16:24,643 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2022-04-15 12:16:24,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:24,643 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2022-04-15 12:16:24,643 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:24,644 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 24 transitions. [2022-04-15 12:16:24,662 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:24,663 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-15 12:16:24,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 12:16:24,663 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:24,663 INFO L499 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:24,664 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-15 12:16:24,664 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:24,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:24,664 INFO L85 PathProgramCache]: Analyzing trace with hash 56692572, now seen corresponding path program 12 times [2022-04-15 12:16:24,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:24,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [465142820] [2022-04-15 12:16:24,725 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:16:24,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1217149001, now seen corresponding path program 1 times [2022-04-15 12:16:24,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:24,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548987574] [2022-04-15 12:16:24,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:24,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:24,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:24,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:24,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:24,761 INFO L290 TraceCheckUtils]: 0: Hoare triple {1923#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1917#true} is VALID [2022-04-15 12:16:24,761 INFO L290 TraceCheckUtils]: 1: Hoare triple {1917#true} assume true; {1917#true} is VALID [2022-04-15 12:16:24,761 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1917#true} {1917#true} #34#return; {1917#true} is VALID [2022-04-15 12:16:24,761 INFO L272 TraceCheckUtils]: 0: Hoare triple {1917#true} call ULTIMATE.init(); {1923#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:24,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {1923#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1917#true} is VALID [2022-04-15 12:16:24,764 INFO L290 TraceCheckUtils]: 2: Hoare triple {1917#true} assume true; {1917#true} is VALID [2022-04-15 12:16:24,765 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1917#true} {1917#true} #34#return; {1917#true} is VALID [2022-04-15 12:16:24,765 INFO L272 TraceCheckUtils]: 4: Hoare triple {1917#true} call #t~ret5 := main(); {1917#true} is VALID [2022-04-15 12:16:24,765 INFO L290 TraceCheckUtils]: 5: Hoare triple {1917#true} ~x~0 := 1;~y~0 := 0; {1922#(= main_~y~0 0)} is VALID [2022-04-15 12:16:24,766 INFO L290 TraceCheckUtils]: 6: Hoare triple {1922#(= main_~y~0 0)} [62] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_Out_24 v_main_~y~0_In_12) (< (mod (+ 4294967295 v_main_~y~0_Out_24) 4294967296) 1024) (= |v_main_#t~post4_Out_24| 1) (= v_main_~y~0_Out_24 0) (= v_main_~x~0_Out_24 0)) (= v_main_~y~0_In_12 v_main_~y~0_Out_24)) InVars {main_~y~0=v_main_~y~0_In_12} OutVars{main_#t~post4=|v_main_#t~post4_Out_24|, main_~y~0=v_main_~y~0_Out_24, main_~x~0=v_main_~x~0_Out_24} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {1922#(= main_~y~0 0)} is VALID [2022-04-15 12:16:24,766 INFO L290 TraceCheckUtils]: 7: Hoare triple {1922#(= main_~y~0 0)} [61] L16-3_primed-->L16-3: Formula: (not (< (mod v_main_~y~0_4 4294967296) 1024)) InVars {main_~y~0=v_main_~y~0_4} OutVars{main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[] {1918#false} is VALID [2022-04-15 12:16:24,766 INFO L272 TraceCheckUtils]: 8: Hoare triple {1918#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {1918#false} is VALID [2022-04-15 12:16:24,767 INFO L290 TraceCheckUtils]: 9: Hoare triple {1918#false} ~cond := #in~cond; {1918#false} is VALID [2022-04-15 12:16:24,767 INFO L290 TraceCheckUtils]: 10: Hoare triple {1918#false} assume 0 == ~cond; {1918#false} is VALID [2022-04-15 12:16:24,767 INFO L290 TraceCheckUtils]: 11: Hoare triple {1918#false} assume !false; {1918#false} is VALID [2022-04-15 12:16:24,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:16:24,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:24,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548987574] [2022-04-15 12:16:24,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548987574] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:24,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:24,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:16:24,950 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:24,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [465142820] [2022-04-15 12:16:24,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [465142820] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:24,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:24,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 12:16:24,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118984093] [2022-04-15 12:16:24,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:24,951 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-15 12:16:24,951 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:24,951 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:24,967 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:24,968 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 12:16:24,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:24,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 12:16:24,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2022-04-15 12:16:24,969 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:25,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:25,511 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-15 12:16:25,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 12:16:25,511 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-15 12:16:25,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:25,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:25,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 30 transitions. [2022-04-15 12:16:25,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:25,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 30 transitions. [2022-04-15 12:16:25,513 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 30 transitions. [2022-04-15 12:16:25,538 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:25,551 INFO L225 Difference]: With dead ends: 30 [2022-04-15 12:16:25,551 INFO L226 Difference]: Without dead ends: 25 [2022-04-15 12:16:25,552 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2022-04-15 12:16:25,553 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:25,553 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 78 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:16:25,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-15 12:16:25,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-15 12:16:25,556 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:25,556 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:25,556 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:25,556 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:25,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:25,557 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-15 12:16:25,557 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-15 12:16:25,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:25,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:25,557 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-15 12:16:25,557 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-15 12:16:25,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:25,558 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-15 12:16:25,558 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-15 12:16:25,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:25,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:25,558 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:25,558 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:25,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:25,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2022-04-15 12:16:25,559 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2022-04-15 12:16:25,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:25,559 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2022-04-15 12:16:25,559 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:25,559 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 25 transitions. [2022-04-15 12:16:25,577 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 12:16:25,578 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-15 12:16:25,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 12:16:25,578 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:25,578 INFO L499 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:25,578 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-15 12:16:25,578 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:25,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:25,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1793930998, now seen corresponding path program 13 times [2022-04-15 12:16:25,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:25,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1601572401] [2022-04-15 12:16:25,650 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:16:25,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1158043657, now seen corresponding path program 1 times [2022-04-15 12:16:25,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:25,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987103204] [2022-04-15 12:16:25,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:25,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:25,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:25,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:25,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:25,686 INFO L290 TraceCheckUtils]: 0: Hoare triple {2130#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {2124#true} is VALID [2022-04-15 12:16:25,686 INFO L290 TraceCheckUtils]: 1: Hoare triple {2124#true} assume true; {2124#true} is VALID [2022-04-15 12:16:25,686 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2124#true} {2124#true} #34#return; {2124#true} is VALID [2022-04-15 12:16:25,687 INFO L272 TraceCheckUtils]: 0: Hoare triple {2124#true} call ULTIMATE.init(); {2130#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:25,687 INFO L290 TraceCheckUtils]: 1: Hoare triple {2130#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {2124#true} is VALID [2022-04-15 12:16:25,687 INFO L290 TraceCheckUtils]: 2: Hoare triple {2124#true} assume true; {2124#true} is VALID [2022-04-15 12:16:25,687 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2124#true} {2124#true} #34#return; {2124#true} is VALID [2022-04-15 12:16:25,687 INFO L272 TraceCheckUtils]: 4: Hoare triple {2124#true} call #t~ret5 := main(); {2124#true} is VALID [2022-04-15 12:16:25,688 INFO L290 TraceCheckUtils]: 5: Hoare triple {2124#true} ~x~0 := 1;~y~0 := 0; {2129#(= main_~y~0 0)} is VALID [2022-04-15 12:16:25,688 INFO L290 TraceCheckUtils]: 6: Hoare triple {2129#(= main_~y~0 0)} [64] L16-2-->L16-3_primed: Formula: (or (= v_main_~y~0_In_13 v_main_~y~0_Out_26) (and (= v_main_~y~0_Out_26 0) (= v_main_~y~0_Out_26 v_main_~y~0_In_13) (= v_main_~x~0_Out_26 0) (= |v_main_#t~post4_Out_26| 1) (< (mod (+ 4294967295 v_main_~y~0_Out_26) 4294967296) 1024))) InVars {main_~y~0=v_main_~y~0_In_13} OutVars{main_#t~post4=|v_main_#t~post4_Out_26|, main_~y~0=v_main_~y~0_Out_26, main_~x~0=v_main_~x~0_Out_26} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {2129#(= main_~y~0 0)} is VALID [2022-04-15 12:16:25,689 INFO L290 TraceCheckUtils]: 7: Hoare triple {2129#(= main_~y~0 0)} [63] L16-3_primed-->L16-3: Formula: (not (< (mod v_main_~y~0_4 4294967296) 1024)) InVars {main_~y~0=v_main_~y~0_4} OutVars{main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[] {2125#false} is VALID [2022-04-15 12:16:25,689 INFO L272 TraceCheckUtils]: 8: Hoare triple {2125#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {2125#false} is VALID [2022-04-15 12:16:25,689 INFO L290 TraceCheckUtils]: 9: Hoare triple {2125#false} ~cond := #in~cond; {2125#false} is VALID [2022-04-15 12:16:25,689 INFO L290 TraceCheckUtils]: 10: Hoare triple {2125#false} assume 0 == ~cond; {2125#false} is VALID [2022-04-15 12:16:25,689 INFO L290 TraceCheckUtils]: 11: Hoare triple {2125#false} assume !false; {2125#false} is VALID [2022-04-15 12:16:25,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:16:25,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:25,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987103204] [2022-04-15 12:16:25,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987103204] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:25,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:25,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:16:25,892 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:25,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1601572401] [2022-04-15 12:16:25,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1601572401] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:25,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:25,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-15 12:16:25,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643733708] [2022-04-15 12:16:25,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:25,893 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-15 12:16:25,894 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:25,894 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:25,912 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:25,913 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-15 12:16:25,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:25,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-15 12:16:25,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2022-04-15 12:16:25,914 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:26,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:26,614 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-15 12:16:26,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-15 12:16:26,615 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-15 12:16:26,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:26,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:26,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2022-04-15 12:16:26,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:26,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2022-04-15 12:16:26,616 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 31 transitions. [2022-04-15 12:16:26,640 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:26,643 INFO L225 Difference]: With dead ends: 31 [2022-04-15 12:16:26,643 INFO L226 Difference]: Without dead ends: 26 [2022-04-15 12:16:26,645 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2022-04-15 12:16:26,646 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:26,646 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 83 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 12:16:26,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-15 12:16:26,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-15 12:16:26,649 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:26,650 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:26,650 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:26,650 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:26,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:26,651 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-15 12:16:26,651 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-15 12:16:26,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:26,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:26,651 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 26 states. [2022-04-15 12:16:26,652 INFO L87 Difference]: Start difference. First operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 26 states. [2022-04-15 12:16:26,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:26,652 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-15 12:16:26,652 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-15 12:16:26,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:26,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:26,653 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:26,653 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:26,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:26,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2022-04-15 12:16:26,654 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2022-04-15 12:16:26,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:26,654 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2022-04-15 12:16:26,655 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:26,655 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 26 transitions. [2022-04-15 12:16:26,680 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:26,680 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-15 12:16:26,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 12:16:26,681 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:26,681 INFO L499 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:26,681 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-15 12:16:26,681 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:26,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:26,682 INFO L85 PathProgramCache]: Analyzing trace with hash -186252644, now seen corresponding path program 14 times [2022-04-15 12:16:26,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:26,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [769418477] [2022-04-15 12:16:26,761 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:16:26,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1098938313, now seen corresponding path program 1 times [2022-04-15 12:16:26,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:26,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812133186] [2022-04-15 12:16:26,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:26,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:26,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:26,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:26,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:26,810 INFO L290 TraceCheckUtils]: 0: Hoare triple {2346#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {2340#true} is VALID [2022-04-15 12:16:26,810 INFO L290 TraceCheckUtils]: 1: Hoare triple {2340#true} assume true; {2340#true} is VALID [2022-04-15 12:16:26,810 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2340#true} {2340#true} #34#return; {2340#true} is VALID [2022-04-15 12:16:26,811 INFO L272 TraceCheckUtils]: 0: Hoare triple {2340#true} call ULTIMATE.init(); {2346#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:26,811 INFO L290 TraceCheckUtils]: 1: Hoare triple {2346#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {2340#true} is VALID [2022-04-15 12:16:26,811 INFO L290 TraceCheckUtils]: 2: Hoare triple {2340#true} assume true; {2340#true} is VALID [2022-04-15 12:16:26,811 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2340#true} {2340#true} #34#return; {2340#true} is VALID [2022-04-15 12:16:26,811 INFO L272 TraceCheckUtils]: 4: Hoare triple {2340#true} call #t~ret5 := main(); {2340#true} is VALID [2022-04-15 12:16:26,812 INFO L290 TraceCheckUtils]: 5: Hoare triple {2340#true} ~x~0 := 1;~y~0 := 0; {2345#(= main_~y~0 0)} is VALID [2022-04-15 12:16:26,813 INFO L290 TraceCheckUtils]: 6: Hoare triple {2345#(= main_~y~0 0)} [66] L16-2-->L16-3_primed: Formula: (or (= v_main_~y~0_In_14 v_main_~y~0_Out_28) (and (= |v_main_#t~post4_Out_28| 1) (= v_main_~x~0_Out_28 0) (= v_main_~y~0_Out_28 v_main_~y~0_In_14) (< (mod (+ 4294967295 v_main_~y~0_Out_28) 4294967296) 1024) (= v_main_~y~0_Out_28 0))) InVars {main_~y~0=v_main_~y~0_In_14} OutVars{main_#t~post4=|v_main_#t~post4_Out_28|, main_~y~0=v_main_~y~0_Out_28, main_~x~0=v_main_~x~0_Out_28} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {2345#(= main_~y~0 0)} is VALID [2022-04-15 12:16:26,813 INFO L290 TraceCheckUtils]: 7: Hoare triple {2345#(= main_~y~0 0)} [65] L16-3_primed-->L16-3: Formula: (not (< (mod v_main_~y~0_4 4294967296) 1024)) InVars {main_~y~0=v_main_~y~0_4} OutVars{main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[] {2341#false} is VALID [2022-04-15 12:16:26,813 INFO L272 TraceCheckUtils]: 8: Hoare triple {2341#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {2341#false} is VALID [2022-04-15 12:16:26,814 INFO L290 TraceCheckUtils]: 9: Hoare triple {2341#false} ~cond := #in~cond; {2341#false} is VALID [2022-04-15 12:16:26,814 INFO L290 TraceCheckUtils]: 10: Hoare triple {2341#false} assume 0 == ~cond; {2341#false} is VALID [2022-04-15 12:16:26,814 INFO L290 TraceCheckUtils]: 11: Hoare triple {2341#false} assume !false; {2341#false} is VALID [2022-04-15 12:16:26,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:16:26,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:26,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812133186] [2022-04-15 12:16:26,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812133186] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:26,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:26,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:16:27,039 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:27,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [769418477] [2022-04-15 12:16:27,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [769418477] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:27,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:27,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-15 12:16:27,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537038685] [2022-04-15 12:16:27,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:27,044 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-15 12:16:27,044 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:27,044 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:27,059 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 12:16:27,059 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-15 12:16:27,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:27,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-15 12:16:27,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2022-04-15 12:16:27,061 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:27,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:27,757 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-04-15 12:16:27,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-15 12:16:27,757 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-15 12:16:27,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:27,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:27,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 32 transitions. [2022-04-15 12:16:27,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:27,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 32 transitions. [2022-04-15 12:16:27,759 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 32 transitions. [2022-04-15 12:16:27,784 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:27,786 INFO L225 Difference]: With dead ends: 32 [2022-04-15 12:16:27,786 INFO L226 Difference]: Without dead ends: 27 [2022-04-15 12:16:27,787 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2022-04-15 12:16:27,787 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:27,787 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 88 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 12:16:27,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-15 12:16:27,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-15 12:16:27,790 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:27,790 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:27,790 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:27,790 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:27,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:27,791 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-15 12:16:27,791 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-15 12:16:27,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:27,791 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:27,791 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-15 12:16:27,792 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-15 12:16:27,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:27,792 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-15 12:16:27,792 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-15 12:16:27,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:27,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:27,792 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:27,792 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:27,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:27,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2022-04-15 12:16:27,793 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2022-04-15 12:16:27,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:27,793 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2022-04-15 12:16:27,793 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:27,793 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 27 transitions. [2022-04-15 12:16:27,817 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:27,818 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-15 12:16:27,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 12:16:27,818 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:27,818 INFO L499 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:27,818 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-15 12:16:27,818 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:27,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:27,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1442403402, now seen corresponding path program 15 times [2022-04-15 12:16:27,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:27,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1172725175] [2022-04-15 12:16:27,889 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:16:27,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1039832969, now seen corresponding path program 1 times [2022-04-15 12:16:27,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:27,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901176575] [2022-04-15 12:16:27,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:27,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:27,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:27,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:27,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:27,948 INFO L290 TraceCheckUtils]: 0: Hoare triple {2571#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {2565#true} is VALID [2022-04-15 12:16:27,949 INFO L290 TraceCheckUtils]: 1: Hoare triple {2565#true} assume true; {2565#true} is VALID [2022-04-15 12:16:27,949 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2565#true} {2565#true} #34#return; {2565#true} is VALID [2022-04-15 12:16:27,949 INFO L272 TraceCheckUtils]: 0: Hoare triple {2565#true} call ULTIMATE.init(); {2571#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:27,963 INFO L290 TraceCheckUtils]: 1: Hoare triple {2571#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {2565#true} is VALID [2022-04-15 12:16:27,963 INFO L290 TraceCheckUtils]: 2: Hoare triple {2565#true} assume true; {2565#true} is VALID [2022-04-15 12:16:27,964 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2565#true} {2565#true} #34#return; {2565#true} is VALID [2022-04-15 12:16:27,964 INFO L272 TraceCheckUtils]: 4: Hoare triple {2565#true} call #t~ret5 := main(); {2565#true} is VALID [2022-04-15 12:16:27,965 INFO L290 TraceCheckUtils]: 5: Hoare triple {2565#true} ~x~0 := 1;~y~0 := 0; {2570#(= main_~y~0 0)} is VALID [2022-04-15 12:16:27,966 INFO L290 TraceCheckUtils]: 6: Hoare triple {2570#(= main_~y~0 0)} [68] L16-2-->L16-3_primed: Formula: (or (and (< (mod (+ 4294967295 v_main_~y~0_Out_30) 4294967296) 1024) (= v_main_~y~0_Out_30 v_main_~y~0_In_15) (= |v_main_#t~post4_Out_30| 1) (= v_main_~y~0_Out_30 0) (= v_main_~x~0_Out_30 0)) (= v_main_~y~0_In_15 v_main_~y~0_Out_30)) InVars {main_~y~0=v_main_~y~0_In_15} OutVars{main_#t~post4=|v_main_#t~post4_Out_30|, main_~y~0=v_main_~y~0_Out_30, main_~x~0=v_main_~x~0_Out_30} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {2570#(= main_~y~0 0)} is VALID [2022-04-15 12:16:27,968 INFO L290 TraceCheckUtils]: 7: Hoare triple {2570#(= main_~y~0 0)} [67] L16-3_primed-->L16-3: Formula: (not (< (mod v_main_~y~0_4 4294967296) 1024)) InVars {main_~y~0=v_main_~y~0_4} OutVars{main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[] {2566#false} is VALID [2022-04-15 12:16:27,968 INFO L272 TraceCheckUtils]: 8: Hoare triple {2566#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {2566#false} is VALID [2022-04-15 12:16:27,968 INFO L290 TraceCheckUtils]: 9: Hoare triple {2566#false} ~cond := #in~cond; {2566#false} is VALID [2022-04-15 12:16:27,968 INFO L290 TraceCheckUtils]: 10: Hoare triple {2566#false} assume 0 == ~cond; {2566#false} is VALID [2022-04-15 12:16:27,968 INFO L290 TraceCheckUtils]: 11: Hoare triple {2566#false} assume !false; {2566#false} is VALID [2022-04-15 12:16:27,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:16:27,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:27,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901176575] [2022-04-15 12:16:27,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901176575] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:27,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:27,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:16:28,220 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:28,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1172725175] [2022-04-15 12:16:28,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1172725175] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:28,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:28,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-15 12:16:28,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279544191] [2022-04-15 12:16:28,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:28,221 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-15 12:16:28,221 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:28,221 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:28,239 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:28,239 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-15 12:16:28,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:28,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-15 12:16:28,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2022-04-15 12:16:28,240 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:29,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:29,020 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2022-04-15 12:16:29,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-15 12:16:29,020 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-15 12:16:29,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:29,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:29,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 33 transitions. [2022-04-15 12:16:29,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:29,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 33 transitions. [2022-04-15 12:16:29,022 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 33 transitions. [2022-04-15 12:16:29,048 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:29,048 INFO L225 Difference]: With dead ends: 33 [2022-04-15 12:16:29,049 INFO L226 Difference]: Without dead ends: 28 [2022-04-15 12:16:29,049 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2022-04-15 12:16:29,049 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:29,050 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 93 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 12:16:29,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-15 12:16:29,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-15 12:16:29,052 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:29,052 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:29,052 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:29,052 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:29,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:29,053 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-15 12:16:29,053 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-04-15 12:16:29,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:29,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:29,053 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-15 12:16:29,053 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-15 12:16:29,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:29,054 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-15 12:16:29,054 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-04-15 12:16:29,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:29,054 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:29,054 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:29,054 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:29,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:29,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2022-04-15 12:16:29,055 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2022-04-15 12:16:29,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:29,055 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2022-04-15 12:16:29,055 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:29,055 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 28 transitions. [2022-04-15 12:16:29,080 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:29,081 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-04-15 12:16:29,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 12:16:29,081 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:29,081 INFO L499 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:29,081 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-15 12:16:29,081 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:29,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:29,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1728371236, now seen corresponding path program 16 times [2022-04-15 12:16:29,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:29,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1409916620] [2022-04-15 12:16:29,143 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:16:29,145 INFO L85 PathProgramCache]: Analyzing trace with hash -980727625, now seen corresponding path program 1 times [2022-04-15 12:16:29,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:29,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56403986] [2022-04-15 12:16:29,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:29,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:29,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:29,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:29,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:29,192 INFO L290 TraceCheckUtils]: 0: Hoare triple {2805#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {2799#true} is VALID [2022-04-15 12:16:29,192 INFO L290 TraceCheckUtils]: 1: Hoare triple {2799#true} assume true; {2799#true} is VALID [2022-04-15 12:16:29,195 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2799#true} {2799#true} #34#return; {2799#true} is VALID [2022-04-15 12:16:29,196 INFO L272 TraceCheckUtils]: 0: Hoare triple {2799#true} call ULTIMATE.init(); {2805#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:29,196 INFO L290 TraceCheckUtils]: 1: Hoare triple {2805#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {2799#true} is VALID [2022-04-15 12:16:29,196 INFO L290 TraceCheckUtils]: 2: Hoare triple {2799#true} assume true; {2799#true} is VALID [2022-04-15 12:16:29,196 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2799#true} {2799#true} #34#return; {2799#true} is VALID [2022-04-15 12:16:29,197 INFO L272 TraceCheckUtils]: 4: Hoare triple {2799#true} call #t~ret5 := main(); {2799#true} is VALID [2022-04-15 12:16:29,197 INFO L290 TraceCheckUtils]: 5: Hoare triple {2799#true} ~x~0 := 1;~y~0 := 0; {2804#(= main_~y~0 0)} is VALID [2022-04-15 12:16:29,197 INFO L290 TraceCheckUtils]: 6: Hoare triple {2804#(= main_~y~0 0)} [70] L16-2-->L16-3_primed: Formula: (or (= v_main_~y~0_In_16 v_main_~y~0_Out_32) (and (= v_main_~y~0_Out_32 0) (< (mod (+ 4294967295 v_main_~y~0_Out_32) 4294967296) 1024) (= |v_main_#t~post4_Out_32| 1) (= v_main_~y~0_Out_32 v_main_~y~0_In_16) (= v_main_~x~0_Out_32 0))) InVars {main_~y~0=v_main_~y~0_In_16} OutVars{main_#t~post4=|v_main_#t~post4_Out_32|, main_~y~0=v_main_~y~0_Out_32, main_~x~0=v_main_~x~0_Out_32} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {2804#(= main_~y~0 0)} is VALID [2022-04-15 12:16:29,198 INFO L290 TraceCheckUtils]: 7: Hoare triple {2804#(= main_~y~0 0)} [69] L16-3_primed-->L16-3: Formula: (not (< (mod v_main_~y~0_4 4294967296) 1024)) InVars {main_~y~0=v_main_~y~0_4} OutVars{main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[] {2800#false} is VALID [2022-04-15 12:16:29,198 INFO L272 TraceCheckUtils]: 8: Hoare triple {2800#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {2800#false} is VALID [2022-04-15 12:16:29,198 INFO L290 TraceCheckUtils]: 9: Hoare triple {2800#false} ~cond := #in~cond; {2800#false} is VALID [2022-04-15 12:16:29,198 INFO L290 TraceCheckUtils]: 10: Hoare triple {2800#false} assume 0 == ~cond; {2800#false} is VALID [2022-04-15 12:16:29,198 INFO L290 TraceCheckUtils]: 11: Hoare triple {2800#false} assume !false; {2800#false} is VALID [2022-04-15 12:16:29,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:16:29,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:29,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56403986] [2022-04-15 12:16:29,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56403986] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:29,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:29,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:16:29,442 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:29,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1409916620] [2022-04-15 12:16:29,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1409916620] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:29,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:29,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-15 12:16:29,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065497543] [2022-04-15 12:16:29,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:29,443 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.15) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-15 12:16:29,444 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:29,444 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.15) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:29,482 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:29,483 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-15 12:16:29,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:29,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-15 12:16:29,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2022-04-15 12:16:29,484 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand has 20 states, 20 states have (on average 1.15) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:30,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:30,417 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-15 12:16:30,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-15 12:16:30,418 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.15) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-15 12:16:30,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:30,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.15) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:30,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 34 transitions. [2022-04-15 12:16:30,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.15) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:30,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 34 transitions. [2022-04-15 12:16:30,422 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 34 transitions. [2022-04-15 12:16:30,454 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:30,455 INFO L225 Difference]: With dead ends: 34 [2022-04-15 12:16:30,456 INFO L226 Difference]: Without dead ends: 29 [2022-04-15 12:16:30,456 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=1227, Unknown=0, NotChecked=0, Total=1332 [2022-04-15 12:16:30,457 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:30,457 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 98 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 12:16:30,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-15 12:16:30,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-15 12:16:30,460 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:30,461 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:30,461 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:30,461 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:30,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:30,462 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-04-15 12:16:30,462 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-15 12:16:30,462 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:30,462 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:30,462 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-15 12:16:30,462 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-15 12:16:30,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:30,463 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-04-15 12:16:30,463 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-15 12:16:30,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:30,463 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:30,463 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:30,464 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:30,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:30,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2022-04-15 12:16:30,464 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2022-04-15 12:16:30,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:30,465 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2022-04-15 12:16:30,465 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.15) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:30,465 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 29 transitions. [2022-04-15 12:16:30,489 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:30,489 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-15 12:16:30,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 12:16:30,489 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:30,490 INFO L499 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:30,490 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-15 12:16:30,490 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:30,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:30,490 INFO L85 PathProgramCache]: Analyzing trace with hash -2003439498, now seen corresponding path program 17 times [2022-04-15 12:16:30,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:30,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [108590896] [2022-04-15 12:16:30,553 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:16:30,554 INFO L85 PathProgramCache]: Analyzing trace with hash -921622281, now seen corresponding path program 1 times [2022-04-15 12:16:30,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:30,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061595220] [2022-04-15 12:16:30,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:30,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:30,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:30,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:30,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:30,593 INFO L290 TraceCheckUtils]: 0: Hoare triple {3048#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {3042#true} is VALID [2022-04-15 12:16:30,593 INFO L290 TraceCheckUtils]: 1: Hoare triple {3042#true} assume true; {3042#true} is VALID [2022-04-15 12:16:30,593 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3042#true} {3042#true} #34#return; {3042#true} is VALID [2022-04-15 12:16:30,594 INFO L272 TraceCheckUtils]: 0: Hoare triple {3042#true} call ULTIMATE.init(); {3048#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:30,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {3048#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {3042#true} is VALID [2022-04-15 12:16:30,594 INFO L290 TraceCheckUtils]: 2: Hoare triple {3042#true} assume true; {3042#true} is VALID [2022-04-15 12:16:30,594 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3042#true} {3042#true} #34#return; {3042#true} is VALID [2022-04-15 12:16:30,594 INFO L272 TraceCheckUtils]: 4: Hoare triple {3042#true} call #t~ret5 := main(); {3042#true} is VALID [2022-04-15 12:16:30,594 INFO L290 TraceCheckUtils]: 5: Hoare triple {3042#true} ~x~0 := 1;~y~0 := 0; {3047#(= main_~y~0 0)} is VALID [2022-04-15 12:16:30,595 INFO L290 TraceCheckUtils]: 6: Hoare triple {3047#(= main_~y~0 0)} [72] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_Out_34 0) (= |v_main_#t~post4_Out_34| 1) (< (mod (+ 4294967295 v_main_~y~0_Out_34) 4294967296) 1024) (= v_main_~y~0_Out_34 0) (= v_main_~y~0_Out_34 v_main_~y~0_In_17)) (= v_main_~y~0_In_17 v_main_~y~0_Out_34)) InVars {main_~y~0=v_main_~y~0_In_17} OutVars{main_#t~post4=|v_main_#t~post4_Out_34|, main_~y~0=v_main_~y~0_Out_34, main_~x~0=v_main_~x~0_Out_34} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {3047#(= main_~y~0 0)} is VALID [2022-04-15 12:16:30,595 INFO L290 TraceCheckUtils]: 7: Hoare triple {3047#(= main_~y~0 0)} [71] L16-3_primed-->L16-3: Formula: (not (< (mod v_main_~y~0_4 4294967296) 1024)) InVars {main_~y~0=v_main_~y~0_4} OutVars{main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[] {3043#false} is VALID [2022-04-15 12:16:30,595 INFO L272 TraceCheckUtils]: 8: Hoare triple {3043#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {3043#false} is VALID [2022-04-15 12:16:30,596 INFO L290 TraceCheckUtils]: 9: Hoare triple {3043#false} ~cond := #in~cond; {3043#false} is VALID [2022-04-15 12:16:30,596 INFO L290 TraceCheckUtils]: 10: Hoare triple {3043#false} assume 0 == ~cond; {3043#false} is VALID [2022-04-15 12:16:30,596 INFO L290 TraceCheckUtils]: 11: Hoare triple {3043#false} assume !false; {3043#false} is VALID [2022-04-15 12:16:30,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:16:30,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:30,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061595220] [2022-04-15 12:16:30,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061595220] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:30,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:30,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:16:30,899 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:30,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [108590896] [2022-04-15 12:16:30,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [108590896] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:30,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:30,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-15 12:16:30,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042291257] [2022-04-15 12:16:30,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:30,901 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 20 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-15 12:16:30,901 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:30,901 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 20 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:30,936 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:30,936 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-15 12:16:30,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:30,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-15 12:16:30,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2022-04-15 12:16:30,937 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 20 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:31,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:31,903 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2022-04-15 12:16:31,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-15 12:16:31,904 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 20 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-15 12:16:31,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:31,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 20 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:31,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 35 transitions. [2022-04-15 12:16:31,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 20 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:31,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 35 transitions. [2022-04-15 12:16:31,905 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 35 transitions. [2022-04-15 12:16:31,933 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:31,934 INFO L225 Difference]: With dead ends: 35 [2022-04-15 12:16:31,934 INFO L226 Difference]: Without dead ends: 30 [2022-04-15 12:16:31,934 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=1371, Unknown=0, NotChecked=0, Total=1482 [2022-04-15 12:16:31,935 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:31,936 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 103 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 12:16:31,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-15 12:16:31,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-15 12:16:31,938 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:31,938 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:31,938 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:31,938 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:31,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:31,939 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-15 12:16:31,939 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-04-15 12:16:31,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:31,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:31,939 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 30 states. [2022-04-15 12:16:31,939 INFO L87 Difference]: Start difference. First operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 30 states. [2022-04-15 12:16:31,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:31,939 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-15 12:16:31,940 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-04-15 12:16:31,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:31,940 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:31,940 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:31,940 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:31,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:31,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2022-04-15 12:16:31,940 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2022-04-15 12:16:31,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:31,941 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2022-04-15 12:16:31,941 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 20 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:31,941 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 30 transitions. [2022-04-15 12:16:31,964 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:31,965 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-04-15 12:16:31,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 12:16:31,965 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:31,965 INFO L499 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:31,965 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-15 12:16:31,966 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:31,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:31,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1940621028, now seen corresponding path program 18 times [2022-04-15 12:16:31,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:31,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1435031277] [2022-04-15 12:16:32,035 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:16:32,036 INFO L85 PathProgramCache]: Analyzing trace with hash -862516937, now seen corresponding path program 1 times [2022-04-15 12:16:32,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:32,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212001109] [2022-04-15 12:16:32,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:32,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:32,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:32,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:32,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:32,079 INFO L290 TraceCheckUtils]: 0: Hoare triple {3300#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {3294#true} is VALID [2022-04-15 12:16:32,079 INFO L290 TraceCheckUtils]: 1: Hoare triple {3294#true} assume true; {3294#true} is VALID [2022-04-15 12:16:32,079 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3294#true} {3294#true} #34#return; {3294#true} is VALID [2022-04-15 12:16:32,079 INFO L272 TraceCheckUtils]: 0: Hoare triple {3294#true} call ULTIMATE.init(); {3300#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:32,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {3300#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {3294#true} is VALID [2022-04-15 12:16:32,080 INFO L290 TraceCheckUtils]: 2: Hoare triple {3294#true} assume true; {3294#true} is VALID [2022-04-15 12:16:32,080 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3294#true} {3294#true} #34#return; {3294#true} is VALID [2022-04-15 12:16:32,080 INFO L272 TraceCheckUtils]: 4: Hoare triple {3294#true} call #t~ret5 := main(); {3294#true} is VALID [2022-04-15 12:16:32,080 INFO L290 TraceCheckUtils]: 5: Hoare triple {3294#true} ~x~0 := 1;~y~0 := 0; {3299#(= main_~y~0 0)} is VALID [2022-04-15 12:16:32,081 INFO L290 TraceCheckUtils]: 6: Hoare triple {3299#(= main_~y~0 0)} [74] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_Out_36 0) (= v_main_~y~0_Out_36 0) (< (mod (+ 4294967295 v_main_~y~0_Out_36) 4294967296) 1024) (= v_main_~y~0_Out_36 v_main_~y~0_In_18) (= |v_main_#t~post4_Out_36| 1)) (= v_main_~y~0_In_18 v_main_~y~0_Out_36)) InVars {main_~y~0=v_main_~y~0_In_18} OutVars{main_#t~post4=|v_main_#t~post4_Out_36|, main_~y~0=v_main_~y~0_Out_36, main_~x~0=v_main_~x~0_Out_36} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {3299#(= main_~y~0 0)} is VALID [2022-04-15 12:16:32,081 INFO L290 TraceCheckUtils]: 7: Hoare triple {3299#(= main_~y~0 0)} [73] L16-3_primed-->L16-3: Formula: (not (< (mod v_main_~y~0_4 4294967296) 1024)) InVars {main_~y~0=v_main_~y~0_4} OutVars{main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[] {3295#false} is VALID [2022-04-15 12:16:32,081 INFO L272 TraceCheckUtils]: 8: Hoare triple {3295#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {3295#false} is VALID [2022-04-15 12:16:32,081 INFO L290 TraceCheckUtils]: 9: Hoare triple {3295#false} ~cond := #in~cond; {3295#false} is VALID [2022-04-15 12:16:32,081 INFO L290 TraceCheckUtils]: 10: Hoare triple {3295#false} assume 0 == ~cond; {3295#false} is VALID [2022-04-15 12:16:32,081 INFO L290 TraceCheckUtils]: 11: Hoare triple {3295#false} assume !false; {3295#false} is VALID [2022-04-15 12:16:32,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:16:32,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:32,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212001109] [2022-04-15 12:16:32,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212001109] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:32,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:32,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:16:32,383 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:32,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1435031277] [2022-04-15 12:16:32,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1435031277] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:32,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:32,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-15 12:16:32,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299726876] [2022-04-15 12:16:32,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:32,384 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-15 12:16:32,384 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:32,384 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:32,407 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:32,407 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-15 12:16:32,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:32,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-15 12:16:32,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2022-04-15 12:16:32,410 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:33,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:33,465 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-15 12:16:33,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-15 12:16:33,465 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-15 12:16:33,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:33,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:33,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 36 transitions. [2022-04-15 12:16:33,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:33,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 36 transitions. [2022-04-15 12:16:33,470 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 36 transitions. [2022-04-15 12:16:33,499 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:33,499 INFO L225 Difference]: With dead ends: 36 [2022-04-15 12:16:33,499 INFO L226 Difference]: Without dead ends: 31 [2022-04-15 12:16:33,500 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=117, Invalid=1523, Unknown=0, NotChecked=0, Total=1640 [2022-04-15 12:16:33,500 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:33,501 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 108 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 12:16:33,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-15 12:16:33,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-15 12:16:33,503 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:33,503 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:33,503 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:33,503 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:33,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:33,504 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-15 12:16:33,504 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-15 12:16:33,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:33,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:33,504 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 31 states. [2022-04-15 12:16:33,504 INFO L87 Difference]: Start difference. First operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 31 states. [2022-04-15 12:16:33,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:33,505 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-15 12:16:33,505 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-15 12:16:33,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:33,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:33,505 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:33,505 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:33,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:33,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2022-04-15 12:16:33,506 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2022-04-15 12:16:33,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:33,506 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2022-04-15 12:16:33,506 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:33,506 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 31 transitions. [2022-04-15 12:16:33,533 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:33,533 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-15 12:16:33,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 12:16:33,533 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:33,534 INFO L499 BasicCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:33,534 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-15 12:16:33,534 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:33,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:33,534 INFO L85 PathProgramCache]: Analyzing trace with hash 6751542, now seen corresponding path program 19 times [2022-04-15 12:16:33,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:33,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [51029403] [2022-04-15 12:16:33,592 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:16:33,593 INFO L85 PathProgramCache]: Analyzing trace with hash -803411593, now seen corresponding path program 1 times [2022-04-15 12:16:33,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:33,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014020238] [2022-04-15 12:16:33,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:33,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:33,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:33,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:33,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:33,642 INFO L290 TraceCheckUtils]: 0: Hoare triple {3561#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {3555#true} is VALID [2022-04-15 12:16:33,642 INFO L290 TraceCheckUtils]: 1: Hoare triple {3555#true} assume true; {3555#true} is VALID [2022-04-15 12:16:33,642 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3555#true} {3555#true} #34#return; {3555#true} is VALID [2022-04-15 12:16:33,643 INFO L272 TraceCheckUtils]: 0: Hoare triple {3555#true} call ULTIMATE.init(); {3561#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:33,643 INFO L290 TraceCheckUtils]: 1: Hoare triple {3561#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {3555#true} is VALID [2022-04-15 12:16:33,643 INFO L290 TraceCheckUtils]: 2: Hoare triple {3555#true} assume true; {3555#true} is VALID [2022-04-15 12:16:33,643 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3555#true} {3555#true} #34#return; {3555#true} is VALID [2022-04-15 12:16:33,643 INFO L272 TraceCheckUtils]: 4: Hoare triple {3555#true} call #t~ret5 := main(); {3555#true} is VALID [2022-04-15 12:16:33,644 INFO L290 TraceCheckUtils]: 5: Hoare triple {3555#true} ~x~0 := 1;~y~0 := 0; {3560#(= main_~y~0 0)} is VALID [2022-04-15 12:16:33,644 INFO L290 TraceCheckUtils]: 6: Hoare triple {3560#(= main_~y~0 0)} [76] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post4_Out_38| 1) (= v_main_~x~0_Out_38 0) (= v_main_~y~0_Out_38 0) (< (mod (+ 4294967295 v_main_~y~0_Out_38) 4294967296) 1024) (= v_main_~y~0_Out_38 v_main_~y~0_In_19)) (= v_main_~y~0_In_19 v_main_~y~0_Out_38)) InVars {main_~y~0=v_main_~y~0_In_19} OutVars{main_#t~post4=|v_main_#t~post4_Out_38|, main_~y~0=v_main_~y~0_Out_38, main_~x~0=v_main_~x~0_Out_38} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {3560#(= main_~y~0 0)} is VALID [2022-04-15 12:16:33,645 INFO L290 TraceCheckUtils]: 7: Hoare triple {3560#(= main_~y~0 0)} [75] L16-3_primed-->L16-3: Formula: (not (< (mod v_main_~y~0_4 4294967296) 1024)) InVars {main_~y~0=v_main_~y~0_4} OutVars{main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[] {3556#false} is VALID [2022-04-15 12:16:33,645 INFO L272 TraceCheckUtils]: 8: Hoare triple {3556#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {3556#false} is VALID [2022-04-15 12:16:33,645 INFO L290 TraceCheckUtils]: 9: Hoare triple {3556#false} ~cond := #in~cond; {3556#false} is VALID [2022-04-15 12:16:33,645 INFO L290 TraceCheckUtils]: 10: Hoare triple {3556#false} assume 0 == ~cond; {3556#false} is VALID [2022-04-15 12:16:33,645 INFO L290 TraceCheckUtils]: 11: Hoare triple {3556#false} assume !false; {3556#false} is VALID [2022-04-15 12:16:33,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:16:33,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:33,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014020238] [2022-04-15 12:16:33,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014020238] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:33,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:33,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:16:33,969 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:33,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [51029403] [2022-04-15 12:16:33,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [51029403] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:33,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:33,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-15 12:16:33,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985582443] [2022-04-15 12:16:33,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:33,970 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 22 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-15 12:16:33,971 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:33,971 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 22 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:33,994 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:33,994 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-15 12:16:33,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:33,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-15 12:16:33,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2022-04-15 12:16:33,995 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand has 23 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 22 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:35,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:35,213 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2022-04-15 12:16:35,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-15 12:16:35,213 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 22 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-15 12:16:35,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:35,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 22 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:35,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 37 transitions. [2022-04-15 12:16:35,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 22 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:35,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 37 transitions. [2022-04-15 12:16:35,215 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 37 transitions. [2022-04-15 12:16:35,246 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:35,247 INFO L225 Difference]: With dead ends: 37 [2022-04-15 12:16:35,247 INFO L226 Difference]: Without dead ends: 32 [2022-04-15 12:16:35,247 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=123, Invalid=1683, Unknown=0, NotChecked=0, Total=1806 [2022-04-15 12:16:35,248 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:35,248 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 113 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 12:16:35,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-15 12:16:35,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-15 12:16:35,250 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:35,250 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:35,250 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:35,250 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:35,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:35,250 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-04-15 12:16:35,251 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-04-15 12:16:35,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:35,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:35,251 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 32 states. [2022-04-15 12:16:35,251 INFO L87 Difference]: Start difference. First operand has 32 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 32 states. [2022-04-15 12:16:35,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:35,251 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-04-15 12:16:35,251 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-04-15 12:16:35,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:35,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:35,252 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:35,252 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:35,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:35,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2022-04-15 12:16:35,252 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2022-04-15 12:16:35,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:35,252 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2022-04-15 12:16:35,252 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 22 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:35,253 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 32 transitions. [2022-04-15 12:16:35,278 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:35,278 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-04-15 12:16:35,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-15 12:16:35,278 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:35,278 INFO L499 BasicCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:35,278 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-15 12:16:35,279 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:35,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:35,279 INFO L85 PathProgramCache]: Analyzing trace with hash 245759068, now seen corresponding path program 20 times [2022-04-15 12:16:35,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:35,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [708030370] [2022-04-15 12:16:35,341 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:16:35,344 INFO L85 PathProgramCache]: Analyzing trace with hash -744306249, now seen corresponding path program 1 times [2022-04-15 12:16:35,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:35,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766084317] [2022-04-15 12:16:35,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:35,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:35,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:35,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:35,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:35,374 INFO L290 TraceCheckUtils]: 0: Hoare triple {3831#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {3825#true} is VALID [2022-04-15 12:16:35,374 INFO L290 TraceCheckUtils]: 1: Hoare triple {3825#true} assume true; {3825#true} is VALID [2022-04-15 12:16:35,374 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3825#true} {3825#true} #34#return; {3825#true} is VALID [2022-04-15 12:16:35,374 INFO L272 TraceCheckUtils]: 0: Hoare triple {3825#true} call ULTIMATE.init(); {3831#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:35,374 INFO L290 TraceCheckUtils]: 1: Hoare triple {3831#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {3825#true} is VALID [2022-04-15 12:16:35,374 INFO L290 TraceCheckUtils]: 2: Hoare triple {3825#true} assume true; {3825#true} is VALID [2022-04-15 12:16:35,374 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3825#true} {3825#true} #34#return; {3825#true} is VALID [2022-04-15 12:16:35,375 INFO L272 TraceCheckUtils]: 4: Hoare triple {3825#true} call #t~ret5 := main(); {3825#true} is VALID [2022-04-15 12:16:35,375 INFO L290 TraceCheckUtils]: 5: Hoare triple {3825#true} ~x~0 := 1;~y~0 := 0; {3830#(= main_~y~0 0)} is VALID [2022-04-15 12:16:35,391 INFO L290 TraceCheckUtils]: 6: Hoare triple {3830#(= main_~y~0 0)} [78] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post4_Out_40| 1) (= v_main_~y~0_Out_40 0) (= v_main_~x~0_Out_40 0) (< (mod (+ 4294967295 v_main_~y~0_Out_40) 4294967296) 1024) (= v_main_~y~0_Out_40 v_main_~y~0_In_20)) (= v_main_~y~0_In_20 v_main_~y~0_Out_40)) InVars {main_~y~0=v_main_~y~0_In_20} OutVars{main_#t~post4=|v_main_#t~post4_Out_40|, main_~y~0=v_main_~y~0_Out_40, main_~x~0=v_main_~x~0_Out_40} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {3830#(= main_~y~0 0)} is VALID [2022-04-15 12:16:35,392 INFO L290 TraceCheckUtils]: 7: Hoare triple {3830#(= main_~y~0 0)} [77] L16-3_primed-->L16-3: Formula: (not (< (mod v_main_~y~0_4 4294967296) 1024)) InVars {main_~y~0=v_main_~y~0_4} OutVars{main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[] {3826#false} is VALID [2022-04-15 12:16:35,392 INFO L272 TraceCheckUtils]: 8: Hoare triple {3826#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {3826#false} is VALID [2022-04-15 12:16:35,392 INFO L290 TraceCheckUtils]: 9: Hoare triple {3826#false} ~cond := #in~cond; {3826#false} is VALID [2022-04-15 12:16:35,392 INFO L290 TraceCheckUtils]: 10: Hoare triple {3826#false} assume 0 == ~cond; {3826#false} is VALID [2022-04-15 12:16:35,393 INFO L290 TraceCheckUtils]: 11: Hoare triple {3826#false} assume !false; {3826#false} is VALID [2022-04-15 12:16:35,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:16:35,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:35,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766084317] [2022-04-15 12:16:35,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766084317] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:35,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:35,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:16:35,746 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:35,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [708030370] [2022-04-15 12:16:35,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [708030370] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:35,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:35,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-15 12:16:35,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226752014] [2022-04-15 12:16:35,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:35,747 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-15 12:16:35,748 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:35,748 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:35,770 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:35,770 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-15 12:16:35,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:35,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-15 12:16:35,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2022-04-15 12:16:35,771 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:37,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:37,108 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-04-15 12:16:37,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-15 12:16:37,109 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-15 12:16:37,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:37,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:37,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 38 transitions. [2022-04-15 12:16:37,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:37,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 38 transitions. [2022-04-15 12:16:37,110 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 38 transitions. [2022-04-15 12:16:37,141 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:37,142 INFO L225 Difference]: With dead ends: 38 [2022-04-15 12:16:37,142 INFO L226 Difference]: Without dead ends: 33 [2022-04-15 12:16:37,143 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=129, Invalid=1851, Unknown=0, NotChecked=0, Total=1980 [2022-04-15 12:16:37,144 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:37,144 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 118 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 12:16:37,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-15 12:16:37,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-15 12:16:37,146 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:37,146 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:37,146 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:37,146 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:37,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:37,147 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2022-04-15 12:16:37,147 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-04-15 12:16:37,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:37,147 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:37,147 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-15 12:16:37,148 INFO L87 Difference]: Start difference. First operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-15 12:16:37,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:37,148 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2022-04-15 12:16:37,148 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-04-15 12:16:37,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:37,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:37,149 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:37,149 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:37,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:37,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2022-04-15 12:16:37,149 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2022-04-15 12:16:37,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:37,150 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2022-04-15 12:16:37,150 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:37,150 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 33 transitions. [2022-04-15 12:16:37,207 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:37,208 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-04-15 12:16:37,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 12:16:37,208 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:37,208 INFO L499 BasicCegarLoop]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:37,208 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-15 12:16:37,209 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:37,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:37,209 INFO L85 PathProgramCache]: Analyzing trace with hash -934942218, now seen corresponding path program 21 times [2022-04-15 12:16:37,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:37,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [418259338] [2022-04-15 12:16:37,271 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:16:37,273 INFO L85 PathProgramCache]: Analyzing trace with hash -685200905, now seen corresponding path program 1 times [2022-04-15 12:16:37,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:37,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814713453] [2022-04-15 12:16:37,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:37,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:37,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:37,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:37,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:37,309 INFO L290 TraceCheckUtils]: 0: Hoare triple {4110#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {4104#true} is VALID [2022-04-15 12:16:37,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {4104#true} assume true; {4104#true} is VALID [2022-04-15 12:16:37,310 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4104#true} {4104#true} #34#return; {4104#true} is VALID [2022-04-15 12:16:37,310 INFO L272 TraceCheckUtils]: 0: Hoare triple {4104#true} call ULTIMATE.init(); {4110#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:37,315 INFO L290 TraceCheckUtils]: 1: Hoare triple {4110#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {4104#true} is VALID [2022-04-15 12:16:37,315 INFO L290 TraceCheckUtils]: 2: Hoare triple {4104#true} assume true; {4104#true} is VALID [2022-04-15 12:16:37,315 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4104#true} {4104#true} #34#return; {4104#true} is VALID [2022-04-15 12:16:37,315 INFO L272 TraceCheckUtils]: 4: Hoare triple {4104#true} call #t~ret5 := main(); {4104#true} is VALID [2022-04-15 12:16:37,315 INFO L290 TraceCheckUtils]: 5: Hoare triple {4104#true} ~x~0 := 1;~y~0 := 0; {4109#(= main_~y~0 0)} is VALID [2022-04-15 12:16:37,316 INFO L290 TraceCheckUtils]: 6: Hoare triple {4109#(= main_~y~0 0)} [80] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_Out_42 0) (= |v_main_#t~post4_Out_42| 1) (< (mod (+ 4294967295 v_main_~y~0_Out_42) 4294967296) 1024) (= v_main_~x~0_Out_42 0) (= v_main_~y~0_Out_42 v_main_~y~0_In_21)) (= v_main_~y~0_In_21 v_main_~y~0_Out_42)) InVars {main_~y~0=v_main_~y~0_In_21} OutVars{main_#t~post4=|v_main_#t~post4_Out_42|, main_~y~0=v_main_~y~0_Out_42, main_~x~0=v_main_~x~0_Out_42} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {4109#(= main_~y~0 0)} is VALID [2022-04-15 12:16:37,316 INFO L290 TraceCheckUtils]: 7: Hoare triple {4109#(= main_~y~0 0)} [79] L16-3_primed-->L16-3: Formula: (not (< (mod v_main_~y~0_4 4294967296) 1024)) InVars {main_~y~0=v_main_~y~0_4} OutVars{main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[] {4105#false} is VALID [2022-04-15 12:16:37,316 INFO L272 TraceCheckUtils]: 8: Hoare triple {4105#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {4105#false} is VALID [2022-04-15 12:16:37,317 INFO L290 TraceCheckUtils]: 9: Hoare triple {4105#false} ~cond := #in~cond; {4105#false} is VALID [2022-04-15 12:16:37,317 INFO L290 TraceCheckUtils]: 10: Hoare triple {4105#false} assume 0 == ~cond; {4105#false} is VALID [2022-04-15 12:16:37,317 INFO L290 TraceCheckUtils]: 11: Hoare triple {4105#false} assume !false; {4105#false} is VALID [2022-04-15 12:16:37,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:16:37,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:37,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814713453] [2022-04-15 12:16:37,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814713453] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:37,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:37,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:16:37,728 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:37,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [418259338] [2022-04-15 12:16:37,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [418259338] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:37,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:37,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-15 12:16:37,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268488834] [2022-04-15 12:16:37,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:37,729 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.12) internal successors, (28), 24 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-15 12:16:37,729 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:37,729 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 1.12) internal successors, (28), 24 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:37,752 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:37,752 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-15 12:16:37,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:37,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-15 12:16:37,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2022-04-15 12:16:37,753 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand has 25 states, 25 states have (on average 1.12) internal successors, (28), 24 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:39,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:39,235 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2022-04-15 12:16:39,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-15 12:16:39,236 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.12) internal successors, (28), 24 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-15 12:16:39,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:39,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.12) internal successors, (28), 24 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:39,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 39 transitions. [2022-04-15 12:16:39,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.12) internal successors, (28), 24 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:39,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 39 transitions. [2022-04-15 12:16:39,237 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 39 transitions. [2022-04-15 12:16:39,268 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:39,269 INFO L225 Difference]: With dead ends: 39 [2022-04-15 12:16:39,269 INFO L226 Difference]: Without dead ends: 34 [2022-04-15 12:16:39,270 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=135, Invalid=2027, Unknown=0, NotChecked=0, Total=2162 [2022-04-15 12:16:39,274 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:39,274 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 123 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-15 12:16:39,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-15 12:16:39,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-15 12:16:39,277 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:39,277 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:39,277 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:39,277 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:39,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:39,278 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-15 12:16:39,278 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-15 12:16:39,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:39,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:39,278 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34 states. [2022-04-15 12:16:39,278 INFO L87 Difference]: Start difference. First operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34 states. [2022-04-15 12:16:39,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:39,279 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-15 12:16:39,279 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-15 12:16:39,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:39,279 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:39,279 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:39,279 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:39,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:39,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2022-04-15 12:16:39,280 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2022-04-15 12:16:39,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:39,280 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2022-04-15 12:16:39,280 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.12) internal successors, (28), 24 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:39,280 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 34 transitions. [2022-04-15 12:16:39,314 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:39,314 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-15 12:16:39,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 12:16:39,314 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:39,314 INFO L499 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:39,315 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-15 12:16:39,315 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:39,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:39,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1118023580, now seen corresponding path program 22 times [2022-04-15 12:16:39,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:39,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [531514190] [2022-04-15 12:16:39,389 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:16:39,390 INFO L85 PathProgramCache]: Analyzing trace with hash -626095561, now seen corresponding path program 1 times [2022-04-15 12:16:39,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:39,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031658871] [2022-04-15 12:16:39,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:39,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:39,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:39,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:39,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:39,424 INFO L290 TraceCheckUtils]: 0: Hoare triple {4398#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {4392#true} is VALID [2022-04-15 12:16:39,424 INFO L290 TraceCheckUtils]: 1: Hoare triple {4392#true} assume true; {4392#true} is VALID [2022-04-15 12:16:39,424 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4392#true} {4392#true} #34#return; {4392#true} is VALID [2022-04-15 12:16:39,425 INFO L272 TraceCheckUtils]: 0: Hoare triple {4392#true} call ULTIMATE.init(); {4398#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:39,425 INFO L290 TraceCheckUtils]: 1: Hoare triple {4398#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {4392#true} is VALID [2022-04-15 12:16:39,425 INFO L290 TraceCheckUtils]: 2: Hoare triple {4392#true} assume true; {4392#true} is VALID [2022-04-15 12:16:39,425 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4392#true} {4392#true} #34#return; {4392#true} is VALID [2022-04-15 12:16:39,426 INFO L272 TraceCheckUtils]: 4: Hoare triple {4392#true} call #t~ret5 := main(); {4392#true} is VALID [2022-04-15 12:16:39,426 INFO L290 TraceCheckUtils]: 5: Hoare triple {4392#true} ~x~0 := 1;~y~0 := 0; {4397#(= main_~y~0 0)} is VALID [2022-04-15 12:16:39,427 INFO L290 TraceCheckUtils]: 6: Hoare triple {4397#(= main_~y~0 0)} [82] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_Out_44 0) (< (mod (+ 4294967295 v_main_~y~0_Out_44) 4294967296) 1024) (= v_main_~y~0_Out_44 0) (= v_main_~y~0_Out_44 v_main_~y~0_In_22) (= |v_main_#t~post4_Out_44| 1)) (= v_main_~y~0_In_22 v_main_~y~0_Out_44)) InVars {main_~y~0=v_main_~y~0_In_22} OutVars{main_#t~post4=|v_main_#t~post4_Out_44|, main_~y~0=v_main_~y~0_Out_44, main_~x~0=v_main_~x~0_Out_44} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {4397#(= main_~y~0 0)} is VALID [2022-04-15 12:16:39,427 INFO L290 TraceCheckUtils]: 7: Hoare triple {4397#(= main_~y~0 0)} [81] L16-3_primed-->L16-3: Formula: (not (< (mod v_main_~y~0_4 4294967296) 1024)) InVars {main_~y~0=v_main_~y~0_4} OutVars{main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[] {4393#false} is VALID [2022-04-15 12:16:39,427 INFO L272 TraceCheckUtils]: 8: Hoare triple {4393#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {4393#false} is VALID [2022-04-15 12:16:39,427 INFO L290 TraceCheckUtils]: 9: Hoare triple {4393#false} ~cond := #in~cond; {4393#false} is VALID [2022-04-15 12:16:39,428 INFO L290 TraceCheckUtils]: 10: Hoare triple {4393#false} assume 0 == ~cond; {4393#false} is VALID [2022-04-15 12:16:39,428 INFO L290 TraceCheckUtils]: 11: Hoare triple {4393#false} assume !false; {4393#false} is VALID [2022-04-15 12:16:39,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:16:39,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:39,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031658871] [2022-04-15 12:16:39,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031658871] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:39,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:39,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:16:39,857 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:39,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [531514190] [2022-04-15 12:16:39,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [531514190] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:39,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:39,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-15 12:16:39,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129045593] [2022-04-15 12:16:39,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:39,858 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 25 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-15 12:16:39,858 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:39,858 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 25 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:39,881 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:39,881 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-15 12:16:39,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:39,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-15 12:16:39,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2022-04-15 12:16:39,882 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand has 26 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 25 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:42,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:42,536 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-04-15 12:16:42,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-15 12:16:42,537 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 25 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-15 12:16:42,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:42,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 25 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:42,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 40 transitions. [2022-04-15 12:16:42,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 25 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:42,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 40 transitions. [2022-04-15 12:16:42,549 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 40 transitions. [2022-04-15 12:16:42,590 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 12:16:42,591 INFO L225 Difference]: With dead ends: 40 [2022-04-15 12:16:42,591 INFO L226 Difference]: Without dead ends: 35 [2022-04-15 12:16:42,592 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=141, Invalid=2211, Unknown=0, NotChecked=0, Total=2352 [2022-04-15 12:16:42,592 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:42,592 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 128 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 668 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-15 12:16:42,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-15 12:16:42,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-15 12:16:42,595 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:42,595 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:42,595 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:42,595 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:42,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:42,596 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2022-04-15 12:16:42,596 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2022-04-15 12:16:42,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:42,596 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:42,597 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-15 12:16:42,597 INFO L87 Difference]: Start difference. First operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-15 12:16:42,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:42,597 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2022-04-15 12:16:42,597 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2022-04-15 12:16:42,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:42,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:42,598 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:42,598 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:42,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:42,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2022-04-15 12:16:42,599 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2022-04-15 12:16:42,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:42,599 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2022-04-15 12:16:42,599 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 25 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:42,599 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 35 transitions. [2022-04-15 12:16:42,650 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:42,650 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2022-04-15 12:16:42,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-15 12:16:42,651 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:42,651 INFO L499 BasicCegarLoop]: trace histogram [23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:42,651 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-15 12:16:42,651 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:42,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:42,651 INFO L85 PathProgramCache]: Analyzing trace with hash 335453878, now seen corresponding path program 23 times [2022-04-15 12:16:42,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:42,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [649208068] [2022-04-15 12:16:42,713 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:16:42,714 INFO L85 PathProgramCache]: Analyzing trace with hash -566990217, now seen corresponding path program 1 times [2022-04-15 12:16:42,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:42,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671086735] [2022-04-15 12:16:42,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:42,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:42,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:42,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:42,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:42,754 INFO L290 TraceCheckUtils]: 0: Hoare triple {4695#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {4689#true} is VALID [2022-04-15 12:16:42,754 INFO L290 TraceCheckUtils]: 1: Hoare triple {4689#true} assume true; {4689#true} is VALID [2022-04-15 12:16:42,754 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4689#true} {4689#true} #34#return; {4689#true} is VALID [2022-04-15 12:16:42,755 INFO L272 TraceCheckUtils]: 0: Hoare triple {4689#true} call ULTIMATE.init(); {4695#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:42,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {4695#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {4689#true} is VALID [2022-04-15 12:16:42,755 INFO L290 TraceCheckUtils]: 2: Hoare triple {4689#true} assume true; {4689#true} is VALID [2022-04-15 12:16:42,755 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4689#true} {4689#true} #34#return; {4689#true} is VALID [2022-04-15 12:16:42,755 INFO L272 TraceCheckUtils]: 4: Hoare triple {4689#true} call #t~ret5 := main(); {4689#true} is VALID [2022-04-15 12:16:42,755 INFO L290 TraceCheckUtils]: 5: Hoare triple {4689#true} ~x~0 := 1;~y~0 := 0; {4694#(= main_~y~0 0)} is VALID [2022-04-15 12:16:42,756 INFO L290 TraceCheckUtils]: 6: Hoare triple {4694#(= main_~y~0 0)} [84] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post4_Out_46| 1) (< (mod (+ 4294967295 v_main_~y~0_Out_46) 4294967296) 1024) (= v_main_~y~0_Out_46 0) (= v_main_~x~0_Out_46 0) (= v_main_~y~0_Out_46 v_main_~y~0_In_23)) (= v_main_~y~0_In_23 v_main_~y~0_Out_46)) InVars {main_~y~0=v_main_~y~0_In_23} OutVars{main_#t~post4=|v_main_#t~post4_Out_46|, main_~y~0=v_main_~y~0_Out_46, main_~x~0=v_main_~x~0_Out_46} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {4694#(= main_~y~0 0)} is VALID [2022-04-15 12:16:42,756 INFO L290 TraceCheckUtils]: 7: Hoare triple {4694#(= main_~y~0 0)} [83] L16-3_primed-->L16-3: Formula: (not (< (mod v_main_~y~0_4 4294967296) 1024)) InVars {main_~y~0=v_main_~y~0_4} OutVars{main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[] {4690#false} is VALID [2022-04-15 12:16:42,757 INFO L272 TraceCheckUtils]: 8: Hoare triple {4690#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {4690#false} is VALID [2022-04-15 12:16:42,757 INFO L290 TraceCheckUtils]: 9: Hoare triple {4690#false} ~cond := #in~cond; {4690#false} is VALID [2022-04-15 12:16:42,757 INFO L290 TraceCheckUtils]: 10: Hoare triple {4690#false} assume 0 == ~cond; {4690#false} is VALID [2022-04-15 12:16:42,757 INFO L290 TraceCheckUtils]: 11: Hoare triple {4690#false} assume !false; {4690#false} is VALID [2022-04-15 12:16:42,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:16:42,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:42,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671086735] [2022-04-15 12:16:42,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671086735] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:42,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:42,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:16:43,276 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:43,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [649208068] [2022-04-15 12:16:43,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [649208068] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:43,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:43,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-15 12:16:43,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402573247] [2022-04-15 12:16:43,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:43,278 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-15 12:16:43,278 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:43,278 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:43,339 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:43,339 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-15 12:16:43,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:43,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-15 12:16:43,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2022-04-15 12:16:43,341 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:45,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:45,514 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2022-04-15 12:16:45,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-15 12:16:45,514 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-15 12:16:45,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:45,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:45,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 41 transitions. [2022-04-15 12:16:45,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:45,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 41 transitions. [2022-04-15 12:16:45,516 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 41 transitions. [2022-04-15 12:16:45,554 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:45,555 INFO L225 Difference]: With dead ends: 41 [2022-04-15 12:16:45,555 INFO L226 Difference]: Without dead ends: 36 [2022-04-15 12:16:45,556 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=147, Invalid=2403, Unknown=0, NotChecked=0, Total=2550 [2022-04-15 12:16:45,556 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:45,557 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 133 Invalid, 747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 721 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-15 12:16:45,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-15 12:16:45,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-15 12:16:45,559 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:45,559 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:45,559 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:45,559 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:45,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:45,560 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-15 12:16:45,560 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-04-15 12:16:45,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:45,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:45,560 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 36 states. [2022-04-15 12:16:45,561 INFO L87 Difference]: Start difference. First operand has 36 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 36 states. [2022-04-15 12:16:45,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:45,561 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-15 12:16:45,561 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-04-15 12:16:45,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:45,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:45,562 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:45,562 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:45,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:45,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2022-04-15 12:16:45,562 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2022-04-15 12:16:45,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:45,563 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2022-04-15 12:16:45,563 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:45,563 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 36 transitions. [2022-04-15 12:16:45,603 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:45,604 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-04-15 12:16:45,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-15 12:16:45,604 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:45,604 INFO L499 BasicCegarLoop]: trace histogram [24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:45,605 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-15 12:16:45,605 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:45,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:45,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1845596892, now seen corresponding path program 24 times [2022-04-15 12:16:45,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:45,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [175659764] [2022-04-15 12:16:45,662 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:16:45,664 INFO L85 PathProgramCache]: Analyzing trace with hash -507884873, now seen corresponding path program 1 times [2022-04-15 12:16:45,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:45,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095477968] [2022-04-15 12:16:45,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:45,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:45,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:45,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:45,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:45,709 INFO L290 TraceCheckUtils]: 0: Hoare triple {5001#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {4995#true} is VALID [2022-04-15 12:16:45,709 INFO L290 TraceCheckUtils]: 1: Hoare triple {4995#true} assume true; {4995#true} is VALID [2022-04-15 12:16:45,709 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4995#true} {4995#true} #34#return; {4995#true} is VALID [2022-04-15 12:16:45,714 INFO L272 TraceCheckUtils]: 0: Hoare triple {4995#true} call ULTIMATE.init(); {5001#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:45,714 INFO L290 TraceCheckUtils]: 1: Hoare triple {5001#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {4995#true} is VALID [2022-04-15 12:16:45,714 INFO L290 TraceCheckUtils]: 2: Hoare triple {4995#true} assume true; {4995#true} is VALID [2022-04-15 12:16:45,714 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4995#true} {4995#true} #34#return; {4995#true} is VALID [2022-04-15 12:16:45,714 INFO L272 TraceCheckUtils]: 4: Hoare triple {4995#true} call #t~ret5 := main(); {4995#true} is VALID [2022-04-15 12:16:45,715 INFO L290 TraceCheckUtils]: 5: Hoare triple {4995#true} ~x~0 := 1;~y~0 := 0; {5000#(= main_~y~0 0)} is VALID [2022-04-15 12:16:45,716 INFO L290 TraceCheckUtils]: 6: Hoare triple {5000#(= main_~y~0 0)} [86] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_Out_48 v_main_~y~0_In_24) (= |v_main_#t~post4_Out_48| 1) (= v_main_~x~0_Out_48 0) (= v_main_~y~0_Out_48 0) (< (mod (+ 4294967295 v_main_~y~0_Out_48) 4294967296) 1024)) (= v_main_~y~0_In_24 v_main_~y~0_Out_48)) InVars {main_~y~0=v_main_~y~0_In_24} OutVars{main_#t~post4=|v_main_#t~post4_Out_48|, main_~y~0=v_main_~y~0_Out_48, main_~x~0=v_main_~x~0_Out_48} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {5000#(= main_~y~0 0)} is VALID [2022-04-15 12:16:45,716 INFO L290 TraceCheckUtils]: 7: Hoare triple {5000#(= main_~y~0 0)} [85] L16-3_primed-->L16-3: Formula: (not (< (mod v_main_~y~0_4 4294967296) 1024)) InVars {main_~y~0=v_main_~y~0_4} OutVars{main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[] {4996#false} is VALID [2022-04-15 12:16:45,716 INFO L272 TraceCheckUtils]: 8: Hoare triple {4996#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {4996#false} is VALID [2022-04-15 12:16:45,716 INFO L290 TraceCheckUtils]: 9: Hoare triple {4996#false} ~cond := #in~cond; {4996#false} is VALID [2022-04-15 12:16:45,716 INFO L290 TraceCheckUtils]: 10: Hoare triple {4996#false} assume 0 == ~cond; {4996#false} is VALID [2022-04-15 12:16:45,717 INFO L290 TraceCheckUtils]: 11: Hoare triple {4996#false} assume !false; {4996#false} is VALID [2022-04-15 12:16:45,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:16:45,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:45,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095477968] [2022-04-15 12:16:45,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095477968] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:45,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:45,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:16:46,191 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:46,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [175659764] [2022-04-15 12:16:46,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [175659764] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:46,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:46,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-15 12:16:46,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110321349] [2022-04-15 12:16:46,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:46,192 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 27 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-15 12:16:46,193 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:46,193 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 27 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:46,223 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:46,223 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-15 12:16:46,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:46,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-15 12:16:46,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2022-04-15 12:16:46,224 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand has 28 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 27 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:48,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:48,282 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2022-04-15 12:16:48,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-15 12:16:48,282 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 27 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-15 12:16:48,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:48,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 27 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:48,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 42 transitions. [2022-04-15 12:16:48,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 27 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:48,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 42 transitions. [2022-04-15 12:16:48,284 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 42 transitions. [2022-04-15 12:16:48,322 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:48,323 INFO L225 Difference]: With dead ends: 42 [2022-04-15 12:16:48,323 INFO L226 Difference]: Without dead ends: 37 [2022-04-15 12:16:48,324 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=153, Invalid=2603, Unknown=0, NotChecked=0, Total=2756 [2022-04-15 12:16:48,324 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 776 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:48,324 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 138 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 776 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-15 12:16:48,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-15 12:16:48,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-15 12:16:48,327 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:48,333 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:48,333 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:48,333 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:48,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:48,335 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2022-04-15 12:16:48,335 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2022-04-15 12:16:48,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:48,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:48,335 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 37 states. [2022-04-15 12:16:48,335 INFO L87 Difference]: Start difference. First operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 37 states. [2022-04-15 12:16:48,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:48,337 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2022-04-15 12:16:48,337 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2022-04-15 12:16:48,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:48,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:48,337 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:48,337 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:48,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:48,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2022-04-15 12:16:48,338 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2022-04-15 12:16:48,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:48,338 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2022-04-15 12:16:48,338 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 27 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:48,338 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 37 transitions. [2022-04-15 12:16:48,377 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:48,378 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2022-04-15 12:16:48,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-15 12:16:48,378 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:48,378 INFO L499 BasicCegarLoop]: trace histogram [25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:48,378 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-15 12:16:48,379 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:48,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:48,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1415390070, now seen corresponding path program 25 times [2022-04-15 12:16:48,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:48,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [451712687] [2022-04-15 12:16:48,449 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:16:48,451 INFO L85 PathProgramCache]: Analyzing trace with hash -448779529, now seen corresponding path program 1 times [2022-04-15 12:16:48,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:48,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882718917] [2022-04-15 12:16:48,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:48,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:48,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:48,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:48,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:48,474 INFO L290 TraceCheckUtils]: 0: Hoare triple {5316#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {5310#true} is VALID [2022-04-15 12:16:48,474 INFO L290 TraceCheckUtils]: 1: Hoare triple {5310#true} assume true; {5310#true} is VALID [2022-04-15 12:16:48,474 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5310#true} {5310#true} #34#return; {5310#true} is VALID [2022-04-15 12:16:48,475 INFO L272 TraceCheckUtils]: 0: Hoare triple {5310#true} call ULTIMATE.init(); {5316#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:48,475 INFO L290 TraceCheckUtils]: 1: Hoare triple {5316#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {5310#true} is VALID [2022-04-15 12:16:48,475 INFO L290 TraceCheckUtils]: 2: Hoare triple {5310#true} assume true; {5310#true} is VALID [2022-04-15 12:16:48,475 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5310#true} {5310#true} #34#return; {5310#true} is VALID [2022-04-15 12:16:48,475 INFO L272 TraceCheckUtils]: 4: Hoare triple {5310#true} call #t~ret5 := main(); {5310#true} is VALID [2022-04-15 12:16:48,476 INFO L290 TraceCheckUtils]: 5: Hoare triple {5310#true} ~x~0 := 1;~y~0 := 0; {5315#(= main_~y~0 0)} is VALID [2022-04-15 12:16:48,476 INFO L290 TraceCheckUtils]: 6: Hoare triple {5315#(= main_~y~0 0)} [88] L16-2-->L16-3_primed: Formula: (or (= v_main_~y~0_In_25 v_main_~y~0_Out_50) (and (< (mod (+ 4294967295 v_main_~y~0_Out_50) 4294967296) 1024) (= |v_main_#t~post4_Out_50| 1) (= v_main_~x~0_Out_50 0) (= v_main_~y~0_Out_50 v_main_~y~0_In_25) (= v_main_~y~0_Out_50 0))) InVars {main_~y~0=v_main_~y~0_In_25} OutVars{main_#t~post4=|v_main_#t~post4_Out_50|, main_~y~0=v_main_~y~0_Out_50, main_~x~0=v_main_~x~0_Out_50} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {5315#(= main_~y~0 0)} is VALID [2022-04-15 12:16:48,477 INFO L290 TraceCheckUtils]: 7: Hoare triple {5315#(= main_~y~0 0)} [87] L16-3_primed-->L16-3: Formula: (not (< (mod v_main_~y~0_4 4294967296) 1024)) InVars {main_~y~0=v_main_~y~0_4} OutVars{main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[] {5311#false} is VALID [2022-04-15 12:16:48,477 INFO L272 TraceCheckUtils]: 8: Hoare triple {5311#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {5311#false} is VALID [2022-04-15 12:16:48,477 INFO L290 TraceCheckUtils]: 9: Hoare triple {5311#false} ~cond := #in~cond; {5311#false} is VALID [2022-04-15 12:16:48,477 INFO L290 TraceCheckUtils]: 10: Hoare triple {5311#false} assume 0 == ~cond; {5311#false} is VALID [2022-04-15 12:16:48,477 INFO L290 TraceCheckUtils]: 11: Hoare triple {5311#false} assume !false; {5311#false} is VALID [2022-04-15 12:16:48,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:16:48,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:48,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882718917] [2022-04-15 12:16:48,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882718917] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:48,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:48,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:16:48,962 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:48,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [451712687] [2022-04-15 12:16:48,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [451712687] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:48,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:48,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-04-15 12:16:48,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633683643] [2022-04-15 12:16:48,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:48,963 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.103448275862069) internal successors, (32), 28 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-04-15 12:16:48,963 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:48,963 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 29 states have (on average 1.103448275862069) internal successors, (32), 28 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:48,990 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:48,990 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-15 12:16:48,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:48,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-15 12:16:48,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2022-04-15 12:16:48,992 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand has 29 states, 29 states have (on average 1.103448275862069) internal successors, (32), 28 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:51,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:51,256 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2022-04-15 12:16:51,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-15 12:16:51,256 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.103448275862069) internal successors, (32), 28 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-04-15 12:16:51,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:51,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.103448275862069) internal successors, (32), 28 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:51,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 43 transitions. [2022-04-15 12:16:51,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.103448275862069) internal successors, (32), 28 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:51,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 43 transitions. [2022-04-15 12:16:51,258 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 43 transitions. [2022-04-15 12:16:51,301 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:51,302 INFO L225 Difference]: With dead ends: 43 [2022-04-15 12:16:51,302 INFO L226 Difference]: Without dead ends: 38 [2022-04-15 12:16:51,303 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=159, Invalid=2811, Unknown=0, NotChecked=0, Total=2970 [2022-04-15 12:16:51,303 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:51,303 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 143 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-15 12:16:51,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-15 12:16:51,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-15 12:16:51,306 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:51,306 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:51,306 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:51,306 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:51,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:51,307 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-04-15 12:16:51,307 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2022-04-15 12:16:51,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:51,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:51,307 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 38 states. [2022-04-15 12:16:51,307 INFO L87 Difference]: Start difference. First operand has 38 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 38 states. [2022-04-15 12:16:51,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:51,308 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-04-15 12:16:51,308 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2022-04-15 12:16:51,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:51,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:51,308 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:51,308 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:51,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:51,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2022-04-15 12:16:51,309 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2022-04-15 12:16:51,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:51,309 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2022-04-15 12:16:51,309 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.103448275862069) internal successors, (32), 28 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:51,309 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 38 transitions. [2022-04-15 12:16:51,354 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:51,355 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2022-04-15 12:16:51,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-15 12:16:51,355 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:51,355 INFO L499 BasicCegarLoop]: trace histogram [26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:51,355 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-04-15 12:16:51,355 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:51,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:51,356 INFO L85 PathProgramCache]: Analyzing trace with hash 963880476, now seen corresponding path program 26 times [2022-04-15 12:16:51,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:51,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [165645920] [2022-04-15 12:16:51,416 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:16:51,418 INFO L85 PathProgramCache]: Analyzing trace with hash -389674185, now seen corresponding path program 1 times [2022-04-15 12:16:51,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:51,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425357887] [2022-04-15 12:16:51,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:51,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:51,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:51,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:51,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:51,454 INFO L290 TraceCheckUtils]: 0: Hoare triple {5640#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {5634#true} is VALID [2022-04-15 12:16:51,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {5634#true} assume true; {5634#true} is VALID [2022-04-15 12:16:51,454 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5634#true} {5634#true} #34#return; {5634#true} is VALID [2022-04-15 12:16:51,455 INFO L272 TraceCheckUtils]: 0: Hoare triple {5634#true} call ULTIMATE.init(); {5640#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:51,455 INFO L290 TraceCheckUtils]: 1: Hoare triple {5640#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {5634#true} is VALID [2022-04-15 12:16:51,455 INFO L290 TraceCheckUtils]: 2: Hoare triple {5634#true} assume true; {5634#true} is VALID [2022-04-15 12:16:51,455 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5634#true} {5634#true} #34#return; {5634#true} is VALID [2022-04-15 12:16:51,456 INFO L272 TraceCheckUtils]: 4: Hoare triple {5634#true} call #t~ret5 := main(); {5634#true} is VALID [2022-04-15 12:16:51,456 INFO L290 TraceCheckUtils]: 5: Hoare triple {5634#true} ~x~0 := 1;~y~0 := 0; {5639#(= main_~y~0 0)} is VALID [2022-04-15 12:16:51,457 INFO L290 TraceCheckUtils]: 6: Hoare triple {5639#(= main_~y~0 0)} [90] L16-2-->L16-3_primed: Formula: (or (= v_main_~y~0_In_26 v_main_~y~0_Out_52) (and (= |v_main_#t~post4_Out_52| 1) (= v_main_~y~0_Out_52 v_main_~y~0_In_26) (= v_main_~y~0_Out_52 0) (< (mod (+ 4294967295 v_main_~y~0_Out_52) 4294967296) 1024) (= v_main_~x~0_Out_52 0))) InVars {main_~y~0=v_main_~y~0_In_26} OutVars{main_#t~post4=|v_main_#t~post4_Out_52|, main_~y~0=v_main_~y~0_Out_52, main_~x~0=v_main_~x~0_Out_52} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {5639#(= main_~y~0 0)} is VALID [2022-04-15 12:16:51,457 INFO L290 TraceCheckUtils]: 7: Hoare triple {5639#(= main_~y~0 0)} [89] L16-3_primed-->L16-3: Formula: (not (< (mod v_main_~y~0_4 4294967296) 1024)) InVars {main_~y~0=v_main_~y~0_4} OutVars{main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[] {5635#false} is VALID [2022-04-15 12:16:51,457 INFO L272 TraceCheckUtils]: 8: Hoare triple {5635#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {5635#false} is VALID [2022-04-15 12:16:51,457 INFO L290 TraceCheckUtils]: 9: Hoare triple {5635#false} ~cond := #in~cond; {5635#false} is VALID [2022-04-15 12:16:51,457 INFO L290 TraceCheckUtils]: 10: Hoare triple {5635#false} assume 0 == ~cond; {5635#false} is VALID [2022-04-15 12:16:51,457 INFO L290 TraceCheckUtils]: 11: Hoare triple {5635#false} assume !false; {5635#false} is VALID [2022-04-15 12:16:51,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:16:51,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:51,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425357887] [2022-04-15 12:16:51,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425357887] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:51,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:51,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:16:52,017 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:52,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [165645920] [2022-04-15 12:16:52,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [165645920] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:52,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:52,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-04-15 12:16:52,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176516038] [2022-04-15 12:16:52,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:52,018 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.1) internal successors, (33), 29 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-04-15 12:16:52,018 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:52,019 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 30 states have (on average 1.1) internal successors, (33), 29 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:52,093 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:52,093 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-15 12:16:52,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:52,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-15 12:16:52,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2022-04-15 12:16:52,095 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand has 30 states, 30 states have (on average 1.1) internal successors, (33), 29 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:55,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:55,060 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-04-15 12:16:55,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-15 12:16:55,060 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.1) internal successors, (33), 29 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-04-15 12:16:55,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:55,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.1) internal successors, (33), 29 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:55,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 44 transitions. [2022-04-15 12:16:55,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.1) internal successors, (33), 29 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:55,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 44 transitions. [2022-04-15 12:16:55,062 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 44 transitions. [2022-04-15 12:16:55,109 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:55,110 INFO L225 Difference]: With dead ends: 44 [2022-04-15 12:16:55,110 INFO L226 Difference]: Without dead ends: 39 [2022-04-15 12:16:55,111 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=165, Invalid=3027, Unknown=0, NotChecked=0, Total=3192 [2022-04-15 12:16:55,111 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 892 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 892 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:55,111 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 148 Invalid, 921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 892 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-15 12:16:55,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-15 12:16:55,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-15 12:16:55,113 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:55,114 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:55,114 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:55,114 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:55,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:55,114 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2022-04-15 12:16:55,114 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2022-04-15 12:16:55,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:55,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:55,131 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 39 states. [2022-04-15 12:16:55,131 INFO L87 Difference]: Start difference. First operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 39 states. [2022-04-15 12:16:55,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:55,132 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2022-04-15 12:16:55,132 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2022-04-15 12:16:55,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:55,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:55,132 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:55,132 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:55,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:55,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2022-04-15 12:16:55,133 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2022-04-15 12:16:55,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:55,133 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2022-04-15 12:16:55,134 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.1) internal successors, (33), 29 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:55,134 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 39 transitions. [2022-04-15 12:16:55,191 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:55,192 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2022-04-15 12:16:55,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-15 12:16:55,192 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:55,192 INFO L499 BasicCegarLoop]: trace histogram [27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:55,192 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-04-15 12:16:55,193 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:55,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:55,193 INFO L85 PathProgramCache]: Analyzing trace with hash -148015050, now seen corresponding path program 27 times [2022-04-15 12:16:55,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:55,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1943350985] [2022-04-15 12:16:55,250 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:16:55,251 INFO L85 PathProgramCache]: Analyzing trace with hash -330568841, now seen corresponding path program 1 times [2022-04-15 12:16:55,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:55,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006073401] [2022-04-15 12:16:55,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:55,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:55,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:55,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:55,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:55,288 INFO L290 TraceCheckUtils]: 0: Hoare triple {5973#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {5967#true} is VALID [2022-04-15 12:16:55,288 INFO L290 TraceCheckUtils]: 1: Hoare triple {5967#true} assume true; {5967#true} is VALID [2022-04-15 12:16:55,288 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5967#true} {5967#true} #34#return; {5967#true} is VALID [2022-04-15 12:16:55,288 INFO L272 TraceCheckUtils]: 0: Hoare triple {5967#true} call ULTIMATE.init(); {5973#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:55,288 INFO L290 TraceCheckUtils]: 1: Hoare triple {5973#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {5967#true} is VALID [2022-04-15 12:16:55,288 INFO L290 TraceCheckUtils]: 2: Hoare triple {5967#true} assume true; {5967#true} is VALID [2022-04-15 12:16:55,288 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5967#true} {5967#true} #34#return; {5967#true} is VALID [2022-04-15 12:16:55,289 INFO L272 TraceCheckUtils]: 4: Hoare triple {5967#true} call #t~ret5 := main(); {5967#true} is VALID [2022-04-15 12:16:55,289 INFO L290 TraceCheckUtils]: 5: Hoare triple {5967#true} ~x~0 := 1;~y~0 := 0; {5972#(= main_~y~0 0)} is VALID [2022-04-15 12:16:55,289 INFO L290 TraceCheckUtils]: 6: Hoare triple {5972#(= main_~y~0 0)} [92] L16-2-->L16-3_primed: Formula: (or (= v_main_~y~0_In_27 v_main_~y~0_Out_54) (and (< (mod (+ 4294967295 v_main_~y~0_Out_54) 4294967296) 1024) (= |v_main_#t~post4_Out_54| 1) (= v_main_~x~0_Out_54 0) (= v_main_~y~0_Out_54 0) (= v_main_~y~0_Out_54 v_main_~y~0_In_27))) InVars {main_~y~0=v_main_~y~0_In_27} OutVars{main_#t~post4=|v_main_#t~post4_Out_54|, main_~y~0=v_main_~y~0_Out_54, main_~x~0=v_main_~x~0_Out_54} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {5972#(= main_~y~0 0)} is VALID [2022-04-15 12:16:55,290 INFO L290 TraceCheckUtils]: 7: Hoare triple {5972#(= main_~y~0 0)} [91] L16-3_primed-->L16-3: Formula: (not (< (mod v_main_~y~0_4 4294967296) 1024)) InVars {main_~y~0=v_main_~y~0_4} OutVars{main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[] {5968#false} is VALID [2022-04-15 12:16:55,290 INFO L272 TraceCheckUtils]: 8: Hoare triple {5968#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {5968#false} is VALID [2022-04-15 12:16:55,290 INFO L290 TraceCheckUtils]: 9: Hoare triple {5968#false} ~cond := #in~cond; {5968#false} is VALID [2022-04-15 12:16:55,290 INFO L290 TraceCheckUtils]: 10: Hoare triple {5968#false} assume 0 == ~cond; {5968#false} is VALID [2022-04-15 12:16:55,290 INFO L290 TraceCheckUtils]: 11: Hoare triple {5968#false} assume !false; {5968#false} is VALID [2022-04-15 12:16:55,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:16:55,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:55,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006073401] [2022-04-15 12:16:55,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006073401] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:55,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:55,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:16:55,797 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:55,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1943350985] [2022-04-15 12:16:55,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1943350985] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:55,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:55,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-04-15 12:16:55,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212760291] [2022-04-15 12:16:55,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:55,798 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.096774193548387) internal successors, (34), 30 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-15 12:16:55,798 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:55,798 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 31 states, 31 states have (on average 1.096774193548387) internal successors, (34), 30 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:55,831 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:55,832 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-15 12:16:55,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:55,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-15 12:16:55,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2022-04-15 12:16:55,833 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand has 31 states, 31 states have (on average 1.096774193548387) internal successors, (34), 30 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:58,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:58,668 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2022-04-15 12:16:58,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-15 12:16:58,668 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.096774193548387) internal successors, (34), 30 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-15 12:16:58,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:58,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.096774193548387) internal successors, (34), 30 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:58,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2022-04-15 12:16:58,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.096774193548387) internal successors, (34), 30 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:58,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2022-04-15 12:16:58,670 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 45 transitions. [2022-04-15 12:16:58,717 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:58,718 INFO L225 Difference]: With dead ends: 45 [2022-04-15 12:16:58,718 INFO L226 Difference]: Without dead ends: 40 [2022-04-15 12:16:58,719 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=171, Invalid=3251, Unknown=0, NotChecked=0, Total=3422 [2022-04-15 12:16:58,719 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 953 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:58,719 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 153 Invalid, 983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 953 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-15 12:16:58,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-15 12:16:58,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-04-15 12:16:58,721 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:58,721 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 40 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:58,721 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 40 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:58,721 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 40 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:58,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:58,722 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-04-15 12:16:58,722 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2022-04-15 12:16:58,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:58,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:58,722 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 40 states. [2022-04-15 12:16:58,722 INFO L87 Difference]: Start difference. First operand has 40 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 40 states. [2022-04-15 12:16:58,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:58,723 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-04-15 12:16:58,723 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2022-04-15 12:16:58,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:58,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:58,723 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:58,723 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:58,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:58,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2022-04-15 12:16:58,724 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2022-04-15 12:16:58,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:58,724 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2022-04-15 12:16:58,724 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.096774193548387) internal successors, (34), 30 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:58,724 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 40 transitions. [2022-04-15 12:16:58,772 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 12:16:58,772 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2022-04-15 12:16:58,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-15 12:16:58,772 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:58,773 INFO L499 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:58,773 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-04-15 12:16:58,773 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:58,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:58,773 INFO L85 PathProgramCache]: Analyzing trace with hash -257037988, now seen corresponding path program 28 times [2022-04-15 12:16:58,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:58,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [90548684] [2022-04-15 12:16:58,829 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:16:58,831 INFO L85 PathProgramCache]: Analyzing trace with hash -271463497, now seen corresponding path program 1 times [2022-04-15 12:16:58,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:58,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709872092] [2022-04-15 12:16:58,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:58,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:58,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:58,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:58,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:58,865 INFO L290 TraceCheckUtils]: 0: Hoare triple {6315#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {6309#true} is VALID [2022-04-15 12:16:58,865 INFO L290 TraceCheckUtils]: 1: Hoare triple {6309#true} assume true; {6309#true} is VALID [2022-04-15 12:16:58,865 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6309#true} {6309#true} #34#return; {6309#true} is VALID [2022-04-15 12:16:58,866 INFO L272 TraceCheckUtils]: 0: Hoare triple {6309#true} call ULTIMATE.init(); {6315#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:58,866 INFO L290 TraceCheckUtils]: 1: Hoare triple {6315#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {6309#true} is VALID [2022-04-15 12:16:58,866 INFO L290 TraceCheckUtils]: 2: Hoare triple {6309#true} assume true; {6309#true} is VALID [2022-04-15 12:16:58,866 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6309#true} {6309#true} #34#return; {6309#true} is VALID [2022-04-15 12:16:58,866 INFO L272 TraceCheckUtils]: 4: Hoare triple {6309#true} call #t~ret5 := main(); {6309#true} is VALID [2022-04-15 12:16:58,866 INFO L290 TraceCheckUtils]: 5: Hoare triple {6309#true} ~x~0 := 1;~y~0 := 0; {6314#(= main_~y~0 0)} is VALID [2022-04-15 12:16:58,867 INFO L290 TraceCheckUtils]: 6: Hoare triple {6314#(= main_~y~0 0)} [94] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_Out_56 0) (= |v_main_#t~post4_Out_56| 1) (= v_main_~y~0_Out_56 0) (= v_main_~y~0_Out_56 v_main_~y~0_In_28) (< (mod (+ 4294967295 v_main_~y~0_Out_56) 4294967296) 1024)) (= v_main_~y~0_In_28 v_main_~y~0_Out_56)) InVars {main_~y~0=v_main_~y~0_In_28} OutVars{main_#t~post4=|v_main_#t~post4_Out_56|, main_~y~0=v_main_~y~0_Out_56, main_~x~0=v_main_~x~0_Out_56} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {6314#(= main_~y~0 0)} is VALID [2022-04-15 12:16:58,867 INFO L290 TraceCheckUtils]: 7: Hoare triple {6314#(= main_~y~0 0)} [93] L16-3_primed-->L16-3: Formula: (not (< (mod v_main_~y~0_4 4294967296) 1024)) InVars {main_~y~0=v_main_~y~0_4} OutVars{main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[] {6310#false} is VALID [2022-04-15 12:16:58,867 INFO L272 TraceCheckUtils]: 8: Hoare triple {6310#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {6310#false} is VALID [2022-04-15 12:16:58,867 INFO L290 TraceCheckUtils]: 9: Hoare triple {6310#false} ~cond := #in~cond; {6310#false} is VALID [2022-04-15 12:16:58,867 INFO L290 TraceCheckUtils]: 10: Hoare triple {6310#false} assume 0 == ~cond; {6310#false} is VALID [2022-04-15 12:16:58,867 INFO L290 TraceCheckUtils]: 11: Hoare triple {6310#false} assume !false; {6310#false} is VALID [2022-04-15 12:16:58,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:16:58,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:58,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709872092] [2022-04-15 12:16:58,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709872092] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:58,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:58,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:16:59,382 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:59,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [90548684] [2022-04-15 12:16:59,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [90548684] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:59,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:59,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-04-15 12:16:59,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425785047] [2022-04-15 12:16:59,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:59,383 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.09375) internal successors, (35), 31 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-04-15 12:16:59,383 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:59,383 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 32 states, 32 states have (on average 1.09375) internal successors, (35), 31 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:59,416 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:59,416 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-15 12:16:59,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:59,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-15 12:16:59,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2022-04-15 12:16:59,417 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand has 32 states, 32 states have (on average 1.09375) internal successors, (35), 31 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:02,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:02,522 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2022-04-15 12:17:02,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-15 12:17:02,522 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.09375) internal successors, (35), 31 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-04-15 12:17:02,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:02,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.09375) internal successors, (35), 31 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:02,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2022-04-15 12:17:02,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.09375) internal successors, (35), 31 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:02,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2022-04-15 12:17:02,524 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 46 transitions. [2022-04-15 12:17:02,587 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:02,588 INFO L225 Difference]: With dead ends: 46 [2022-04-15 12:17:02,588 INFO L226 Difference]: Without dead ends: 41 [2022-04-15 12:17:02,589 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=177, Invalid=3483, Unknown=0, NotChecked=0, Total=3660 [2022-04-15 12:17:02,590 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-15 12:17:02,590 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 158 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-15 12:17:02,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-15 12:17:02,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-04-15 12:17:02,593 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:02,593 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:02,593 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:02,593 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:02,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:02,594 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2022-04-15 12:17:02,594 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2022-04-15 12:17:02,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:02,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:02,594 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 41 states. [2022-04-15 12:17:02,594 INFO L87 Difference]: Start difference. First operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 41 states. [2022-04-15 12:17:02,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:02,595 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2022-04-15 12:17:02,595 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2022-04-15 12:17:02,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:02,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:02,595 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:02,595 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:02,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:02,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2022-04-15 12:17:02,596 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2022-04-15 12:17:02,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:02,596 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2022-04-15 12:17:02,596 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.09375) internal successors, (35), 31 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:02,596 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 41 transitions. [2022-04-15 12:17:02,663 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:02,664 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2022-04-15 12:17:02,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-15 12:17:02,664 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:02,664 INFO L499 BasicCegarLoop]: trace histogram [29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:02,664 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-04-15 12:17:02,665 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:02,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:02,665 INFO L85 PathProgramCache]: Analyzing trace with hash 658218230, now seen corresponding path program 29 times [2022-04-15 12:17:02,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:02,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [117817779] [2022-04-15 12:17:02,733 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:17:02,734 INFO L85 PathProgramCache]: Analyzing trace with hash -212358153, now seen corresponding path program 1 times [2022-04-15 12:17:02,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:02,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203093727] [2022-04-15 12:17:02,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:02,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:02,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:02,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:02,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:02,777 INFO L290 TraceCheckUtils]: 0: Hoare triple {6666#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {6660#true} is VALID [2022-04-15 12:17:02,778 INFO L290 TraceCheckUtils]: 1: Hoare triple {6660#true} assume true; {6660#true} is VALID [2022-04-15 12:17:02,778 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6660#true} {6660#true} #34#return; {6660#true} is VALID [2022-04-15 12:17:02,778 INFO L272 TraceCheckUtils]: 0: Hoare triple {6660#true} call ULTIMATE.init(); {6666#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:17:02,778 INFO L290 TraceCheckUtils]: 1: Hoare triple {6666#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {6660#true} is VALID [2022-04-15 12:17:02,778 INFO L290 TraceCheckUtils]: 2: Hoare triple {6660#true} assume true; {6660#true} is VALID [2022-04-15 12:17:02,778 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6660#true} {6660#true} #34#return; {6660#true} is VALID [2022-04-15 12:17:02,779 INFO L272 TraceCheckUtils]: 4: Hoare triple {6660#true} call #t~ret5 := main(); {6660#true} is VALID [2022-04-15 12:17:02,779 INFO L290 TraceCheckUtils]: 5: Hoare triple {6660#true} ~x~0 := 1;~y~0 := 0; {6665#(= main_~y~0 0)} is VALID [2022-04-15 12:17:02,779 INFO L290 TraceCheckUtils]: 6: Hoare triple {6665#(= main_~y~0 0)} [96] L16-2-->L16-3_primed: Formula: (or (= v_main_~y~0_In_29 v_main_~y~0_Out_58) (and (= v_main_~y~0_Out_58 0) (= v_main_~x~0_Out_58 0) (< (mod (+ 4294967295 v_main_~y~0_Out_58) 4294967296) 1024) (= |v_main_#t~post4_Out_58| 1) (= v_main_~y~0_Out_58 v_main_~y~0_In_29))) InVars {main_~y~0=v_main_~y~0_In_29} OutVars{main_#t~post4=|v_main_#t~post4_Out_58|, main_~y~0=v_main_~y~0_Out_58, main_~x~0=v_main_~x~0_Out_58} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {6665#(= main_~y~0 0)} is VALID [2022-04-15 12:17:02,780 INFO L290 TraceCheckUtils]: 7: Hoare triple {6665#(= main_~y~0 0)} [95] L16-3_primed-->L16-3: Formula: (not (< (mod v_main_~y~0_4 4294967296) 1024)) InVars {main_~y~0=v_main_~y~0_4} OutVars{main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[] {6661#false} is VALID [2022-04-15 12:17:02,780 INFO L272 TraceCheckUtils]: 8: Hoare triple {6661#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {6661#false} is VALID [2022-04-15 12:17:02,780 INFO L290 TraceCheckUtils]: 9: Hoare triple {6661#false} ~cond := #in~cond; {6661#false} is VALID [2022-04-15 12:17:02,780 INFO L290 TraceCheckUtils]: 10: Hoare triple {6661#false} assume 0 == ~cond; {6661#false} is VALID [2022-04-15 12:17:02,780 INFO L290 TraceCheckUtils]: 11: Hoare triple {6661#false} assume !false; {6661#false} is VALID [2022-04-15 12:17:02,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:17:02,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:02,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203093727] [2022-04-15 12:17:02,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203093727] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:02,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:02,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:17:03,424 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:03,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [117817779] [2022-04-15 12:17:03,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [117817779] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:03,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:03,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-04-15 12:17:03,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182032557] [2022-04-15 12:17:03,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:03,425 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 32 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-04-15 12:17:03,426 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:03,426 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 33 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 32 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:03,458 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 12:17:03,458 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-04-15 12:17:03,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:03,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-04-15 12:17:03,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2022-04-15 12:17:03,459 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand has 33 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 32 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:06,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:06,903 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2022-04-15 12:17:06,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-15 12:17:06,903 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 32 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-04-15 12:17:06,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:06,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 32 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:06,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 47 transitions. [2022-04-15 12:17:06,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 32 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:06,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 47 transitions. [2022-04-15 12:17:06,905 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 47 transitions. [2022-04-15 12:17:06,953 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:06,953 INFO L225 Difference]: With dead ends: 47 [2022-04-15 12:17:06,953 INFO L226 Difference]: Without dead ends: 42 [2022-04-15 12:17:06,954 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=183, Invalid=3723, Unknown=0, NotChecked=0, Total=3906 [2022-04-15 12:17:06,955 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 1113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-04-15 12:17:06,955 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 163 Invalid, 1113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-04-15 12:17:06,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-15 12:17:06,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-04-15 12:17:06,956 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:06,957 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 42 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:06,957 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 42 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:06,957 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 42 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:06,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:06,957 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2022-04-15 12:17:06,957 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2022-04-15 12:17:06,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:06,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:06,958 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 42 states. [2022-04-15 12:17:06,958 INFO L87 Difference]: Start difference. First operand has 42 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 42 states. [2022-04-15 12:17:06,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:06,958 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2022-04-15 12:17:06,959 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2022-04-15 12:17:06,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:06,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:06,959 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:06,959 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:06,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:06,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2022-04-15 12:17:06,959 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2022-04-15 12:17:06,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:06,960 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2022-04-15 12:17:06,960 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 32 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:06,960 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 42 transitions. [2022-04-15 12:17:07,006 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:07,006 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2022-04-15 12:17:07,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-15 12:17:07,006 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:07,007 INFO L499 BasicCegarLoop]: trace histogram [30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:07,007 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-04-15 12:17:07,007 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:07,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:07,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1033610084, now seen corresponding path program 30 times [2022-04-15 12:17:07,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:07,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [925745330] [2022-04-15 12:17:07,069 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:17:07,070 INFO L85 PathProgramCache]: Analyzing trace with hash -153252809, now seen corresponding path program 1 times [2022-04-15 12:17:07,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:07,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571079912] [2022-04-15 12:17:07,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:07,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:07,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:07,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:07,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:07,113 INFO L290 TraceCheckUtils]: 0: Hoare triple {7026#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {7020#true} is VALID [2022-04-15 12:17:07,113 INFO L290 TraceCheckUtils]: 1: Hoare triple {7020#true} assume true; {7020#true} is VALID [2022-04-15 12:17:07,113 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7020#true} {7020#true} #34#return; {7020#true} is VALID [2022-04-15 12:17:07,113 INFO L272 TraceCheckUtils]: 0: Hoare triple {7020#true} call ULTIMATE.init(); {7026#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:17:07,113 INFO L290 TraceCheckUtils]: 1: Hoare triple {7026#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {7020#true} is VALID [2022-04-15 12:17:07,114 INFO L290 TraceCheckUtils]: 2: Hoare triple {7020#true} assume true; {7020#true} is VALID [2022-04-15 12:17:07,114 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7020#true} {7020#true} #34#return; {7020#true} is VALID [2022-04-15 12:17:07,114 INFO L272 TraceCheckUtils]: 4: Hoare triple {7020#true} call #t~ret5 := main(); {7020#true} is VALID [2022-04-15 12:17:07,115 INFO L290 TraceCheckUtils]: 5: Hoare triple {7020#true} ~x~0 := 1;~y~0 := 0; {7025#(= main_~y~0 0)} is VALID [2022-04-15 12:17:07,115 INFO L290 TraceCheckUtils]: 6: Hoare triple {7025#(= main_~y~0 0)} [98] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_Out_60 0) (= v_main_~y~0_Out_60 v_main_~y~0_In_30) (= |v_main_#t~post4_Out_60| 1) (< (mod (+ 4294967295 v_main_~y~0_Out_60) 4294967296) 1024) (= v_main_~x~0_Out_60 0)) (= v_main_~y~0_In_30 v_main_~y~0_Out_60)) InVars {main_~y~0=v_main_~y~0_In_30} OutVars{main_#t~post4=|v_main_#t~post4_Out_60|, main_~y~0=v_main_~y~0_Out_60, main_~x~0=v_main_~x~0_Out_60} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {7025#(= main_~y~0 0)} is VALID [2022-04-15 12:17:07,116 INFO L290 TraceCheckUtils]: 7: Hoare triple {7025#(= main_~y~0 0)} [97] L16-3_primed-->L16-3: Formula: (not (< (mod v_main_~y~0_4 4294967296) 1024)) InVars {main_~y~0=v_main_~y~0_4} OutVars{main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[] {7021#false} is VALID [2022-04-15 12:17:07,116 INFO L272 TraceCheckUtils]: 8: Hoare triple {7021#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {7021#false} is VALID [2022-04-15 12:17:07,116 INFO L290 TraceCheckUtils]: 9: Hoare triple {7021#false} ~cond := #in~cond; {7021#false} is VALID [2022-04-15 12:17:07,116 INFO L290 TraceCheckUtils]: 10: Hoare triple {7021#false} assume 0 == ~cond; {7021#false} is VALID [2022-04-15 12:17:07,116 INFO L290 TraceCheckUtils]: 11: Hoare triple {7021#false} assume !false; {7021#false} is VALID [2022-04-15 12:17:07,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:17:07,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:07,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571079912] [2022-04-15 12:17:07,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571079912] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:07,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:07,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:17:07,712 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:07,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [925745330] [2022-04-15 12:17:07,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [925745330] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:07,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:07,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-04-15 12:17:07,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384086307] [2022-04-15 12:17:07,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:07,713 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 33 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-15 12:17:07,713 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:07,713 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 33 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:07,751 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:07,751 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-15 12:17:07,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:07,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-15 12:17:07,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2022-04-15 12:17:07,752 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 33 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:11,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:11,574 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2022-04-15 12:17:11,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-15 12:17:11,575 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 33 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-15 12:17:11,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:11,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 33 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:11,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2022-04-15 12:17:11,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 33 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:11,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2022-04-15 12:17:11,576 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 48 transitions. [2022-04-15 12:17:11,626 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:11,626 INFO L225 Difference]: With dead ends: 48 [2022-04-15 12:17:11,626 INFO L226 Difference]: Without dead ends: 43 [2022-04-15 12:17:11,628 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=189, Invalid=3971, Unknown=0, NotChecked=0, Total=4160 [2022-04-15 12:17:11,628 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 1181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:17:11,628 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 168 Invalid, 1181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1148 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-04-15 12:17:11,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-15 12:17:11,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-04-15 12:17:11,630 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:11,630 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:11,630 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:11,630 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:11,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:11,631 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2022-04-15 12:17:11,631 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2022-04-15 12:17:11,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:11,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:11,631 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 43 states. [2022-04-15 12:17:11,631 INFO L87 Difference]: Start difference. First operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 43 states. [2022-04-15 12:17:11,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:11,632 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2022-04-15 12:17:11,632 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2022-04-15 12:17:11,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:11,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:11,632 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:11,632 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:11,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:11,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2022-04-15 12:17:11,633 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2022-04-15 12:17:11,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:11,633 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2022-04-15 12:17:11,633 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 33 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:11,633 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 43 transitions. [2022-04-15 12:17:11,686 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:11,686 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2022-04-15 12:17:11,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-15 12:17:11,686 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:11,687 INFO L499 BasicCegarLoop]: trace histogram [31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:11,687 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-04-15 12:17:11,687 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:11,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:11,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1940680266, now seen corresponding path program 31 times [2022-04-15 12:17:11,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:11,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1193648232] [2022-04-15 12:17:11,742 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:17:11,743 INFO L85 PathProgramCache]: Analyzing trace with hash -94147465, now seen corresponding path program 1 times [2022-04-15 12:17:11,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:11,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369182530] [2022-04-15 12:17:11,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:11,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:11,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:11,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:11,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:11,769 INFO L290 TraceCheckUtils]: 0: Hoare triple {7395#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {7389#true} is VALID [2022-04-15 12:17:11,770 INFO L290 TraceCheckUtils]: 1: Hoare triple {7389#true} assume true; {7389#true} is VALID [2022-04-15 12:17:11,770 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7389#true} {7389#true} #34#return; {7389#true} is VALID [2022-04-15 12:17:11,770 INFO L272 TraceCheckUtils]: 0: Hoare triple {7389#true} call ULTIMATE.init(); {7395#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:17:11,770 INFO L290 TraceCheckUtils]: 1: Hoare triple {7395#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {7389#true} is VALID [2022-04-15 12:17:11,770 INFO L290 TraceCheckUtils]: 2: Hoare triple {7389#true} assume true; {7389#true} is VALID [2022-04-15 12:17:11,771 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7389#true} {7389#true} #34#return; {7389#true} is VALID [2022-04-15 12:17:11,771 INFO L272 TraceCheckUtils]: 4: Hoare triple {7389#true} call #t~ret5 := main(); {7389#true} is VALID [2022-04-15 12:17:11,771 INFO L290 TraceCheckUtils]: 5: Hoare triple {7389#true} ~x~0 := 1;~y~0 := 0; {7394#(= main_~y~0 0)} is VALID [2022-04-15 12:17:11,772 INFO L290 TraceCheckUtils]: 6: Hoare triple {7394#(= main_~y~0 0)} [100] L16-2-->L16-3_primed: Formula: (or (= v_main_~y~0_In_31 v_main_~y~0_Out_62) (and (< (mod (+ 4294967295 v_main_~y~0_Out_62) 4294967296) 1024) (= |v_main_#t~post4_Out_62| 1) (= v_main_~y~0_Out_62 0) (= v_main_~y~0_Out_62 v_main_~y~0_In_31) (= v_main_~x~0_Out_62 0))) InVars {main_~y~0=v_main_~y~0_In_31} OutVars{main_#t~post4=|v_main_#t~post4_Out_62|, main_~y~0=v_main_~y~0_Out_62, main_~x~0=v_main_~x~0_Out_62} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {7394#(= main_~y~0 0)} is VALID [2022-04-15 12:17:11,772 INFO L290 TraceCheckUtils]: 7: Hoare triple {7394#(= main_~y~0 0)} [99] L16-3_primed-->L16-3: Formula: (not (< (mod v_main_~y~0_4 4294967296) 1024)) InVars {main_~y~0=v_main_~y~0_4} OutVars{main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[] {7390#false} is VALID [2022-04-15 12:17:11,772 INFO L272 TraceCheckUtils]: 8: Hoare triple {7390#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {7390#false} is VALID [2022-04-15 12:17:11,772 INFO L290 TraceCheckUtils]: 9: Hoare triple {7390#false} ~cond := #in~cond; {7390#false} is VALID [2022-04-15 12:17:11,772 INFO L290 TraceCheckUtils]: 10: Hoare triple {7390#false} assume 0 == ~cond; {7390#false} is VALID [2022-04-15 12:17:11,772 INFO L290 TraceCheckUtils]: 11: Hoare triple {7390#false} assume !false; {7390#false} is VALID [2022-04-15 12:17:11,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:17:11,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:11,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369182530] [2022-04-15 12:17:11,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369182530] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:11,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:11,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:17:12,391 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:12,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1193648232] [2022-04-15 12:17:12,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1193648232] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:12,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:12,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2022-04-15 12:17:12,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169128144] [2022-04-15 12:17:12,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:12,392 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 34 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-15 12:17:12,392 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:12,392 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 35 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 34 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:12,428 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:12,429 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-04-15 12:17:12,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:12,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-04-15 12:17:12,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2022-04-15 12:17:12,430 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand has 35 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 34 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:16,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:16,713 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2022-04-15 12:17:16,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-15 12:17:16,713 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 34 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-15 12:17:16,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:16,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 34 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:16,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2022-04-15 12:17:16,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 34 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:16,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2022-04-15 12:17:16,715 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 49 transitions. [2022-04-15 12:17:16,771 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:16,771 INFO L225 Difference]: With dead ends: 49 [2022-04-15 12:17:16,771 INFO L226 Difference]: Without dead ends: 44 [2022-04-15 12:17:16,772 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=195, Invalid=4227, Unknown=0, NotChecked=0, Total=4422 [2022-04-15 12:17:16,772 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 1217 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 1251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:17:16,772 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 173 Invalid, 1251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1217 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-04-15 12:17:16,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-15 12:17:16,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-15 12:17:16,774 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:16,774 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 44 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:16,774 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 44 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:16,774 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 44 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:16,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:16,775 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-04-15 12:17:16,775 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2022-04-15 12:17:16,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:16,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:16,775 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 44 states. [2022-04-15 12:17:16,775 INFO L87 Difference]: Start difference. First operand has 44 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 44 states. [2022-04-15 12:17:16,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:16,776 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-04-15 12:17:16,776 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2022-04-15 12:17:16,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:16,776 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:16,776 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:16,776 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:16,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:16,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2022-04-15 12:17:16,777 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2022-04-15 12:17:16,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:16,777 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2022-04-15 12:17:16,777 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 34 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:16,777 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 44 transitions. [2022-04-15 12:17:16,839 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:16,839 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2022-04-15 12:17:16,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-15 12:17:16,840 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:16,840 INFO L499 BasicCegarLoop]: trace histogram [32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:16,840 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-04-15 12:17:16,840 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:16,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:16,840 INFO L85 PathProgramCache]: Analyzing trace with hash 4915164, now seen corresponding path program 32 times [2022-04-15 12:17:16,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:16,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1481262579] [2022-04-15 12:17:16,899 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:17:16,900 INFO L85 PathProgramCache]: Analyzing trace with hash -35042121, now seen corresponding path program 1 times [2022-04-15 12:17:16,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:16,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161064807] [2022-04-15 12:17:16,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:16,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:16,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:16,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:16,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:16,930 INFO L290 TraceCheckUtils]: 0: Hoare triple {7773#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {7767#true} is VALID [2022-04-15 12:17:16,930 INFO L290 TraceCheckUtils]: 1: Hoare triple {7767#true} assume true; {7767#true} is VALID [2022-04-15 12:17:16,930 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7767#true} {7767#true} #34#return; {7767#true} is VALID [2022-04-15 12:17:16,931 INFO L272 TraceCheckUtils]: 0: Hoare triple {7767#true} call ULTIMATE.init(); {7773#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:17:16,931 INFO L290 TraceCheckUtils]: 1: Hoare triple {7773#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {7767#true} is VALID [2022-04-15 12:17:16,931 INFO L290 TraceCheckUtils]: 2: Hoare triple {7767#true} assume true; {7767#true} is VALID [2022-04-15 12:17:16,931 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7767#true} {7767#true} #34#return; {7767#true} is VALID [2022-04-15 12:17:16,931 INFO L272 TraceCheckUtils]: 4: Hoare triple {7767#true} call #t~ret5 := main(); {7767#true} is VALID [2022-04-15 12:17:16,931 INFO L290 TraceCheckUtils]: 5: Hoare triple {7767#true} ~x~0 := 1;~y~0 := 0; {7772#(= main_~y~0 0)} is VALID [2022-04-15 12:17:16,932 INFO L290 TraceCheckUtils]: 6: Hoare triple {7772#(= main_~y~0 0)} [102] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_Out_64 0) (= v_main_~y~0_Out_64 v_main_~y~0_In_32) (< (mod (+ 4294967295 v_main_~y~0_Out_64) 4294967296) 1024) (= |v_main_#t~post4_Out_64| 1) (= v_main_~x~0_Out_64 0)) (= v_main_~y~0_In_32 v_main_~y~0_Out_64)) InVars {main_~y~0=v_main_~y~0_In_32} OutVars{main_#t~post4=|v_main_#t~post4_Out_64|, main_~y~0=v_main_~y~0_Out_64, main_~x~0=v_main_~x~0_Out_64} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {7772#(= main_~y~0 0)} is VALID [2022-04-15 12:17:16,932 INFO L290 TraceCheckUtils]: 7: Hoare triple {7772#(= main_~y~0 0)} [101] L16-3_primed-->L16-3: Formula: (not (< (mod v_main_~y~0_4 4294967296) 1024)) InVars {main_~y~0=v_main_~y~0_4} OutVars{main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[] {7768#false} is VALID [2022-04-15 12:17:16,932 INFO L272 TraceCheckUtils]: 8: Hoare triple {7768#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {7768#false} is VALID [2022-04-15 12:17:16,933 INFO L290 TraceCheckUtils]: 9: Hoare triple {7768#false} ~cond := #in~cond; {7768#false} is VALID [2022-04-15 12:17:16,933 INFO L290 TraceCheckUtils]: 10: Hoare triple {7768#false} assume 0 == ~cond; {7768#false} is VALID [2022-04-15 12:17:16,933 INFO L290 TraceCheckUtils]: 11: Hoare triple {7768#false} assume !false; {7768#false} is VALID [2022-04-15 12:17:16,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:17:16,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:16,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161064807] [2022-04-15 12:17:16,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161064807] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:16,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:16,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:17:17,622 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:17,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1481262579] [2022-04-15 12:17:17,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1481262579] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:17,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:17,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-04-15 12:17:17,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719249139] [2022-04-15 12:17:17,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:17,623 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 35 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-04-15 12:17:17,623 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:17,623 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 36 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 35 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:17,673 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:17,673 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-04-15 12:17:17,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:17,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-04-15 12:17:17,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2022-04-15 12:17:17,674 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand has 36 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 35 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:22,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:22,596 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2022-04-15 12:17:22,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-15 12:17:22,596 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 35 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-04-15 12:17:22,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:22,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 35 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:22,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 50 transitions. [2022-04-15 12:17:22,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 35 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:22,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 50 transitions. [2022-04-15 12:17:22,598 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 50 transitions. [2022-04-15 12:17:22,659 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:22,660 INFO L225 Difference]: With dead ends: 50 [2022-04-15 12:17:22,660 INFO L226 Difference]: Without dead ends: 45 [2022-04-15 12:17:22,661 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=201, Invalid=4491, Unknown=0, NotChecked=0, Total=4692 [2022-04-15 12:17:22,661 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 1288 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 1323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-04-15 12:17:22,661 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 178 Invalid, 1323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1288 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-04-15 12:17:22,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-15 12:17:22,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-04-15 12:17:22,663 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:22,663 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:22,663 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:22,663 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:22,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:22,664 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2022-04-15 12:17:22,664 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2022-04-15 12:17:22,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:22,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:22,664 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 45 states. [2022-04-15 12:17:22,664 INFO L87 Difference]: Start difference. First operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 45 states. [2022-04-15 12:17:22,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:22,665 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2022-04-15 12:17:22,665 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2022-04-15 12:17:22,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:22,665 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:22,665 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:22,665 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:22,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:22,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2022-04-15 12:17:22,666 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2022-04-15 12:17:22,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:22,666 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2022-04-15 12:17:22,666 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 35 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:22,666 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 45 transitions. [2022-04-15 12:17:22,741 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:22,742 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2022-04-15 12:17:22,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-15 12:17:22,742 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:22,742 INFO L499 BasicCegarLoop]: trace histogram [33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:22,742 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-04-15 12:17:22,742 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:22,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:22,743 INFO L85 PathProgramCache]: Analyzing trace with hash 188831350, now seen corresponding path program 33 times [2022-04-15 12:17:22,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:22,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1203290466] [2022-04-15 12:17:22,797 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:17:22,798 INFO L85 PathProgramCache]: Analyzing trace with hash 24063223, now seen corresponding path program 1 times [2022-04-15 12:17:22,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:22,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416100817] [2022-04-15 12:17:22,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:22,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:22,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:22,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:22,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:22,826 INFO L290 TraceCheckUtils]: 0: Hoare triple {8160#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {8154#true} is VALID [2022-04-15 12:17:22,826 INFO L290 TraceCheckUtils]: 1: Hoare triple {8154#true} assume true; {8154#true} is VALID [2022-04-15 12:17:22,826 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8154#true} {8154#true} #34#return; {8154#true} is VALID [2022-04-15 12:17:22,827 INFO L272 TraceCheckUtils]: 0: Hoare triple {8154#true} call ULTIMATE.init(); {8160#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:17:22,827 INFO L290 TraceCheckUtils]: 1: Hoare triple {8160#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {8154#true} is VALID [2022-04-15 12:17:22,827 INFO L290 TraceCheckUtils]: 2: Hoare triple {8154#true} assume true; {8154#true} is VALID [2022-04-15 12:17:22,827 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8154#true} {8154#true} #34#return; {8154#true} is VALID [2022-04-15 12:17:22,827 INFO L272 TraceCheckUtils]: 4: Hoare triple {8154#true} call #t~ret5 := main(); {8154#true} is VALID [2022-04-15 12:17:22,827 INFO L290 TraceCheckUtils]: 5: Hoare triple {8154#true} ~x~0 := 1;~y~0 := 0; {8159#(= main_~y~0 0)} is VALID [2022-04-15 12:17:22,828 INFO L290 TraceCheckUtils]: 6: Hoare triple {8159#(= main_~y~0 0)} [104] L16-2-->L16-3_primed: Formula: (or (= v_main_~y~0_In_33 v_main_~y~0_Out_66) (and (< (mod (+ 4294967295 v_main_~y~0_Out_66) 4294967296) 1024) (= v_main_~y~0_Out_66 v_main_~y~0_In_33) (= |v_main_#t~post4_Out_66| 1) (= v_main_~y~0_Out_66 0) (= v_main_~x~0_Out_66 0))) InVars {main_~y~0=v_main_~y~0_In_33} OutVars{main_#t~post4=|v_main_#t~post4_Out_66|, main_~y~0=v_main_~y~0_Out_66, main_~x~0=v_main_~x~0_Out_66} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {8159#(= main_~y~0 0)} is VALID [2022-04-15 12:17:22,828 INFO L290 TraceCheckUtils]: 7: Hoare triple {8159#(= main_~y~0 0)} [103] L16-3_primed-->L16-3: Formula: (not (< (mod v_main_~y~0_4 4294967296) 1024)) InVars {main_~y~0=v_main_~y~0_4} OutVars{main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[] {8155#false} is VALID [2022-04-15 12:17:22,828 INFO L272 TraceCheckUtils]: 8: Hoare triple {8155#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {8155#false} is VALID [2022-04-15 12:17:22,828 INFO L290 TraceCheckUtils]: 9: Hoare triple {8155#false} ~cond := #in~cond; {8155#false} is VALID [2022-04-15 12:17:22,828 INFO L290 TraceCheckUtils]: 10: Hoare triple {8155#false} assume 0 == ~cond; {8155#false} is VALID [2022-04-15 12:17:22,828 INFO L290 TraceCheckUtils]: 11: Hoare triple {8155#false} assume !false; {8155#false} is VALID [2022-04-15 12:17:22,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:17:22,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:22,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416100817] [2022-04-15 12:17:22,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416100817] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:22,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:22,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:17:23,510 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:23,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1203290466] [2022-04-15 12:17:23,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1203290466] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:23,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:23,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2022-04-15 12:17:23,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588544283] [2022-04-15 12:17:23,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:23,511 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 36 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-15 12:17:23,512 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:23,512 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 37 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 36 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:23,554 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:23,554 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-04-15 12:17:23,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:23,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-04-15 12:17:23,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2022-04-15 12:17:23,555 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand has 37 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 36 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:29,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:29,042 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2022-04-15 12:17:29,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-15 12:17:29,042 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 36 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-15 12:17:29,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:29,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 36 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:29,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2022-04-15 12:17:29,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 36 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:29,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2022-04-15 12:17:29,044 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 51 transitions. [2022-04-15 12:17:29,116 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 12:17:29,116 INFO L225 Difference]: With dead ends: 51 [2022-04-15 12:17:29,116 INFO L226 Difference]: Without dead ends: 46 [2022-04-15 12:17:29,117 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=207, Invalid=4763, Unknown=0, NotChecked=0, Total=4970 [2022-04-15 12:17:29,118 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 1361 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 1397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:17:29,118 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 183 Invalid, 1397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1361 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-04-15 12:17:29,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-15 12:17:29,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-04-15 12:17:29,119 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:29,119 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 46 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:29,120 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 46 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:29,120 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 46 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:29,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:29,120 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2022-04-15 12:17:29,120 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2022-04-15 12:17:29,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:29,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:29,121 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 46 states. [2022-04-15 12:17:29,121 INFO L87 Difference]: Start difference. First operand has 46 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 46 states. [2022-04-15 12:17:29,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:29,121 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2022-04-15 12:17:29,121 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2022-04-15 12:17:29,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:29,121 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:29,121 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:29,122 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:29,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:29,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2022-04-15 12:17:29,122 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2022-04-15 12:17:29,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:29,122 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2022-04-15 12:17:29,122 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 36 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:29,122 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 46 transitions. [2022-04-15 12:17:29,197 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:29,198 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2022-04-15 12:17:29,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-15 12:17:29,198 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:29,198 INFO L499 BasicCegarLoop]: trace histogram [34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:29,198 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-04-15 12:17:29,199 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:29,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:29,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1595265820, now seen corresponding path program 34 times [2022-04-15 12:17:29,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:29,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [143277318] [2022-04-15 12:17:29,255 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:17:29,257 INFO L85 PathProgramCache]: Analyzing trace with hash 83168567, now seen corresponding path program 1 times [2022-04-15 12:17:29,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:29,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022559950] [2022-04-15 12:17:29,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:29,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:29,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:29,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:29,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:29,282 INFO L290 TraceCheckUtils]: 0: Hoare triple {8556#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {8550#true} is VALID [2022-04-15 12:17:29,283 INFO L290 TraceCheckUtils]: 1: Hoare triple {8550#true} assume true; {8550#true} is VALID [2022-04-15 12:17:29,283 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8550#true} {8550#true} #34#return; {8550#true} is VALID [2022-04-15 12:17:29,283 INFO L272 TraceCheckUtils]: 0: Hoare triple {8550#true} call ULTIMATE.init(); {8556#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:17:29,283 INFO L290 TraceCheckUtils]: 1: Hoare triple {8556#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {8550#true} is VALID [2022-04-15 12:17:29,283 INFO L290 TraceCheckUtils]: 2: Hoare triple {8550#true} assume true; {8550#true} is VALID [2022-04-15 12:17:29,283 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8550#true} {8550#true} #34#return; {8550#true} is VALID [2022-04-15 12:17:29,284 INFO L272 TraceCheckUtils]: 4: Hoare triple {8550#true} call #t~ret5 := main(); {8550#true} is VALID [2022-04-15 12:17:29,284 INFO L290 TraceCheckUtils]: 5: Hoare triple {8550#true} ~x~0 := 1;~y~0 := 0; {8555#(= main_~y~0 0)} is VALID [2022-04-15 12:17:29,284 INFO L290 TraceCheckUtils]: 6: Hoare triple {8555#(= main_~y~0 0)} [106] L16-2-->L16-3_primed: Formula: (or (= v_main_~y~0_In_34 v_main_~y~0_Out_68) (and (< (mod (+ 4294967295 v_main_~y~0_Out_68) 4294967296) 1024) (= v_main_~x~0_Out_68 0) (= v_main_~y~0_Out_68 0) (= |v_main_#t~post4_Out_68| 1) (= v_main_~y~0_Out_68 v_main_~y~0_In_34))) InVars {main_~y~0=v_main_~y~0_In_34} OutVars{main_#t~post4=|v_main_#t~post4_Out_68|, main_~y~0=v_main_~y~0_Out_68, main_~x~0=v_main_~x~0_Out_68} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {8555#(= main_~y~0 0)} is VALID [2022-04-15 12:17:29,285 INFO L290 TraceCheckUtils]: 7: Hoare triple {8555#(= main_~y~0 0)} [105] L16-3_primed-->L16-3: Formula: (not (< (mod v_main_~y~0_4 4294967296) 1024)) InVars {main_~y~0=v_main_~y~0_4} OutVars{main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[] {8551#false} is VALID [2022-04-15 12:17:29,285 INFO L272 TraceCheckUtils]: 8: Hoare triple {8551#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {8551#false} is VALID [2022-04-15 12:17:29,285 INFO L290 TraceCheckUtils]: 9: Hoare triple {8551#false} ~cond := #in~cond; {8551#false} is VALID [2022-04-15 12:17:29,285 INFO L290 TraceCheckUtils]: 10: Hoare triple {8551#false} assume 0 == ~cond; {8551#false} is VALID [2022-04-15 12:17:29,285 INFO L290 TraceCheckUtils]: 11: Hoare triple {8551#false} assume !false; {8551#false} is VALID [2022-04-15 12:17:29,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:17:29,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:29,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022559950] [2022-04-15 12:17:29,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022559950] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:29,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:29,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:17:29,964 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:29,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [143277318] [2022-04-15 12:17:29,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [143277318] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:29,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:29,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2022-04-15 12:17:29,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910075463] [2022-04-15 12:17:29,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:29,965 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 37 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-04-15 12:17:29,965 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:29,965 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 38 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 37 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:30,020 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:30,021 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-04-15 12:17:30,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:30,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-04-15 12:17:30,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2022-04-15 12:17:30,022 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand has 38 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 37 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:36,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:36,492 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2022-04-15 12:17:36,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-15 12:17:36,492 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 37 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-04-15 12:17:36,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:36,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 37 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:36,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 52 transitions. [2022-04-15 12:17:36,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 37 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:36,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 52 transitions. [2022-04-15 12:17:36,494 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 52 transitions. [2022-04-15 12:17:36,571 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:36,572 INFO L225 Difference]: With dead ends: 52 [2022-04-15 12:17:36,572 INFO L226 Difference]: Without dead ends: 47 [2022-04-15 12:17:36,573 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=213, Invalid=5043, Unknown=0, NotChecked=0, Total=5256 [2022-04-15 12:17:36,573 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 1436 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 1473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-04-15 12:17:36,574 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 188 Invalid, 1473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1436 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-04-15 12:17:36,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-15 12:17:36,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-15 12:17:36,576 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:36,576 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:36,576 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:36,576 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:36,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:36,577 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2022-04-15 12:17:36,577 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2022-04-15 12:17:36,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:36,577 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:36,577 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 47 states. [2022-04-15 12:17:36,577 INFO L87 Difference]: Start difference. First operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 47 states. [2022-04-15 12:17:36,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:36,578 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2022-04-15 12:17:36,578 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2022-04-15 12:17:36,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:36,578 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:36,578 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:36,578 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:36,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:36,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2022-04-15 12:17:36,579 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2022-04-15 12:17:36,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:36,579 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2022-04-15 12:17:36,580 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 37 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:36,580 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 47 transitions. [2022-04-15 12:17:36,738 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:36,739 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2022-04-15 12:17:36,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-15 12:17:36,739 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:36,739 INFO L499 BasicCegarLoop]: trace histogram [35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:36,739 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-04-15 12:17:36,739 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:36,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:36,740 INFO L85 PathProgramCache]: Analyzing trace with hash -2049905866, now seen corresponding path program 35 times [2022-04-15 12:17:36,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:36,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [856153015] [2022-04-15 12:17:36,808 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:17:36,809 INFO L85 PathProgramCache]: Analyzing trace with hash 142273911, now seen corresponding path program 1 times [2022-04-15 12:17:36,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:36,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605555060] [2022-04-15 12:17:36,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:36,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:36,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:36,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:36,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:36,858 INFO L290 TraceCheckUtils]: 0: Hoare triple {8961#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {8955#true} is VALID [2022-04-15 12:17:36,858 INFO L290 TraceCheckUtils]: 1: Hoare triple {8955#true} assume true; {8955#true} is VALID [2022-04-15 12:17:36,858 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8955#true} {8955#true} #34#return; {8955#true} is VALID [2022-04-15 12:17:36,859 INFO L272 TraceCheckUtils]: 0: Hoare triple {8955#true} call ULTIMATE.init(); {8961#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:17:36,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {8961#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {8955#true} is VALID [2022-04-15 12:17:36,859 INFO L290 TraceCheckUtils]: 2: Hoare triple {8955#true} assume true; {8955#true} is VALID [2022-04-15 12:17:36,859 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8955#true} {8955#true} #34#return; {8955#true} is VALID [2022-04-15 12:17:36,859 INFO L272 TraceCheckUtils]: 4: Hoare triple {8955#true} call #t~ret5 := main(); {8955#true} is VALID [2022-04-15 12:17:36,860 INFO L290 TraceCheckUtils]: 5: Hoare triple {8955#true} ~x~0 := 1;~y~0 := 0; {8960#(= main_~y~0 0)} is VALID [2022-04-15 12:17:36,860 INFO L290 TraceCheckUtils]: 6: Hoare triple {8960#(= main_~y~0 0)} [108] L16-2-->L16-3_primed: Formula: (or (= v_main_~y~0_In_35 v_main_~y~0_Out_70) (and (< (mod (+ 4294967295 v_main_~y~0_Out_70) 4294967296) 1024) (= v_main_~y~0_Out_70 0) (= |v_main_#t~post4_Out_70| 1) (= v_main_~x~0_Out_70 0) (= v_main_~y~0_Out_70 v_main_~y~0_In_35))) InVars {main_~y~0=v_main_~y~0_In_35} OutVars{main_#t~post4=|v_main_#t~post4_Out_70|, main_~y~0=v_main_~y~0_Out_70, main_~x~0=v_main_~x~0_Out_70} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {8960#(= main_~y~0 0)} is VALID [2022-04-15 12:17:36,861 INFO L290 TraceCheckUtils]: 7: Hoare triple {8960#(= main_~y~0 0)} [107] L16-3_primed-->L16-3: Formula: (not (< (mod v_main_~y~0_4 4294967296) 1024)) InVars {main_~y~0=v_main_~y~0_4} OutVars{main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[] {8956#false} is VALID [2022-04-15 12:17:36,861 INFO L272 TraceCheckUtils]: 8: Hoare triple {8956#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {8956#false} is VALID [2022-04-15 12:17:36,861 INFO L290 TraceCheckUtils]: 9: Hoare triple {8956#false} ~cond := #in~cond; {8956#false} is VALID [2022-04-15 12:17:36,861 INFO L290 TraceCheckUtils]: 10: Hoare triple {8956#false} assume 0 == ~cond; {8956#false} is VALID [2022-04-15 12:17:36,861 INFO L290 TraceCheckUtils]: 11: Hoare triple {8956#false} assume !false; {8956#false} is VALID [2022-04-15 12:17:36,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:17:36,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:36,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605555060] [2022-04-15 12:17:36,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605555060] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:36,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:36,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:17:37,653 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:37,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [856153015] [2022-04-15 12:17:37,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [856153015] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:37,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:37,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2022-04-15 12:17:37,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713052174] [2022-04-15 12:17:37,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:37,654 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 38 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2022-04-15 12:17:37,654 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:37,655 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 39 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 38 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:37,702 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:37,702 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-04-15 12:17:37,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:37,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-04-15 12:17:37,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2022-04-15 12:17:37,703 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand has 39 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 38 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:45,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:45,391 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2022-04-15 12:17:45,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-04-15 12:17:45,391 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 38 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2022-04-15 12:17:45,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:45,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 38 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:45,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2022-04-15 12:17:45,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 38 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:45,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2022-04-15 12:17:45,392 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 53 transitions. [2022-04-15 12:17:45,474 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 12:17:45,474 INFO L225 Difference]: With dead ends: 53 [2022-04-15 12:17:45,474 INFO L226 Difference]: Without dead ends: 48 [2022-04-15 12:17:45,475 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=219, Invalid=5331, Unknown=0, NotChecked=0, Total=5550 [2022-04-15 12:17:45,475 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 1513 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 1551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:17:45,475 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 193 Invalid, 1551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1513 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-04-15 12:17:45,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-15 12:17:45,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-04-15 12:17:45,477 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:45,477 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 48 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:45,477 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 48 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:45,477 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 48 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:45,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:45,478 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2022-04-15 12:17:45,478 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2022-04-15 12:17:45,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:45,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:45,479 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 48 states. [2022-04-15 12:17:45,479 INFO L87 Difference]: Start difference. First operand has 48 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 48 states. [2022-04-15 12:17:45,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:45,479 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2022-04-15 12:17:45,479 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2022-04-15 12:17:45,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:45,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:45,480 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:45,480 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:45,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:45,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2022-04-15 12:17:45,480 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2022-04-15 12:17:45,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:45,481 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2022-04-15 12:17:45,481 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 38 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:45,481 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 48 transitions. [2022-04-15 12:17:45,654 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:45,654 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2022-04-15 12:17:45,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-15 12:17:45,654 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:45,654 INFO L499 BasicCegarLoop]: trace histogram [36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:45,654 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-04-15 12:17:45,655 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:45,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:45,655 INFO L85 PathProgramCache]: Analyzing trace with hash 913888860, now seen corresponding path program 36 times [2022-04-15 12:17:45,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:45,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2097906314] [2022-04-15 12:17:45,713 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:17:45,714 INFO L85 PathProgramCache]: Analyzing trace with hash 201379255, now seen corresponding path program 1 times [2022-04-15 12:17:45,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:45,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454968875] [2022-04-15 12:17:45,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:45,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:45,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:45,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:45,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:45,759 INFO L290 TraceCheckUtils]: 0: Hoare triple {9375#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {9369#true} is VALID [2022-04-15 12:17:45,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {9369#true} assume true; {9369#true} is VALID [2022-04-15 12:17:45,759 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9369#true} {9369#true} #34#return; {9369#true} is VALID [2022-04-15 12:17:45,760 INFO L272 TraceCheckUtils]: 0: Hoare triple {9369#true} call ULTIMATE.init(); {9375#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:17:45,760 INFO L290 TraceCheckUtils]: 1: Hoare triple {9375#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {9369#true} is VALID [2022-04-15 12:17:45,760 INFO L290 TraceCheckUtils]: 2: Hoare triple {9369#true} assume true; {9369#true} is VALID [2022-04-15 12:17:45,760 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9369#true} {9369#true} #34#return; {9369#true} is VALID [2022-04-15 12:17:45,760 INFO L272 TraceCheckUtils]: 4: Hoare triple {9369#true} call #t~ret5 := main(); {9369#true} is VALID [2022-04-15 12:17:45,760 INFO L290 TraceCheckUtils]: 5: Hoare triple {9369#true} ~x~0 := 1;~y~0 := 0; {9374#(= main_~y~0 0)} is VALID [2022-04-15 12:17:45,761 INFO L290 TraceCheckUtils]: 6: Hoare triple {9374#(= main_~y~0 0)} [110] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_Out_72 v_main_~y~0_In_36) (= v_main_~y~0_Out_72 0) (< (mod (+ 4294967295 v_main_~y~0_Out_72) 4294967296) 1024) (= v_main_~x~0_Out_72 0) (= |v_main_#t~post4_Out_72| 1)) (= v_main_~y~0_In_36 v_main_~y~0_Out_72)) InVars {main_~y~0=v_main_~y~0_In_36} OutVars{main_#t~post4=|v_main_#t~post4_Out_72|, main_~y~0=v_main_~y~0_Out_72, main_~x~0=v_main_~x~0_Out_72} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {9374#(= main_~y~0 0)} is VALID [2022-04-15 12:17:45,761 INFO L290 TraceCheckUtils]: 7: Hoare triple {9374#(= main_~y~0 0)} [109] L16-3_primed-->L16-3: Formula: (not (< (mod v_main_~y~0_4 4294967296) 1024)) InVars {main_~y~0=v_main_~y~0_4} OutVars{main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[] {9370#false} is VALID [2022-04-15 12:17:45,761 INFO L272 TraceCheckUtils]: 8: Hoare triple {9370#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {9370#false} is VALID [2022-04-15 12:17:45,762 INFO L290 TraceCheckUtils]: 9: Hoare triple {9370#false} ~cond := #in~cond; {9370#false} is VALID [2022-04-15 12:17:45,762 INFO L290 TraceCheckUtils]: 10: Hoare triple {9370#false} assume 0 == ~cond; {9370#false} is VALID [2022-04-15 12:17:45,762 INFO L290 TraceCheckUtils]: 11: Hoare triple {9370#false} assume !false; {9370#false} is VALID [2022-04-15 12:17:45,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:17:45,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:45,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454968875] [2022-04-15 12:17:45,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454968875] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:45,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:45,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:17:46,584 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:46,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2097906314] [2022-04-15 12:17:46,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2097906314] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:46,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:46,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2022-04-15 12:17:46,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086102908] [2022-04-15 12:17:46,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:46,585 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.075) internal successors, (43), 39 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2022-04-15 12:17:46,585 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:46,585 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 40 states, 40 states have (on average 1.075) internal successors, (43), 39 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:46,663 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:46,663 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-04-15 12:17:46,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:46,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-04-15 12:17:46,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2022-04-15 12:17:46,664 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand has 40 states, 40 states have (on average 1.075) internal successors, (43), 39 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:55,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:55,717 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2022-04-15 12:17:55,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-15 12:17:55,717 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.075) internal successors, (43), 39 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2022-04-15 12:17:55,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:55,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.075) internal successors, (43), 39 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:55,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 54 transitions. [2022-04-15 12:17:55,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.075) internal successors, (43), 39 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:55,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 54 transitions. [2022-04-15 12:17:55,719 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 54 transitions. [2022-04-15 12:17:55,816 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 12:17:55,817 INFO L225 Difference]: With dead ends: 54 [2022-04-15 12:17:55,817 INFO L226 Difference]: Without dead ends: 49 [2022-04-15 12:17:55,817 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=225, Invalid=5627, Unknown=0, NotChecked=0, Total=5852 [2022-04-15 12:17:55,818 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 1592 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 1631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:17:55,818 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 198 Invalid, 1631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1592 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-04-15 12:17:55,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-15 12:17:55,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-04-15 12:17:55,819 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:55,820 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:55,820 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:55,820 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:55,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:55,820 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2022-04-15 12:17:55,820 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2022-04-15 12:17:55,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:55,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:55,821 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 49 states. [2022-04-15 12:17:55,821 INFO L87 Difference]: Start difference. First operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 49 states. [2022-04-15 12:17:55,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:55,821 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2022-04-15 12:17:55,821 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2022-04-15 12:17:55,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:55,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:55,822 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:55,822 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:55,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:55,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2022-04-15 12:17:55,822 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2022-04-15 12:17:55,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:55,822 INFO L478 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2022-04-15 12:17:55,822 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 1.075) internal successors, (43), 39 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:55,823 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 49 transitions. [2022-04-15 12:17:55,955 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:55,955 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2022-04-15 12:17:55,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-15 12:17:55,955 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:55,955 INFO L499 BasicCegarLoop]: trace histogram [37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:55,955 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-04-15 12:17:55,955 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:55,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:55,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1697755146, now seen corresponding path program 37 times [2022-04-15 12:17:55,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:55,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1556671923] [2022-04-15 12:17:56,013 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:17:56,014 INFO L85 PathProgramCache]: Analyzing trace with hash 260484599, now seen corresponding path program 1 times [2022-04-15 12:17:56,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:56,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386716773] [2022-04-15 12:17:56,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:56,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:56,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:56,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:56,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:56,051 INFO L290 TraceCheckUtils]: 0: Hoare triple {9798#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {9792#true} is VALID [2022-04-15 12:17:56,051 INFO L290 TraceCheckUtils]: 1: Hoare triple {9792#true} assume true; {9792#true} is VALID [2022-04-15 12:17:56,051 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9792#true} {9792#true} #34#return; {9792#true} is VALID [2022-04-15 12:17:56,052 INFO L272 TraceCheckUtils]: 0: Hoare triple {9792#true} call ULTIMATE.init(); {9798#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:17:56,052 INFO L290 TraceCheckUtils]: 1: Hoare triple {9798#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {9792#true} is VALID [2022-04-15 12:17:56,052 INFO L290 TraceCheckUtils]: 2: Hoare triple {9792#true} assume true; {9792#true} is VALID [2022-04-15 12:17:56,052 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9792#true} {9792#true} #34#return; {9792#true} is VALID [2022-04-15 12:17:56,052 INFO L272 TraceCheckUtils]: 4: Hoare triple {9792#true} call #t~ret5 := main(); {9792#true} is VALID [2022-04-15 12:17:56,052 INFO L290 TraceCheckUtils]: 5: Hoare triple {9792#true} ~x~0 := 1;~y~0 := 0; {9797#(= main_~y~0 0)} is VALID [2022-04-15 12:17:56,053 INFO L290 TraceCheckUtils]: 6: Hoare triple {9797#(= main_~y~0 0)} [112] L16-2-->L16-3_primed: Formula: (or (= v_main_~y~0_In_37 v_main_~y~0_Out_74) (and (= v_main_~x~0_Out_74 0) (= v_main_~y~0_Out_74 0) (< (mod (+ 4294967295 v_main_~y~0_Out_74) 4294967296) 1024) (= |v_main_#t~post4_Out_74| 1) (= v_main_~y~0_Out_74 v_main_~y~0_In_37))) InVars {main_~y~0=v_main_~y~0_In_37} OutVars{main_#t~post4=|v_main_#t~post4_Out_74|, main_~y~0=v_main_~y~0_Out_74, main_~x~0=v_main_~x~0_Out_74} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {9797#(= main_~y~0 0)} is VALID [2022-04-15 12:17:56,053 INFO L290 TraceCheckUtils]: 7: Hoare triple {9797#(= main_~y~0 0)} [111] L16-3_primed-->L16-3: Formula: (not (< (mod v_main_~y~0_4 4294967296) 1024)) InVars {main_~y~0=v_main_~y~0_4} OutVars{main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[] {9793#false} is VALID [2022-04-15 12:17:56,053 INFO L272 TraceCheckUtils]: 8: Hoare triple {9793#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {9793#false} is VALID [2022-04-15 12:17:56,053 INFO L290 TraceCheckUtils]: 9: Hoare triple {9793#false} ~cond := #in~cond; {9793#false} is VALID [2022-04-15 12:17:56,053 INFO L290 TraceCheckUtils]: 10: Hoare triple {9793#false} assume 0 == ~cond; {9793#false} is VALID [2022-04-15 12:17:56,053 INFO L290 TraceCheckUtils]: 11: Hoare triple {9793#false} assume !false; {9793#false} is VALID [2022-04-15 12:17:56,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:17:56,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:56,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386716773] [2022-04-15 12:17:56,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386716773] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:56,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:56,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:17:56,825 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:56,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1556671923] [2022-04-15 12:17:56,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1556671923] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:56,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:56,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2022-04-15 12:17:56,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938761985] [2022-04-15 12:17:56,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:56,826 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 40 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2022-04-15 12:17:56,826 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:56,826 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 41 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 40 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:56,880 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:56,881 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-04-15 12:17:56,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:56,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-04-15 12:17:56,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2022-04-15 12:17:56,881 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand has 41 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 40 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:06,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:06,504 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2022-04-15 12:18:06,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-04-15 12:18:06,504 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 40 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2022-04-15 12:18:06,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:18:06,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 40 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:06,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 55 transitions. [2022-04-15 12:18:06,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 40 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:06,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 55 transitions. [2022-04-15 12:18:06,505 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 55 transitions. [2022-04-15 12:18:06,609 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:06,610 INFO L225 Difference]: With dead ends: 55 [2022-04-15 12:18:06,610 INFO L226 Difference]: Without dead ends: 50 [2022-04-15 12:18:06,611 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=231, Invalid=5931, Unknown=0, NotChecked=0, Total=6162 [2022-04-15 12:18:06,611 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 1673 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 1713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-04-15 12:18:06,611 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 203 Invalid, 1713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1673 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2022-04-15 12:18:06,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-15 12:18:06,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-04-15 12:18:06,613 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:18:06,613 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 50 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 45 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:06,613 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 50 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 45 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:06,613 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 50 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 45 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:06,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:06,614 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2022-04-15 12:18:06,614 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2022-04-15 12:18:06,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:06,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:06,614 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 45 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 50 states. [2022-04-15 12:18:06,615 INFO L87 Difference]: Start difference. First operand has 50 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 45 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 50 states. [2022-04-15 12:18:06,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:06,615 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2022-04-15 12:18:06,615 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2022-04-15 12:18:06,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:06,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:06,616 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:18:06,616 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:18:06,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 45 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:06,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2022-04-15 12:18:06,616 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2022-04-15 12:18:06,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:18:06,616 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2022-04-15 12:18:06,617 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 40 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:06,617 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 50 transitions. [2022-04-15 12:18:06,776 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:06,776 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2022-04-15 12:18:06,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-15 12:18:06,776 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:18:06,776 INFO L499 BasicCegarLoop]: trace histogram [38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:18:06,776 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-04-15 12:18:06,776 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:18:06,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:18:06,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1054340708, now seen corresponding path program 38 times [2022-04-15 12:18:06,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:06,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [929381631] [2022-04-15 12:18:06,835 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:18:06,836 INFO L85 PathProgramCache]: Analyzing trace with hash 319589943, now seen corresponding path program 1 times [2022-04-15 12:18:06,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:06,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398482635] [2022-04-15 12:18:06,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:06,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:06,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:06,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:18:06,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:06,874 INFO L290 TraceCheckUtils]: 0: Hoare triple {10230#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {10224#true} is VALID [2022-04-15 12:18:06,874 INFO L290 TraceCheckUtils]: 1: Hoare triple {10224#true} assume true; {10224#true} is VALID [2022-04-15 12:18:06,874 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10224#true} {10224#true} #34#return; {10224#true} is VALID [2022-04-15 12:18:06,875 INFO L272 TraceCheckUtils]: 0: Hoare triple {10224#true} call ULTIMATE.init(); {10230#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:18:06,875 INFO L290 TraceCheckUtils]: 1: Hoare triple {10230#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {10224#true} is VALID [2022-04-15 12:18:06,875 INFO L290 TraceCheckUtils]: 2: Hoare triple {10224#true} assume true; {10224#true} is VALID [2022-04-15 12:18:06,875 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10224#true} {10224#true} #34#return; {10224#true} is VALID [2022-04-15 12:18:06,875 INFO L272 TraceCheckUtils]: 4: Hoare triple {10224#true} call #t~ret5 := main(); {10224#true} is VALID [2022-04-15 12:18:06,876 INFO L290 TraceCheckUtils]: 5: Hoare triple {10224#true} ~x~0 := 1;~y~0 := 0; {10229#(= main_~y~0 0)} is VALID [2022-04-15 12:18:06,876 INFO L290 TraceCheckUtils]: 6: Hoare triple {10229#(= main_~y~0 0)} [114] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_Out_76 v_main_~y~0_In_38) (= |v_main_#t~post4_Out_76| 1) (= v_main_~y~0_Out_76 0) (< (mod (+ 4294967295 v_main_~y~0_Out_76) 4294967296) 1024) (= v_main_~x~0_Out_76 0)) (= v_main_~y~0_In_38 v_main_~y~0_Out_76)) InVars {main_~y~0=v_main_~y~0_In_38} OutVars{main_#t~post4=|v_main_#t~post4_Out_76|, main_~y~0=v_main_~y~0_Out_76, main_~x~0=v_main_~x~0_Out_76} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {10229#(= main_~y~0 0)} is VALID [2022-04-15 12:18:06,877 INFO L290 TraceCheckUtils]: 7: Hoare triple {10229#(= main_~y~0 0)} [113] L16-3_primed-->L16-3: Formula: (not (< (mod v_main_~y~0_4 4294967296) 1024)) InVars {main_~y~0=v_main_~y~0_4} OutVars{main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[] {10225#false} is VALID [2022-04-15 12:18:06,877 INFO L272 TraceCheckUtils]: 8: Hoare triple {10225#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {10225#false} is VALID [2022-04-15 12:18:06,877 INFO L290 TraceCheckUtils]: 9: Hoare triple {10225#false} ~cond := #in~cond; {10225#false} is VALID [2022-04-15 12:18:06,877 INFO L290 TraceCheckUtils]: 10: Hoare triple {10225#false} assume 0 == ~cond; {10225#false} is VALID [2022-04-15 12:18:06,877 INFO L290 TraceCheckUtils]: 11: Hoare triple {10225#false} assume !false; {10225#false} is VALID [2022-04-15 12:18:06,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:06,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:18:06,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398482635] [2022-04-15 12:18:06,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398482635] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:06,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:06,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:18:07,666 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:18:07,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [929381631] [2022-04-15 12:18:07,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [929381631] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:07,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:07,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2022-04-15 12:18:07,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740757714] [2022-04-15 12:18:07,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:18:07,667 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 41 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-04-15 12:18:07,667 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:18:07,667 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 42 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 41 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:07,752 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:07,753 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-04-15 12:18:07,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:07,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-04-15 12:18:07,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2022-04-15 12:18:07,754 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand has 42 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 41 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:19,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:19,038 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2022-04-15 12:18:19,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-04-15 12:18:19,038 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 41 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-04-15 12:18:19,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:18:19,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 41 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:19,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 56 transitions. [2022-04-15 12:18:19,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 41 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:19,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 56 transitions. [2022-04-15 12:18:19,040 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 56 transitions. [2022-04-15 12:18:19,114 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:19,115 INFO L225 Difference]: With dead ends: 56 [2022-04-15 12:18:19,115 INFO L226 Difference]: Without dead ends: 51 [2022-04-15 12:18:19,115 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=237, Invalid=6243, Unknown=0, NotChecked=0, Total=6480 [2022-04-15 12:18:19,116 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 1756 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 1797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-04-15 12:18:19,116 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 208 Invalid, 1797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1756 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2022-04-15 12:18:19,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-15 12:18:19,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-04-15 12:18:19,117 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:18:19,117 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:19,118 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:19,118 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:19,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:19,118 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2022-04-15 12:18:19,118 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2022-04-15 12:18:19,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:19,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:19,119 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 51 states. [2022-04-15 12:18:19,119 INFO L87 Difference]: Start difference. First operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 51 states. [2022-04-15 12:18:19,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:19,119 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2022-04-15 12:18:19,119 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2022-04-15 12:18:19,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:19,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:19,119 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:18:19,119 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:18:19,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:19,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2022-04-15 12:18:19,120 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2022-04-15 12:18:19,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:18:19,120 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2022-04-15 12:18:19,120 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 41 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:19,120 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 51 transitions. [2022-04-15 12:18:19,246 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 12:18:19,246 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2022-04-15 12:18:19,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-15 12:18:19,247 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:18:19,247 INFO L499 BasicCegarLoop]: trace histogram [39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:18:19,247 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-04-15 12:18:19,247 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:18:19,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:18:19,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1711637686, now seen corresponding path program 39 times [2022-04-15 12:18:19,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:19,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1676290654] [2022-04-15 12:18:19,299 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:18:19,300 INFO L85 PathProgramCache]: Analyzing trace with hash 378695287, now seen corresponding path program 1 times [2022-04-15 12:18:19,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:19,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770815174] [2022-04-15 12:18:19,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:19,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:19,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:19,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:18:19,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:19,326 INFO L290 TraceCheckUtils]: 0: Hoare triple {10671#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {10665#true} is VALID [2022-04-15 12:18:19,326 INFO L290 TraceCheckUtils]: 1: Hoare triple {10665#true} assume true; {10665#true} is VALID [2022-04-15 12:18:19,326 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10665#true} {10665#true} #34#return; {10665#true} is VALID [2022-04-15 12:18:19,326 INFO L272 TraceCheckUtils]: 0: Hoare triple {10665#true} call ULTIMATE.init(); {10671#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:18:19,326 INFO L290 TraceCheckUtils]: 1: Hoare triple {10671#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {10665#true} is VALID [2022-04-15 12:18:19,327 INFO L290 TraceCheckUtils]: 2: Hoare triple {10665#true} assume true; {10665#true} is VALID [2022-04-15 12:18:19,327 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10665#true} {10665#true} #34#return; {10665#true} is VALID [2022-04-15 12:18:19,327 INFO L272 TraceCheckUtils]: 4: Hoare triple {10665#true} call #t~ret5 := main(); {10665#true} is VALID [2022-04-15 12:18:19,327 INFO L290 TraceCheckUtils]: 5: Hoare triple {10665#true} ~x~0 := 1;~y~0 := 0; {10670#(= main_~y~0 0)} is VALID [2022-04-15 12:18:19,328 INFO L290 TraceCheckUtils]: 6: Hoare triple {10670#(= main_~y~0 0)} [116] L16-2-->L16-3_primed: Formula: (or (= v_main_~y~0_In_39 v_main_~y~0_Out_78) (and (< (mod (+ 4294967295 v_main_~y~0_Out_78) 4294967296) 1024) (= v_main_~y~0_Out_78 v_main_~y~0_In_39) (= |v_main_#t~post4_Out_78| 1) (= v_main_~x~0_Out_78 0) (= v_main_~y~0_Out_78 0))) InVars {main_~y~0=v_main_~y~0_In_39} OutVars{main_#t~post4=|v_main_#t~post4_Out_78|, main_~y~0=v_main_~y~0_Out_78, main_~x~0=v_main_~x~0_Out_78} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {10670#(= main_~y~0 0)} is VALID [2022-04-15 12:18:19,328 INFO L290 TraceCheckUtils]: 7: Hoare triple {10670#(= main_~y~0 0)} [115] L16-3_primed-->L16-3: Formula: (not (< (mod v_main_~y~0_4 4294967296) 1024)) InVars {main_~y~0=v_main_~y~0_4} OutVars{main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[] {10666#false} is VALID [2022-04-15 12:18:19,328 INFO L272 TraceCheckUtils]: 8: Hoare triple {10666#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {10666#false} is VALID [2022-04-15 12:18:19,328 INFO L290 TraceCheckUtils]: 9: Hoare triple {10666#false} ~cond := #in~cond; {10666#false} is VALID [2022-04-15 12:18:19,328 INFO L290 TraceCheckUtils]: 10: Hoare triple {10666#false} assume 0 == ~cond; {10666#false} is VALID [2022-04-15 12:18:19,328 INFO L290 TraceCheckUtils]: 11: Hoare triple {10666#false} assume !false; {10666#false} is VALID [2022-04-15 12:18:19,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:19,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:18:19,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770815174] [2022-04-15 12:18:19,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770815174] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:19,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:19,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:18:20,129 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:18:20,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1676290654] [2022-04-15 12:18:20,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1676290654] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:20,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:20,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [] total 43 [2022-04-15 12:18:20,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109535197] [2022-04-15 12:18:20,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:18:20,130 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.069767441860465) internal successors, (46), 42 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2022-04-15 12:18:20,130 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:18:20,130 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 43 states, 43 states have (on average 1.069767441860465) internal successors, (46), 42 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:20,181 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:20,181 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-04-15 12:18:20,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:20,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-04-15 12:18:20,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2022-04-15 12:18:20,182 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand has 43 states, 43 states have (on average 1.069767441860465) internal successors, (46), 42 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:36,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:36,013 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2022-04-15 12:18:36,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-04-15 12:18:36,013 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.069767441860465) internal successors, (46), 42 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2022-04-15 12:18:36,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:18:36,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.069767441860465) internal successors, (46), 42 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:36,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 57 transitions. [2022-04-15 12:18:36,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.069767441860465) internal successors, (46), 42 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:36,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 57 transitions. [2022-04-15 12:18:36,015 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 57 transitions. [2022-04-15 12:18:36,103 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:36,104 INFO L225 Difference]: With dead ends: 57 [2022-04-15 12:18:36,104 INFO L226 Difference]: Without dead ends: 52 [2022-04-15 12:18:36,105 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=243, Invalid=6563, Unknown=0, NotChecked=0, Total=6806 [2022-04-15 12:18:36,105 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 1841 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 1883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2022-04-15 12:18:36,106 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 213 Invalid, 1883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1841 Invalid, 0 Unknown, 0 Unchecked, 8.9s Time] [2022-04-15 12:18:36,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-15 12:18:36,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-04-15 12:18:36,108 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:18:36,108 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 52 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:36,108 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 52 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:36,108 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 52 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:36,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:36,109 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2022-04-15 12:18:36,109 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2022-04-15 12:18:36,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:36,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:36,110 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 52 states. [2022-04-15 12:18:36,110 INFO L87 Difference]: Start difference. First operand has 52 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 52 states. [2022-04-15 12:18:36,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:36,110 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2022-04-15 12:18:36,111 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2022-04-15 12:18:36,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:36,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:36,111 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:18:36,111 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:18:36,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:36,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2022-04-15 12:18:36,112 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2022-04-15 12:18:36,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:18:36,112 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2022-04-15 12:18:36,112 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 1.069767441860465) internal successors, (46), 42 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:36,112 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 52 transitions. [2022-04-15 12:18:36,306 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:36,306 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2022-04-15 12:18:36,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-15 12:18:36,306 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:18:36,306 INFO L499 BasicCegarLoop]: trace histogram [40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:18:36,306 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-04-15 12:18:36,307 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:18:36,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:18:36,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1557621980, now seen corresponding path program 40 times [2022-04-15 12:18:36,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:36,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2022229680] [2022-04-15 12:18:36,388 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:18:36,389 INFO L85 PathProgramCache]: Analyzing trace with hash 437800631, now seen corresponding path program 1 times [2022-04-15 12:18:36,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:36,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970247825] [2022-04-15 12:18:36,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:36,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:36,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:36,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:18:36,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:36,426 INFO L290 TraceCheckUtils]: 0: Hoare triple {11121#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {11115#true} is VALID [2022-04-15 12:18:36,427 INFO L290 TraceCheckUtils]: 1: Hoare triple {11115#true} assume true; {11115#true} is VALID [2022-04-15 12:18:36,427 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11115#true} {11115#true} #34#return; {11115#true} is VALID [2022-04-15 12:18:36,427 INFO L272 TraceCheckUtils]: 0: Hoare triple {11115#true} call ULTIMATE.init(); {11121#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:18:36,427 INFO L290 TraceCheckUtils]: 1: Hoare triple {11121#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {11115#true} is VALID [2022-04-15 12:18:36,427 INFO L290 TraceCheckUtils]: 2: Hoare triple {11115#true} assume true; {11115#true} is VALID [2022-04-15 12:18:36,427 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11115#true} {11115#true} #34#return; {11115#true} is VALID [2022-04-15 12:18:36,428 INFO L272 TraceCheckUtils]: 4: Hoare triple {11115#true} call #t~ret5 := main(); {11115#true} is VALID [2022-04-15 12:18:36,428 INFO L290 TraceCheckUtils]: 5: Hoare triple {11115#true} ~x~0 := 1;~y~0 := 0; {11120#(= main_~y~0 0)} is VALID [2022-04-15 12:18:36,428 INFO L290 TraceCheckUtils]: 6: Hoare triple {11120#(= main_~y~0 0)} [118] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_Out_80 0) (= v_main_~y~0_Out_80 0) (= |v_main_#t~post4_Out_80| 1) (= v_main_~y~0_Out_80 v_main_~y~0_In_40) (< (mod (+ 4294967295 v_main_~y~0_Out_80) 4294967296) 1024)) (= v_main_~y~0_In_40 v_main_~y~0_Out_80)) InVars {main_~y~0=v_main_~y~0_In_40} OutVars{main_#t~post4=|v_main_#t~post4_Out_80|, main_~y~0=v_main_~y~0_Out_80, main_~x~0=v_main_~x~0_Out_80} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {11120#(= main_~y~0 0)} is VALID [2022-04-15 12:18:36,429 INFO L290 TraceCheckUtils]: 7: Hoare triple {11120#(= main_~y~0 0)} [117] L16-3_primed-->L16-3: Formula: (not (< (mod v_main_~y~0_4 4294967296) 1024)) InVars {main_~y~0=v_main_~y~0_4} OutVars{main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[] {11116#false} is VALID [2022-04-15 12:18:36,429 INFO L272 TraceCheckUtils]: 8: Hoare triple {11116#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {11116#false} is VALID [2022-04-15 12:18:36,429 INFO L290 TraceCheckUtils]: 9: Hoare triple {11116#false} ~cond := #in~cond; {11116#false} is VALID [2022-04-15 12:18:36,429 INFO L290 TraceCheckUtils]: 10: Hoare triple {11116#false} assume 0 == ~cond; {11116#false} is VALID [2022-04-15 12:18:36,429 INFO L290 TraceCheckUtils]: 11: Hoare triple {11116#false} assume !false; {11116#false} is VALID [2022-04-15 12:18:36,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:36,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:18:36,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970247825] [2022-04-15 12:18:36,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970247825] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:36,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:36,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:18:37,288 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:18:37,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2022229680] [2022-04-15 12:18:37,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2022229680] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:37,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:37,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2022-04-15 12:18:37,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826427182] [2022-04-15 12:18:37,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:18:37,289 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 43 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2022-04-15 12:18:37,289 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:18:37,289 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 44 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 43 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:37,344 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 12:18:37,345 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-04-15 12:18:37,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:37,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-04-15 12:18:37,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2022-04-15 12:18:37,345 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand has 44 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 43 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:53,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:53,356 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2022-04-15 12:18:53,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-04-15 12:18:53,356 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 43 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2022-04-15 12:18:53,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:18:53,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 43 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:53,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 58 transitions. [2022-04-15 12:18:53,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 43 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:53,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 58 transitions. [2022-04-15 12:18:53,358 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 58 transitions. [2022-04-15 12:18:53,468 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:53,468 INFO L225 Difference]: With dead ends: 58 [2022-04-15 12:18:53,468 INFO L226 Difference]: Without dead ends: 53 [2022-04-15 12:18:53,469 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=249, Invalid=6891, Unknown=0, NotChecked=0, Total=7140 [2022-04-15 12:18:53,470 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 1928 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 1971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:18:53,470 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 218 Invalid, 1971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1928 Invalid, 0 Unknown, 0 Unchecked, 9.0s Time] [2022-04-15 12:18:53,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-15 12:18:53,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-04-15 12:18:53,472 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:18:53,472 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 53 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:53,472 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 53 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:53,473 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 53 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:53,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:53,473 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2022-04-15 12:18:53,473 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2022-04-15 12:18:53,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:53,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:53,474 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 53 states. [2022-04-15 12:18:53,474 INFO L87 Difference]: Start difference. First operand has 53 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 53 states. [2022-04-15 12:18:53,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:53,474 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2022-04-15 12:18:53,475 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2022-04-15 12:18:53,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:53,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:53,475 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:18:53,475 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:18:53,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:53,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2022-04-15 12:18:53,476 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2022-04-15 12:18:53,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:18:53,476 INFO L478 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2022-04-15 12:18:53,476 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 43 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:53,476 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 53 transitions. [2022-04-15 12:18:53,642 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 12:18:53,642 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2022-04-15 12:18:53,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-15 12:18:53,642 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:18:53,643 INFO L499 BasicCegarLoop]: trace histogram [41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:18:53,643 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-04-15 12:18:53,643 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:18:53,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:18:53,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1078102390, now seen corresponding path program 41 times [2022-04-15 12:18:53,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:53,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [59093492] [2022-04-15 12:18:53,698 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:18:53,699 INFO L85 PathProgramCache]: Analyzing trace with hash 496905975, now seen corresponding path program 1 times [2022-04-15 12:18:53,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:53,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351772943] [2022-04-15 12:18:53,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:53,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:53,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:53,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:18:53,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:53,719 INFO L290 TraceCheckUtils]: 0: Hoare triple {11580#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {11574#true} is VALID [2022-04-15 12:18:53,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {11574#true} assume true; {11574#true} is VALID [2022-04-15 12:18:53,719 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11574#true} {11574#true} #34#return; {11574#true} is VALID [2022-04-15 12:18:53,719 INFO L272 TraceCheckUtils]: 0: Hoare triple {11574#true} call ULTIMATE.init(); {11580#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:18:53,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {11580#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {11574#true} is VALID [2022-04-15 12:18:53,719 INFO L290 TraceCheckUtils]: 2: Hoare triple {11574#true} assume true; {11574#true} is VALID [2022-04-15 12:18:53,720 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11574#true} {11574#true} #34#return; {11574#true} is VALID [2022-04-15 12:18:53,720 INFO L272 TraceCheckUtils]: 4: Hoare triple {11574#true} call #t~ret5 := main(); {11574#true} is VALID [2022-04-15 12:18:53,720 INFO L290 TraceCheckUtils]: 5: Hoare triple {11574#true} ~x~0 := 1;~y~0 := 0; {11579#(= main_~y~0 0)} is VALID [2022-04-15 12:18:53,720 INFO L290 TraceCheckUtils]: 6: Hoare triple {11579#(= main_~y~0 0)} [120] L16-2-->L16-3_primed: Formula: (or (= v_main_~y~0_In_41 v_main_~y~0_Out_82) (and (< (mod (+ 4294967295 v_main_~y~0_Out_82) 4294967296) 1024) (= v_main_~y~0_Out_82 v_main_~y~0_In_41) (= |v_main_#t~post4_Out_82| 1) (= v_main_~y~0_Out_82 0) (= v_main_~x~0_Out_82 0))) InVars {main_~y~0=v_main_~y~0_In_41} OutVars{main_#t~post4=|v_main_#t~post4_Out_82|, main_~y~0=v_main_~y~0_Out_82, main_~x~0=v_main_~x~0_Out_82} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {11579#(= main_~y~0 0)} is VALID [2022-04-15 12:18:53,721 INFO L290 TraceCheckUtils]: 7: Hoare triple {11579#(= main_~y~0 0)} [119] L16-3_primed-->L16-3: Formula: (not (< (mod v_main_~y~0_4 4294967296) 1024)) InVars {main_~y~0=v_main_~y~0_4} OutVars{main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[] {11575#false} is VALID [2022-04-15 12:18:53,721 INFO L272 TraceCheckUtils]: 8: Hoare triple {11575#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {11575#false} is VALID [2022-04-15 12:18:53,721 INFO L290 TraceCheckUtils]: 9: Hoare triple {11575#false} ~cond := #in~cond; {11575#false} is VALID [2022-04-15 12:18:53,721 INFO L290 TraceCheckUtils]: 10: Hoare triple {11575#false} assume 0 == ~cond; {11575#false} is VALID [2022-04-15 12:18:53,721 INFO L290 TraceCheckUtils]: 11: Hoare triple {11575#false} assume !false; {11575#false} is VALID [2022-04-15 12:18:53,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:18:53,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:18:53,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351772943] [2022-04-15 12:18:53,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351772943] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:53,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:53,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:18:54,611 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:18:54,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [59093492] [2022-04-15 12:18:54,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [59093492] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:54,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:54,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [45] imperfect sequences [] total 45 [2022-04-15 12:18:54,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293646725] [2022-04-15 12:18:54,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:18:54,612 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 44 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2022-04-15 12:18:54,612 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:18:54,612 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 45 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 44 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:54,701 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:54,701 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-04-15 12:18:54,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:54,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-04-15 12:18:54,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2022-04-15 12:18:54,702 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand has 45 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 44 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:17,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:17,142 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2022-04-15 12:19:17,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-04-15 12:19:17,142 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 44 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2022-04-15 12:19:17,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:19:17,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 44 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:17,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 59 transitions. [2022-04-15 12:19:17,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 44 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:17,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 59 transitions. [2022-04-15 12:19:17,144 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 59 transitions. [2022-04-15 12:19:17,269 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:19:17,270 INFO L225 Difference]: With dead ends: 59 [2022-04-15 12:19:17,270 INFO L226 Difference]: Without dead ends: 54 [2022-04-15 12:19:17,271 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 861 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=255, Invalid=7227, Unknown=0, NotChecked=0, Total=7482 [2022-04-15 12:19:17,271 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 2017 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 2061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 2017 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.5s IncrementalHoareTripleChecker+Time [2022-04-15 12:19:17,271 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 223 Invalid, 2061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 2017 Invalid, 0 Unknown, 0 Unchecked, 12.5s Time] [2022-04-15 12:19:17,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-15 12:19:17,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-04-15 12:19:17,274 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:19:17,274 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 54 states, 49 states have (on average 1.0204081632653061) internal successors, (50), 49 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:17,274 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 54 states, 49 states have (on average 1.0204081632653061) internal successors, (50), 49 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:17,274 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 54 states, 49 states have (on average 1.0204081632653061) internal successors, (50), 49 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:17,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:17,275 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2022-04-15 12:19:17,275 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2022-04-15 12:19:17,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:19:17,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:19:17,275 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 49 states have (on average 1.0204081632653061) internal successors, (50), 49 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 54 states. [2022-04-15 12:19:17,275 INFO L87 Difference]: Start difference. First operand has 54 states, 49 states have (on average 1.0204081632653061) internal successors, (50), 49 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 54 states. [2022-04-15 12:19:17,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:17,276 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2022-04-15 12:19:17,276 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2022-04-15 12:19:17,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:19:17,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:19:17,276 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:19:17,276 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:19:17,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.0204081632653061) internal successors, (50), 49 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:17,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2022-04-15 12:19:17,277 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2022-04-15 12:19:17,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:19:17,277 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2022-04-15 12:19:17,277 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 44 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:17,277 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 54 transitions. [2022-04-15 12:19:17,420 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 12:19:17,420 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2022-04-15 12:19:17,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-15 12:19:17,421 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:19:17,421 INFO L499 BasicCegarLoop]: trace histogram [42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:19:17,421 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-04-15 12:19:17,421 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:19:17,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:19:17,421 INFO L85 PathProgramCache]: Analyzing trace with hash -902103012, now seen corresponding path program 42 times [2022-04-15 12:19:17,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:19:17,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [407860767] [2022-04-15 12:19:17,472 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:19:17,473 INFO L85 PathProgramCache]: Analyzing trace with hash 556011319, now seen corresponding path program 1 times [2022-04-15 12:19:17,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:19:17,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053891939] [2022-04-15 12:19:17,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:19:17,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:19:17,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:17,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:19:17,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:17,506 INFO L290 TraceCheckUtils]: 0: Hoare triple {12048#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {12042#true} is VALID [2022-04-15 12:19:17,506 INFO L290 TraceCheckUtils]: 1: Hoare triple {12042#true} assume true; {12042#true} is VALID [2022-04-15 12:19:17,506 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12042#true} {12042#true} #34#return; {12042#true} is VALID [2022-04-15 12:19:17,506 INFO L272 TraceCheckUtils]: 0: Hoare triple {12042#true} call ULTIMATE.init(); {12048#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:19:17,507 INFO L290 TraceCheckUtils]: 1: Hoare triple {12048#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {12042#true} is VALID [2022-04-15 12:19:17,507 INFO L290 TraceCheckUtils]: 2: Hoare triple {12042#true} assume true; {12042#true} is VALID [2022-04-15 12:19:17,507 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12042#true} {12042#true} #34#return; {12042#true} is VALID [2022-04-15 12:19:17,507 INFO L272 TraceCheckUtils]: 4: Hoare triple {12042#true} call #t~ret5 := main(); {12042#true} is VALID [2022-04-15 12:19:17,508 INFO L290 TraceCheckUtils]: 5: Hoare triple {12042#true} ~x~0 := 1;~y~0 := 0; {12047#(= main_~y~0 0)} is VALID [2022-04-15 12:19:17,508 INFO L290 TraceCheckUtils]: 6: Hoare triple {12047#(= main_~y~0 0)} [122] L16-2-->L16-3_primed: Formula: (or (and (= |v_main_#t~post4_Out_84| 1) (= v_main_~y~0_Out_84 0) (= v_main_~x~0_Out_84 0) (< (mod (+ 4294967295 v_main_~y~0_Out_84) 4294967296) 1024) (= v_main_~y~0_Out_84 v_main_~y~0_In_42)) (= v_main_~y~0_In_42 v_main_~y~0_Out_84)) InVars {main_~y~0=v_main_~y~0_In_42} OutVars{main_#t~post4=|v_main_#t~post4_Out_84|, main_~y~0=v_main_~y~0_Out_84, main_~x~0=v_main_~x~0_Out_84} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {12047#(= main_~y~0 0)} is VALID [2022-04-15 12:19:17,509 INFO L290 TraceCheckUtils]: 7: Hoare triple {12047#(= main_~y~0 0)} [121] L16-3_primed-->L16-3: Formula: (not (< (mod v_main_~y~0_4 4294967296) 1024)) InVars {main_~y~0=v_main_~y~0_4} OutVars{main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[] {12043#false} is VALID [2022-04-15 12:19:17,509 INFO L272 TraceCheckUtils]: 8: Hoare triple {12043#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {12043#false} is VALID [2022-04-15 12:19:17,509 INFO L290 TraceCheckUtils]: 9: Hoare triple {12043#false} ~cond := #in~cond; {12043#false} is VALID [2022-04-15 12:19:17,509 INFO L290 TraceCheckUtils]: 10: Hoare triple {12043#false} assume 0 == ~cond; {12043#false} is VALID [2022-04-15 12:19:17,509 INFO L290 TraceCheckUtils]: 11: Hoare triple {12043#false} assume !false; {12043#false} is VALID [2022-04-15 12:19:17,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:19:17,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:19:17,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053891939] [2022-04-15 12:19:17,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053891939] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:19:17,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:19:17,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:19:18,454 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:19:18,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [407860767] [2022-04-15 12:19:18,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [407860767] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:19:18,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:19:18,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2022-04-15 12:19:18,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36553431] [2022-04-15 12:19:18,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:19:18,455 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.065217391304348) internal successors, (49), 45 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2022-04-15 12:19:18,455 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:19:18,455 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 46 states, 46 states have (on average 1.065217391304348) internal successors, (49), 45 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:18,568 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 12:19:18,568 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-04-15 12:19:18,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:19:18,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-04-15 12:19:18,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2022-04-15 12:19:18,569 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand has 46 states, 46 states have (on average 1.065217391304348) internal successors, (49), 45 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:47,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:47,198 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2022-04-15 12:19:47,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-04-15 12:19:47,198 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.065217391304348) internal successors, (49), 45 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2022-04-15 12:19:47,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:19:47,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.065217391304348) internal successors, (49), 45 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:47,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 60 transitions. [2022-04-15 12:19:47,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.065217391304348) internal successors, (49), 45 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:47,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 60 transitions. [2022-04-15 12:19:47,200 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 60 transitions. [2022-04-15 12:19:47,428 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:19:47,429 INFO L225 Difference]: With dead ends: 60 [2022-04-15 12:19:47,429 INFO L226 Difference]: Without dead ends: 55 [2022-04-15 12:19:47,430 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 903 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=261, Invalid=7571, Unknown=0, NotChecked=0, Total=7832 [2022-04-15 12:19:47,430 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 2108 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 2153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 2108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.9s IncrementalHoareTripleChecker+Time [2022-04-15 12:19:47,430 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 228 Invalid, 2153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 2108 Invalid, 0 Unknown, 0 Unchecked, 15.9s Time] [2022-04-15 12:19:47,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-15 12:19:47,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-04-15 12:19:47,433 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:19:47,433 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 55 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:47,433 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 55 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:47,433 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 55 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:47,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:47,434 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2022-04-15 12:19:47,434 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2022-04-15 12:19:47,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:19:47,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:19:47,434 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 55 states. [2022-04-15 12:19:47,434 INFO L87 Difference]: Start difference. First operand has 55 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 55 states. [2022-04-15 12:19:47,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:19:47,435 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2022-04-15 12:19:47,435 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2022-04-15 12:19:47,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:19:47,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:19:47,435 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:19:47,435 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:19:47,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:47,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2022-04-15 12:19:47,436 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2022-04-15 12:19:47,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:19:47,436 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2022-04-15 12:19:47,437 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 1.065217391304348) internal successors, (49), 45 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:47,437 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 55 transitions. [2022-04-15 12:19:47,783 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:19:47,784 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2022-04-15 12:19:47,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-15 12:19:47,784 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:19:47,784 INFO L499 BasicCegarLoop]: trace histogram [43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:19:47,784 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-04-15 12:19:47,784 INFO L403 AbstractCegarLoop]: === Iteration 45 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:19:47,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:19:47,785 INFO L85 PathProgramCache]: Analyzing trace with hash 2136038966, now seen corresponding path program 43 times [2022-04-15 12:19:47,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:19:47,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1996487641] [2022-04-15 12:19:47,840 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:19:47,842 INFO L85 PathProgramCache]: Analyzing trace with hash 615116663, now seen corresponding path program 1 times [2022-04-15 12:19:47,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:19:47,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048756073] [2022-04-15 12:19:47,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:19:47,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:19:47,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:47,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:19:47,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:19:47,883 INFO L290 TraceCheckUtils]: 0: Hoare triple {12525#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {12519#true} is VALID [2022-04-15 12:19:47,883 INFO L290 TraceCheckUtils]: 1: Hoare triple {12519#true} assume true; {12519#true} is VALID [2022-04-15 12:19:47,884 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12519#true} {12519#true} #34#return; {12519#true} is VALID [2022-04-15 12:19:47,884 INFO L272 TraceCheckUtils]: 0: Hoare triple {12519#true} call ULTIMATE.init(); {12525#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:19:47,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {12525#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {12519#true} is VALID [2022-04-15 12:19:47,884 INFO L290 TraceCheckUtils]: 2: Hoare triple {12519#true} assume true; {12519#true} is VALID [2022-04-15 12:19:47,884 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12519#true} {12519#true} #34#return; {12519#true} is VALID [2022-04-15 12:19:47,884 INFO L272 TraceCheckUtils]: 4: Hoare triple {12519#true} call #t~ret5 := main(); {12519#true} is VALID [2022-04-15 12:19:47,885 INFO L290 TraceCheckUtils]: 5: Hoare triple {12519#true} ~x~0 := 1;~y~0 := 0; {12524#(= main_~y~0 0)} is VALID [2022-04-15 12:19:47,885 INFO L290 TraceCheckUtils]: 6: Hoare triple {12524#(= main_~y~0 0)} [124] L16-2-->L16-3_primed: Formula: (or (= v_main_~y~0_In_43 v_main_~y~0_Out_86) (and (= v_main_~y~0_Out_86 v_main_~y~0_In_43) (= v_main_~y~0_Out_86 0) (= v_main_~x~0_Out_86 0) (< (mod (+ 4294967295 v_main_~y~0_Out_86) 4294967296) 1024) (= |v_main_#t~post4_Out_86| 1))) InVars {main_~y~0=v_main_~y~0_In_43} OutVars{main_#t~post4=|v_main_#t~post4_Out_86|, main_~y~0=v_main_~y~0_Out_86, main_~x~0=v_main_~x~0_Out_86} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {12524#(= main_~y~0 0)} is VALID [2022-04-15 12:19:47,885 INFO L290 TraceCheckUtils]: 7: Hoare triple {12524#(= main_~y~0 0)} [123] L16-3_primed-->L16-3: Formula: (not (< (mod v_main_~y~0_4 4294967296) 1024)) InVars {main_~y~0=v_main_~y~0_4} OutVars{main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[] {12520#false} is VALID [2022-04-15 12:19:47,886 INFO L272 TraceCheckUtils]: 8: Hoare triple {12520#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {12520#false} is VALID [2022-04-15 12:19:47,886 INFO L290 TraceCheckUtils]: 9: Hoare triple {12520#false} ~cond := #in~cond; {12520#false} is VALID [2022-04-15 12:19:47,886 INFO L290 TraceCheckUtils]: 10: Hoare triple {12520#false} assume 0 == ~cond; {12520#false} is VALID [2022-04-15 12:19:47,886 INFO L290 TraceCheckUtils]: 11: Hoare triple {12520#false} assume !false; {12520#false} is VALID [2022-04-15 12:19:47,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:19:47,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:19:47,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048756073] [2022-04-15 12:19:47,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048756073] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:19:47,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:19:47,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:19:48,857 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:19:48,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1996487641] [2022-04-15 12:19:48,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1996487641] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:19:48,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:19:48,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2022-04-15 12:19:48,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495698411] [2022-04-15 12:19:48,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:19:48,858 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 46 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2022-04-15 12:19:48,858 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:19:48,858 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 47 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 46 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:19:49,001 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 12:19:49,001 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-04-15 12:19:49,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:19:49,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-04-15 12:19:49,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2022-04-15 12:19:49,002 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand has 47 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 46 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:25,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:20:25,816 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2022-04-15 12:20:25,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-04-15 12:20:25,816 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 46 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2022-04-15 12:20:25,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:20:25,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 46 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:25,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2022-04-15 12:20:25,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 46 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:25,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2022-04-15 12:20:25,818 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 61 transitions. [2022-04-15 12:20:25,943 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:20:25,944 INFO L225 Difference]: With dead ends: 61 [2022-04-15 12:20:25,944 INFO L226 Difference]: Without dead ends: 56 [2022-04-15 12:20:25,945 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 946 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=267, Invalid=7923, Unknown=0, NotChecked=0, Total=8190 [2022-04-15 12:20:25,945 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 2201 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 2247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 2201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.4s IncrementalHoareTripleChecker+Time [2022-04-15 12:20:25,945 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 233 Invalid, 2247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 2201 Invalid, 0 Unknown, 0 Unchecked, 20.4s Time] [2022-04-15 12:20:25,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-15 12:20:25,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-04-15 12:20:25,949 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:20:25,949 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 56 states, 51 states have (on average 1.0196078431372548) internal successors, (52), 51 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:25,949 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 56 states, 51 states have (on average 1.0196078431372548) internal successors, (52), 51 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:25,949 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 56 states, 51 states have (on average 1.0196078431372548) internal successors, (52), 51 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:25,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:20:25,950 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2022-04-15 12:20:25,951 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2022-04-15 12:20:25,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:20:25,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:20:25,951 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 51 states have (on average 1.0196078431372548) internal successors, (52), 51 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 56 states. [2022-04-15 12:20:25,951 INFO L87 Difference]: Start difference. First operand has 56 states, 51 states have (on average 1.0196078431372548) internal successors, (52), 51 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 56 states. [2022-04-15 12:20:25,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:20:25,952 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2022-04-15 12:20:25,952 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2022-04-15 12:20:25,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:20:25,953 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:20:25,953 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:20:25,953 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:20:25,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 51 states have (on average 1.0196078431372548) internal successors, (52), 51 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:25,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2022-04-15 12:20:25,954 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2022-04-15 12:20:25,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:20:25,954 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2022-04-15 12:20:25,954 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 46 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:25,954 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 56 transitions. [2022-04-15 12:20:26,268 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:20:26,268 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2022-04-15 12:20:26,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-15 12:20:26,269 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:20:26,269 INFO L499 BasicCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:20:26,269 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-04-15 12:20:26,269 INFO L403 AbstractCegarLoop]: === Iteration 46 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:20:26,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:20:26,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1829159772, now seen corresponding path program 44 times [2022-04-15 12:20:26,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:20:26,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2099093570] [2022-04-15 12:20:26,327 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:20:26,328 INFO L85 PathProgramCache]: Analyzing trace with hash 674222007, now seen corresponding path program 1 times [2022-04-15 12:20:26,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:20:26,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891632031] [2022-04-15 12:20:26,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:20:26,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:20:26,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:20:26,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:20:26,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:20:26,368 INFO L290 TraceCheckUtils]: 0: Hoare triple {13011#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {13005#true} is VALID [2022-04-15 12:20:26,368 INFO L290 TraceCheckUtils]: 1: Hoare triple {13005#true} assume true; {13005#true} is VALID [2022-04-15 12:20:26,368 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13005#true} {13005#true} #34#return; {13005#true} is VALID [2022-04-15 12:20:26,368 INFO L272 TraceCheckUtils]: 0: Hoare triple {13005#true} call ULTIMATE.init(); {13011#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:20:26,368 INFO L290 TraceCheckUtils]: 1: Hoare triple {13011#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {13005#true} is VALID [2022-04-15 12:20:26,369 INFO L290 TraceCheckUtils]: 2: Hoare triple {13005#true} assume true; {13005#true} is VALID [2022-04-15 12:20:26,369 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13005#true} {13005#true} #34#return; {13005#true} is VALID [2022-04-15 12:20:26,369 INFO L272 TraceCheckUtils]: 4: Hoare triple {13005#true} call #t~ret5 := main(); {13005#true} is VALID [2022-04-15 12:20:26,369 INFO L290 TraceCheckUtils]: 5: Hoare triple {13005#true} ~x~0 := 1;~y~0 := 0; {13010#(= main_~y~0 0)} is VALID [2022-04-15 12:20:26,369 INFO L290 TraceCheckUtils]: 6: Hoare triple {13010#(= main_~y~0 0)} [126] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~x~0_Out_88 0) (= |v_main_#t~post4_Out_88| 1) (= v_main_~y~0_Out_88 v_main_~y~0_In_44) (< (mod (+ 4294967295 v_main_~y~0_Out_88) 4294967296) 1024) (= v_main_~y~0_Out_88 0)) (= v_main_~y~0_In_44 v_main_~y~0_Out_88)) InVars {main_~y~0=v_main_~y~0_In_44} OutVars{main_#t~post4=|v_main_#t~post4_Out_88|, main_~y~0=v_main_~y~0_Out_88, main_~x~0=v_main_~x~0_Out_88} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {13010#(= main_~y~0 0)} is VALID [2022-04-15 12:20:26,370 INFO L290 TraceCheckUtils]: 7: Hoare triple {13010#(= main_~y~0 0)} [125] L16-3_primed-->L16-3: Formula: (not (< (mod v_main_~y~0_4 4294967296) 1024)) InVars {main_~y~0=v_main_~y~0_4} OutVars{main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[] {13006#false} is VALID [2022-04-15 12:20:26,370 INFO L272 TraceCheckUtils]: 8: Hoare triple {13006#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {13006#false} is VALID [2022-04-15 12:20:26,370 INFO L290 TraceCheckUtils]: 9: Hoare triple {13006#false} ~cond := #in~cond; {13006#false} is VALID [2022-04-15 12:20:26,370 INFO L290 TraceCheckUtils]: 10: Hoare triple {13006#false} assume 0 == ~cond; {13006#false} is VALID [2022-04-15 12:20:26,370 INFO L290 TraceCheckUtils]: 11: Hoare triple {13006#false} assume !false; {13006#false} is VALID [2022-04-15 12:20:26,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:20:26,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:20:26,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891632031] [2022-04-15 12:20:26,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891632031] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:20:26,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:20:26,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:20:27,383 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:20:27,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2099093570] [2022-04-15 12:20:27,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2099093570] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:20:27,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:20:27,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2022-04-15 12:20:27,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389954237] [2022-04-15 12:20:27,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:20:27,384 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.0625) internal successors, (51), 47 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2022-04-15 12:20:27,384 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:20:27,384 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 48 states, 48 states have (on average 1.0625) internal successors, (51), 47 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:20:27,513 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:20:27,513 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-04-15 12:20:27,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:20:27,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-04-15 12:20:27,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2022-04-15 12:20:27,514 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand has 48 states, 48 states have (on average 1.0625) internal successors, (51), 47 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:08,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:21:08,596 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2022-04-15 12:21:08,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-04-15 12:21:08,596 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.0625) internal successors, (51), 47 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2022-04-15 12:21:08,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:21:08,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 1.0625) internal successors, (51), 47 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:08,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 62 transitions. [2022-04-15 12:21:08,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 1.0625) internal successors, (51), 47 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:08,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 62 transitions. [2022-04-15 12:21:08,598 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 62 transitions. [2022-04-15 12:21:08,735 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:21:08,735 INFO L225 Difference]: With dead ends: 62 [2022-04-15 12:21:08,735 INFO L226 Difference]: Without dead ends: 57 [2022-04-15 12:21:08,736 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 990 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=273, Invalid=8283, Unknown=0, NotChecked=0, Total=8556 [2022-04-15 12:21:08,736 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 2296 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 2343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 2296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.8s IncrementalHoareTripleChecker+Time [2022-04-15 12:21:08,737 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 238 Invalid, 2343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 2296 Invalid, 0 Unknown, 0 Unchecked, 22.8s Time] [2022-04-15 12:21:08,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-15 12:21:08,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-04-15 12:21:08,738 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:21:08,738 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 57 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:08,738 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 57 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:08,739 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 57 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:08,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:21:08,739 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2022-04-15 12:21:08,739 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2022-04-15 12:21:08,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:21:08,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:21:08,739 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 57 states. [2022-04-15 12:21:08,740 INFO L87 Difference]: Start difference. First operand has 57 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 57 states. [2022-04-15 12:21:08,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:21:08,740 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2022-04-15 12:21:08,740 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2022-04-15 12:21:08,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:21:08,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:21:08,740 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:21:08,740 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:21:08,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:08,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2022-04-15 12:21:08,741 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2022-04-15 12:21:08,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:21:08,741 INFO L478 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2022-04-15 12:21:08,741 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 1.0625) internal successors, (51), 47 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:08,741 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 57 transitions. [2022-04-15 12:21:08,961 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:21:08,961 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2022-04-15 12:21:08,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-15 12:21:08,962 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:21:08,962 INFO L499 BasicCegarLoop]: trace histogram [45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:21:08,962 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-04-15 12:21:08,962 INFO L403 AbstractCegarLoop]: === Iteration 47 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:21:08,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:21:08,962 INFO L85 PathProgramCache]: Analyzing trace with hash 905839350, now seen corresponding path program 45 times [2022-04-15 12:21:08,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:21:08,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1293779294] [2022-04-15 12:21:09,013 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:21:09,014 INFO L85 PathProgramCache]: Analyzing trace with hash 733327351, now seen corresponding path program 1 times [2022-04-15 12:21:09,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:21:09,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579669447] [2022-04-15 12:21:09,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:21:09,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:21:09,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:21:09,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:21:09,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:21:09,056 INFO L290 TraceCheckUtils]: 0: Hoare triple {13506#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {13500#true} is VALID [2022-04-15 12:21:09,057 INFO L290 TraceCheckUtils]: 1: Hoare triple {13500#true} assume true; {13500#true} is VALID [2022-04-15 12:21:09,057 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13500#true} {13500#true} #34#return; {13500#true} is VALID [2022-04-15 12:21:09,057 INFO L272 TraceCheckUtils]: 0: Hoare triple {13500#true} call ULTIMATE.init(); {13506#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:21:09,057 INFO L290 TraceCheckUtils]: 1: Hoare triple {13506#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {13500#true} is VALID [2022-04-15 12:21:09,057 INFO L290 TraceCheckUtils]: 2: Hoare triple {13500#true} assume true; {13500#true} is VALID [2022-04-15 12:21:09,057 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13500#true} {13500#true} #34#return; {13500#true} is VALID [2022-04-15 12:21:09,057 INFO L272 TraceCheckUtils]: 4: Hoare triple {13500#true} call #t~ret5 := main(); {13500#true} is VALID [2022-04-15 12:21:09,058 INFO L290 TraceCheckUtils]: 5: Hoare triple {13500#true} ~x~0 := 1;~y~0 := 0; {13505#(= main_~y~0 0)} is VALID [2022-04-15 12:21:09,058 INFO L290 TraceCheckUtils]: 6: Hoare triple {13505#(= main_~y~0 0)} [128] L16-2-->L16-3_primed: Formula: (or (= v_main_~y~0_In_45 v_main_~y~0_Out_90) (and (= v_main_~y~0_Out_90 v_main_~y~0_In_45) (= |v_main_#t~post4_Out_90| 1) (= v_main_~y~0_Out_90 0) (= v_main_~x~0_Out_90 0) (< (mod (+ 4294967295 v_main_~y~0_Out_90) 4294967296) 1024))) InVars {main_~y~0=v_main_~y~0_In_45} OutVars{main_#t~post4=|v_main_#t~post4_Out_90|, main_~y~0=v_main_~y~0_Out_90, main_~x~0=v_main_~x~0_Out_90} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {13505#(= main_~y~0 0)} is VALID [2022-04-15 12:21:09,058 INFO L290 TraceCheckUtils]: 7: Hoare triple {13505#(= main_~y~0 0)} [127] L16-3_primed-->L16-3: Formula: (not (< (mod v_main_~y~0_4 4294967296) 1024)) InVars {main_~y~0=v_main_~y~0_4} OutVars{main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[] {13501#false} is VALID [2022-04-15 12:21:09,059 INFO L272 TraceCheckUtils]: 8: Hoare triple {13501#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {13501#false} is VALID [2022-04-15 12:21:09,059 INFO L290 TraceCheckUtils]: 9: Hoare triple {13501#false} ~cond := #in~cond; {13501#false} is VALID [2022-04-15 12:21:09,059 INFO L290 TraceCheckUtils]: 10: Hoare triple {13501#false} assume 0 == ~cond; {13501#false} is VALID [2022-04-15 12:21:09,059 INFO L290 TraceCheckUtils]: 11: Hoare triple {13501#false} assume !false; {13501#false} is VALID [2022-04-15 12:21:09,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:21:09,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:21:09,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579669447] [2022-04-15 12:21:09,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579669447] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:21:09,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:21:09,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:21:10,019 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:21:10,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1293779294] [2022-04-15 12:21:10,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1293779294] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:21:10,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:21:10,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [49] imperfect sequences [] total 49 [2022-04-15 12:21:10,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931310468] [2022-04-15 12:21:10,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:21:10,020 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 48 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2022-04-15 12:21:10,020 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:21:10,020 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 49 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 48 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:10,140 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:21:10,141 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-04-15 12:21:10,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:21:10,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-04-15 12:21:10,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2022-04-15 12:21:10,141 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand has 49 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 48 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:54,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:21:54,390 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2022-04-15 12:21:54,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-04-15 12:21:54,390 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 48 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2022-04-15 12:21:54,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:21:54,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 48 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:54,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 63 transitions. [2022-04-15 12:21:54,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 48 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:54,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 63 transitions. [2022-04-15 12:21:54,392 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 63 transitions. [2022-04-15 12:21:54,525 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:21:54,526 INFO L225 Difference]: With dead ends: 63 [2022-04-15 12:21:54,526 INFO L226 Difference]: Without dead ends: 58 [2022-04-15 12:21:54,527 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1035 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=279, Invalid=8651, Unknown=0, NotChecked=0, Total=8930 [2022-04-15 12:21:54,527 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 2393 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 2441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 2393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.6s IncrementalHoareTripleChecker+Time [2022-04-15 12:21:54,527 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 243 Invalid, 2441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 2393 Invalid, 0 Unknown, 0 Unchecked, 24.6s Time] [2022-04-15 12:21:54,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-15 12:21:54,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-04-15 12:21:54,534 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:21:54,534 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 58 states, 53 states have (on average 1.0188679245283019) internal successors, (54), 53 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:54,534 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 58 states, 53 states have (on average 1.0188679245283019) internal successors, (54), 53 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:54,534 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 58 states, 53 states have (on average 1.0188679245283019) internal successors, (54), 53 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:54,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:21:54,535 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2022-04-15 12:21:54,535 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2022-04-15 12:21:54,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:21:54,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:21:54,535 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 53 states have (on average 1.0188679245283019) internal successors, (54), 53 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 58 states. [2022-04-15 12:21:54,535 INFO L87 Difference]: Start difference. First operand has 58 states, 53 states have (on average 1.0188679245283019) internal successors, (54), 53 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 58 states. [2022-04-15 12:21:54,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:21:54,536 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2022-04-15 12:21:54,536 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2022-04-15 12:21:54,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:21:54,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:21:54,536 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:21:54,536 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:21:54,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 53 states have (on average 1.0188679245283019) internal successors, (54), 53 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:54,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2022-04-15 12:21:54,537 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2022-04-15 12:21:54,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:21:54,537 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2022-04-15 12:21:54,537 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 48 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:54,537 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 58 transitions. [2022-04-15 12:21:54,804 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:21:54,804 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2022-04-15 12:21:54,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-15 12:21:54,805 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:21:54,805 INFO L499 BasicCegarLoop]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:21:54,805 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-04-15 12:21:54,805 INFO L403 AbstractCegarLoop]: === Iteration 48 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:21:54,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:21:54,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1947289956, now seen corresponding path program 46 times [2022-04-15 12:21:54,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:21:54,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [522028260] [2022-04-15 12:21:54,858 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:21:54,859 INFO L85 PathProgramCache]: Analyzing trace with hash 792432695, now seen corresponding path program 1 times [2022-04-15 12:21:54,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:21:54,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872703894] [2022-04-15 12:21:54,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:21:54,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:21:54,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:21:54,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:21:54,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:21:54,892 INFO L290 TraceCheckUtils]: 0: Hoare triple {14010#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {14004#true} is VALID [2022-04-15 12:21:54,892 INFO L290 TraceCheckUtils]: 1: Hoare triple {14004#true} assume true; {14004#true} is VALID [2022-04-15 12:21:54,892 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14004#true} {14004#true} #34#return; {14004#true} is VALID [2022-04-15 12:21:54,892 INFO L272 TraceCheckUtils]: 0: Hoare triple {14004#true} call ULTIMATE.init(); {14010#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:21:54,892 INFO L290 TraceCheckUtils]: 1: Hoare triple {14010#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {14004#true} is VALID [2022-04-15 12:21:54,893 INFO L290 TraceCheckUtils]: 2: Hoare triple {14004#true} assume true; {14004#true} is VALID [2022-04-15 12:21:54,893 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14004#true} {14004#true} #34#return; {14004#true} is VALID [2022-04-15 12:21:54,893 INFO L272 TraceCheckUtils]: 4: Hoare triple {14004#true} call #t~ret5 := main(); {14004#true} is VALID [2022-04-15 12:21:54,893 INFO L290 TraceCheckUtils]: 5: Hoare triple {14004#true} ~x~0 := 1;~y~0 := 0; {14009#(= main_~y~0 0)} is VALID [2022-04-15 12:21:54,893 INFO L290 TraceCheckUtils]: 6: Hoare triple {14009#(= main_~y~0 0)} [130] L16-2-->L16-3_primed: Formula: (or (= v_main_~y~0_In_46 v_main_~y~0_Out_92) (and (= v_main_~x~0_Out_92 0) (= v_main_~y~0_Out_92 0) (= v_main_~y~0_Out_92 v_main_~y~0_In_46) (= |v_main_#t~post4_Out_92| 1) (< (mod (+ 4294967295 v_main_~y~0_Out_92) 4294967296) 1024))) InVars {main_~y~0=v_main_~y~0_In_46} OutVars{main_#t~post4=|v_main_#t~post4_Out_92|, main_~y~0=v_main_~y~0_Out_92, main_~x~0=v_main_~x~0_Out_92} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {14009#(= main_~y~0 0)} is VALID [2022-04-15 12:21:54,894 INFO L290 TraceCheckUtils]: 7: Hoare triple {14009#(= main_~y~0 0)} [129] L16-3_primed-->L16-3: Formula: (not (< (mod v_main_~y~0_4 4294967296) 1024)) InVars {main_~y~0=v_main_~y~0_4} OutVars{main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[] {14005#false} is VALID [2022-04-15 12:21:54,894 INFO L272 TraceCheckUtils]: 8: Hoare triple {14005#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {14005#false} is VALID [2022-04-15 12:21:54,894 INFO L290 TraceCheckUtils]: 9: Hoare triple {14005#false} ~cond := #in~cond; {14005#false} is VALID [2022-04-15 12:21:54,894 INFO L290 TraceCheckUtils]: 10: Hoare triple {14005#false} assume 0 == ~cond; {14005#false} is VALID [2022-04-15 12:21:54,894 INFO L290 TraceCheckUtils]: 11: Hoare triple {14005#false} assume !false; {14005#false} is VALID [2022-04-15 12:21:54,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:21:54,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:21:54,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872703894] [2022-04-15 12:21:54,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872703894] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:21:54,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:21:54,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:21:55,969 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:21:55,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [522028260] [2022-04-15 12:21:55,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [522028260] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:21:55,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:21:55,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [50] imperfect sequences [] total 50 [2022-04-15 12:21:55,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805228045] [2022-04-15 12:21:55,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:21:55,970 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.06) internal successors, (53), 49 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 57 [2022-04-15 12:21:55,970 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:21:55,970 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 50 states, 50 states have (on average 1.06) internal successors, (53), 49 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:21:56,086 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:21:56,086 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-04-15 12:21:56,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:21:56,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-04-15 12:21:56,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2022-04-15 12:21:56,087 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand has 50 states, 50 states have (on average 1.06) internal successors, (53), 49 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:22:48,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:22:48,653 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2022-04-15 12:22:48,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-04-15 12:22:48,653 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.06) internal successors, (53), 49 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 57 [2022-04-15 12:22:48,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:22:48,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.06) internal successors, (53), 49 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:22:48,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2022-04-15 12:22:48,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.06) internal successors, (53), 49 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:22:48,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2022-04-15 12:22:48,655 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 64 transitions. [2022-04-15 12:22:48,827 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 12:22:48,828 INFO L225 Difference]: With dead ends: 64 [2022-04-15 12:22:48,828 INFO L226 Difference]: Without dead ends: 59 [2022-04-15 12:22:48,828 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1081 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=285, Invalid=9027, Unknown=0, NotChecked=0, Total=9312 [2022-04-15 12:22:48,828 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 2492 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 2541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 2492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:22:48,829 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 248 Invalid, 2541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 2492 Invalid, 0 Unknown, 0 Unchecked, 29.1s Time] [2022-04-15 12:22:48,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-15 12:22:48,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-04-15 12:22:48,830 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:22:48,831 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 59 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:22:48,831 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 59 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:22:48,831 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 59 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:22:48,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:22:48,831 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2022-04-15 12:22:48,831 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2022-04-15 12:22:48,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:22:48,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:22:48,832 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 59 states. [2022-04-15 12:22:48,832 INFO L87 Difference]: Start difference. First operand has 59 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 59 states. [2022-04-15 12:22:48,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:22:48,832 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2022-04-15 12:22:48,832 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2022-04-15 12:22:48,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:22:48,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:22:48,832 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:22:48,833 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:22:48,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:22:48,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2022-04-15 12:22:48,833 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2022-04-15 12:22:48,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:22:48,833 INFO L478 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2022-04-15 12:22:48,833 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 1.06) internal successors, (53), 49 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:22:48,833 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 59 transitions. [2022-04-15 12:22:49,060 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:22:49,061 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2022-04-15 12:22:49,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-15 12:22:49,061 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:22:49,061 INFO L499 BasicCegarLoop]: trace histogram [47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:22:49,061 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-04-15 12:22:49,061 INFO L403 AbstractCegarLoop]: === Iteration 49 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:22:49,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:22:49,062 INFO L85 PathProgramCache]: Analyzing trace with hash -199985226, now seen corresponding path program 47 times [2022-04-15 12:22:49,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:22:49,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [243921722] [2022-04-15 12:22:49,111 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:22:49,112 INFO L85 PathProgramCache]: Analyzing trace with hash 851538039, now seen corresponding path program 1 times [2022-04-15 12:22:49,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:22:49,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454645389] [2022-04-15 12:22:49,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:22:49,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:22:49,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:22:49,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:22:49,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:22:49,140 INFO L290 TraceCheckUtils]: 0: Hoare triple {14523#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {14517#true} is VALID [2022-04-15 12:22:49,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {14517#true} assume true; {14517#true} is VALID [2022-04-15 12:22:49,140 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14517#true} {14517#true} #34#return; {14517#true} is VALID [2022-04-15 12:22:49,141 INFO L272 TraceCheckUtils]: 0: Hoare triple {14517#true} call ULTIMATE.init(); {14523#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:22:49,141 INFO L290 TraceCheckUtils]: 1: Hoare triple {14523#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {14517#true} is VALID [2022-04-15 12:22:49,141 INFO L290 TraceCheckUtils]: 2: Hoare triple {14517#true} assume true; {14517#true} is VALID [2022-04-15 12:22:49,141 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14517#true} {14517#true} #34#return; {14517#true} is VALID [2022-04-15 12:22:49,141 INFO L272 TraceCheckUtils]: 4: Hoare triple {14517#true} call #t~ret5 := main(); {14517#true} is VALID [2022-04-15 12:22:49,142 INFO L290 TraceCheckUtils]: 5: Hoare triple {14517#true} ~x~0 := 1;~y~0 := 0; {14522#(= main_~y~0 0)} is VALID [2022-04-15 12:22:49,142 INFO L290 TraceCheckUtils]: 6: Hoare triple {14522#(= main_~y~0 0)} [132] L16-2-->L16-3_primed: Formula: (or (= v_main_~y~0_In_47 v_main_~y~0_Out_94) (and (= v_main_~x~0_Out_94 0) (= v_main_~y~0_Out_94 0) (< (mod (+ 4294967295 v_main_~y~0_Out_94) 4294967296) 1024) (= |v_main_#t~post4_Out_94| 1) (= v_main_~y~0_Out_94 v_main_~y~0_In_47))) InVars {main_~y~0=v_main_~y~0_In_47} OutVars{main_#t~post4=|v_main_#t~post4_Out_94|, main_~y~0=v_main_~y~0_Out_94, main_~x~0=v_main_~x~0_Out_94} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {14522#(= main_~y~0 0)} is VALID [2022-04-15 12:22:49,142 INFO L290 TraceCheckUtils]: 7: Hoare triple {14522#(= main_~y~0 0)} [131] L16-3_primed-->L16-3: Formula: (not (< (mod v_main_~y~0_4 4294967296) 1024)) InVars {main_~y~0=v_main_~y~0_4} OutVars{main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[] {14518#false} is VALID [2022-04-15 12:22:49,142 INFO L272 TraceCheckUtils]: 8: Hoare triple {14518#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {14518#false} is VALID [2022-04-15 12:22:49,142 INFO L290 TraceCheckUtils]: 9: Hoare triple {14518#false} ~cond := #in~cond; {14518#false} is VALID [2022-04-15 12:22:49,143 INFO L290 TraceCheckUtils]: 10: Hoare triple {14518#false} assume 0 == ~cond; {14518#false} is VALID [2022-04-15 12:22:49,143 INFO L290 TraceCheckUtils]: 11: Hoare triple {14518#false} assume !false; {14518#false} is VALID [2022-04-15 12:22:49,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:22:49,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:22:49,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454645389] [2022-04-15 12:22:49,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454645389] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:22:49,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:22:49,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:22:50,199 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:22:50,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [243921722] [2022-04-15 12:22:50,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [243921722] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:22:50,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:22:50,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [51] imperfect sequences [] total 51 [2022-04-15 12:22:50,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138245077] [2022-04-15 12:22:50,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:22:50,199 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 50 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 58 [2022-04-15 12:22:50,200 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:22:50,200 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 51 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 50 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:22:50,351 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:22:50,351 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-04-15 12:22:50,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:22:50,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-04-15 12:22:50,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2022-04-15 12:22:50,352 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand has 51 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 50 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:23:52,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:23:52,540 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2022-04-15 12:23:52,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-04-15 12:23:52,540 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 50 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 58 [2022-04-15 12:23:52,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:23:52,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 50 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:23:52,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 65 transitions. [2022-04-15 12:23:52,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 50 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:23:52,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 65 transitions. [2022-04-15 12:23:52,542 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 65 transitions. [2022-04-15 12:23:52,741 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:23:52,741 INFO L225 Difference]: With dead ends: 65 [2022-04-15 12:23:52,741 INFO L226 Difference]: Without dead ends: 60 [2022-04-15 12:23:52,742 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1128 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=291, Invalid=9411, Unknown=0, NotChecked=0, Total=9702 [2022-04-15 12:23:52,742 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 2593 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 34.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 2643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 2593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 34.5s IncrementalHoareTripleChecker+Time [2022-04-15 12:23:52,742 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 253 Invalid, 2643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 2593 Invalid, 0 Unknown, 0 Unchecked, 34.5s Time] [2022-04-15 12:23:52,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-15 12:23:52,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-04-15 12:23:52,744 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:23:52,744 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 60 states, 55 states have (on average 1.018181818181818) internal successors, (56), 55 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:23:52,744 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 60 states, 55 states have (on average 1.018181818181818) internal successors, (56), 55 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:23:52,745 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 60 states, 55 states have (on average 1.018181818181818) internal successors, (56), 55 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:23:52,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:23:52,745 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2022-04-15 12:23:52,745 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2022-04-15 12:23:52,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:23:52,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:23:52,745 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 55 states have (on average 1.018181818181818) internal successors, (56), 55 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 60 states. [2022-04-15 12:23:52,745 INFO L87 Difference]: Start difference. First operand has 60 states, 55 states have (on average 1.018181818181818) internal successors, (56), 55 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 60 states. [2022-04-15 12:23:52,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:23:52,746 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2022-04-15 12:23:52,746 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2022-04-15 12:23:52,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:23:52,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:23:52,746 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:23:52,746 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:23:52,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 55 states have (on average 1.018181818181818) internal successors, (56), 55 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:23:52,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2022-04-15 12:23:52,747 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2022-04-15 12:23:52,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:23:52,747 INFO L478 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2022-04-15 12:23:52,747 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 50 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:23:52,747 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 60 transitions. [2022-04-15 12:23:53,073 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:23:53,073 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2022-04-15 12:23:53,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-15 12:23:53,074 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:23:53,074 INFO L499 BasicCegarLoop]: trace histogram [48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:23:53,074 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-04-15 12:23:53,074 INFO L403 AbstractCegarLoop]: === Iteration 50 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:23:53,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:23:53,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1868113444, now seen corresponding path program 48 times [2022-04-15 12:23:53,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:23:53,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [517907474] [2022-04-15 12:23:53,133 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:23:53,134 INFO L85 PathProgramCache]: Analyzing trace with hash 910643383, now seen corresponding path program 1 times [2022-04-15 12:23:53,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:23:53,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389941396] [2022-04-15 12:23:53,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:23:53,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:23:53,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:23:53,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:23:53,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:23:53,171 INFO L290 TraceCheckUtils]: 0: Hoare triple {15045#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {15039#true} is VALID [2022-04-15 12:23:53,171 INFO L290 TraceCheckUtils]: 1: Hoare triple {15039#true} assume true; {15039#true} is VALID [2022-04-15 12:23:53,171 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15039#true} {15039#true} #34#return; {15039#true} is VALID [2022-04-15 12:23:53,172 INFO L272 TraceCheckUtils]: 0: Hoare triple {15039#true} call ULTIMATE.init(); {15045#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:23:53,172 INFO L290 TraceCheckUtils]: 1: Hoare triple {15045#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {15039#true} is VALID [2022-04-15 12:23:53,172 INFO L290 TraceCheckUtils]: 2: Hoare triple {15039#true} assume true; {15039#true} is VALID [2022-04-15 12:23:53,172 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15039#true} {15039#true} #34#return; {15039#true} is VALID [2022-04-15 12:23:53,172 INFO L272 TraceCheckUtils]: 4: Hoare triple {15039#true} call #t~ret5 := main(); {15039#true} is VALID [2022-04-15 12:23:53,172 INFO L290 TraceCheckUtils]: 5: Hoare triple {15039#true} ~x~0 := 1;~y~0 := 0; {15044#(= main_~y~0 0)} is VALID [2022-04-15 12:23:53,173 INFO L290 TraceCheckUtils]: 6: Hoare triple {15044#(= main_~y~0 0)} [134] L16-2-->L16-3_primed: Formula: (or (= v_main_~y~0_In_48 v_main_~y~0_Out_96) (and (= |v_main_#t~post4_Out_96| 1) (= v_main_~x~0_Out_96 0) (= v_main_~y~0_Out_96 0) (< (mod (+ 4294967295 v_main_~y~0_Out_96) 4294967296) 1024) (= v_main_~y~0_Out_96 v_main_~y~0_In_48))) InVars {main_~y~0=v_main_~y~0_In_48} OutVars{main_#t~post4=|v_main_#t~post4_Out_96|, main_~y~0=v_main_~y~0_Out_96, main_~x~0=v_main_~x~0_Out_96} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {15044#(= main_~y~0 0)} is VALID [2022-04-15 12:23:53,173 INFO L290 TraceCheckUtils]: 7: Hoare triple {15044#(= main_~y~0 0)} [133] L16-3_primed-->L16-3: Formula: (not (< (mod v_main_~y~0_4 4294967296) 1024)) InVars {main_~y~0=v_main_~y~0_4} OutVars{main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[] {15040#false} is VALID [2022-04-15 12:23:53,173 INFO L272 TraceCheckUtils]: 8: Hoare triple {15040#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {15040#false} is VALID [2022-04-15 12:23:53,173 INFO L290 TraceCheckUtils]: 9: Hoare triple {15040#false} ~cond := #in~cond; {15040#false} is VALID [2022-04-15 12:23:53,173 INFO L290 TraceCheckUtils]: 10: Hoare triple {15040#false} assume 0 == ~cond; {15040#false} is VALID [2022-04-15 12:23:53,173 INFO L290 TraceCheckUtils]: 11: Hoare triple {15040#false} assume !false; {15040#false} is VALID [2022-04-15 12:23:53,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:23:53,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:23:53,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389941396] [2022-04-15 12:23:53,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389941396] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:23:53,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:23:53,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:23:54,296 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:23:54,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [517907474] [2022-04-15 12:23:54,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [517907474] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:23:54,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:23:54,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2022-04-15 12:23:54,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721371731] [2022-04-15 12:23:54,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:23:54,297 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 51 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2022-04-15 12:23:54,297 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:23:54,297 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 52 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 51 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:23:54,450 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:23:54,450 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-04-15 12:23:54,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:23:54,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-04-15 12:23:54,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2022-04-15 12:23:54,451 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand has 52 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 51 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:25:01,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:25:01,324 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2022-04-15 12:25:01,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-04-15 12:25:01,324 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 51 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2022-04-15 12:25:01,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:25:01,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 51 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:25:01,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 66 transitions. [2022-04-15 12:25:01,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 51 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:25:01,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 66 transitions. [2022-04-15 12:25:01,326 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 66 transitions. [2022-04-15 12:25:01,483 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:25:01,484 INFO L225 Difference]: With dead ends: 66 [2022-04-15 12:25:01,484 INFO L226 Difference]: Without dead ends: 61 [2022-04-15 12:25:01,485 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=297, Invalid=9803, Unknown=0, NotChecked=0, Total=10100 [2022-04-15 12:25:01,485 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 2696 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 37.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 2747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 2696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 37.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:25:01,485 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 258 Invalid, 2747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 2696 Invalid, 0 Unknown, 0 Unchecked, 37.0s Time] [2022-04-15 12:25:01,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-15 12:25:01,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-04-15 12:25:01,487 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:25:01,487 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 61 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:25:01,487 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 61 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:25:01,487 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 61 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:25:01,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:25:01,488 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2022-04-15 12:25:01,488 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2022-04-15 12:25:01,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:25:01,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:25:01,488 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 61 states. [2022-04-15 12:25:01,488 INFO L87 Difference]: Start difference. First operand has 61 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 61 states. [2022-04-15 12:25:01,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:25:01,489 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2022-04-15 12:25:01,489 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2022-04-15 12:25:01,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:25:01,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:25:01,489 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:25:01,489 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:25:01,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:25:01,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2022-04-15 12:25:01,490 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2022-04-15 12:25:01,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:25:01,490 INFO L478 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2022-04-15 12:25:01,490 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 51 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:25:01,490 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 61 transitions. [2022-04-15 12:25:01,807 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:25:01,808 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2022-04-15 12:25:01,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-04-15 12:25:01,808 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:25:01,808 INFO L499 BasicCegarLoop]: trace histogram [49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:25:01,808 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-04-15 12:25:01,808 INFO L403 AbstractCegarLoop]: === Iteration 51 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:25:01,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:25:01,808 INFO L85 PathProgramCache]: Analyzing trace with hash -2040480650, now seen corresponding path program 49 times [2022-04-15 12:25:01,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:25:01,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1002483264] [2022-04-15 12:25:01,869 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:25:01,870 INFO L85 PathProgramCache]: Analyzing trace with hash 969748727, now seen corresponding path program 1 times [2022-04-15 12:25:01,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:25:01,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094751782] [2022-04-15 12:25:01,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:25:01,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:25:01,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:25:01,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:25:01,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:25:01,890 INFO L290 TraceCheckUtils]: 0: Hoare triple {15576#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {15570#true} is VALID [2022-04-15 12:25:01,891 INFO L290 TraceCheckUtils]: 1: Hoare triple {15570#true} assume true; {15570#true} is VALID [2022-04-15 12:25:01,891 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15570#true} {15570#true} #34#return; {15570#true} is VALID [2022-04-15 12:25:01,891 INFO L272 TraceCheckUtils]: 0: Hoare triple {15570#true} call ULTIMATE.init(); {15576#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:25:01,891 INFO L290 TraceCheckUtils]: 1: Hoare triple {15576#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {15570#true} is VALID [2022-04-15 12:25:01,891 INFO L290 TraceCheckUtils]: 2: Hoare triple {15570#true} assume true; {15570#true} is VALID [2022-04-15 12:25:01,891 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15570#true} {15570#true} #34#return; {15570#true} is VALID [2022-04-15 12:25:01,892 INFO L272 TraceCheckUtils]: 4: Hoare triple {15570#true} call #t~ret5 := main(); {15570#true} is VALID [2022-04-15 12:25:01,892 INFO L290 TraceCheckUtils]: 5: Hoare triple {15570#true} ~x~0 := 1;~y~0 := 0; {15575#(= main_~y~0 0)} is VALID [2022-04-15 12:25:01,892 INFO L290 TraceCheckUtils]: 6: Hoare triple {15575#(= main_~y~0 0)} [136] L16-2-->L16-3_primed: Formula: (or (and (= v_main_~y~0_Out_98 v_main_~y~0_In_49) (= v_main_~x~0_Out_98 0) (< (mod (+ 4294967295 v_main_~y~0_Out_98) 4294967296) 1024) (= |v_main_#t~post4_Out_98| 1) (= v_main_~y~0_Out_98 0)) (= v_main_~y~0_In_49 v_main_~y~0_Out_98)) InVars {main_~y~0=v_main_~y~0_In_49} OutVars{main_#t~post4=|v_main_#t~post4_Out_98|, main_~y~0=v_main_~y~0_Out_98, main_~x~0=v_main_~x~0_Out_98} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {15575#(= main_~y~0 0)} is VALID [2022-04-15 12:25:01,893 INFO L290 TraceCheckUtils]: 7: Hoare triple {15575#(= main_~y~0 0)} [135] L16-3_primed-->L16-3: Formula: (not (< (mod v_main_~y~0_4 4294967296) 1024)) InVars {main_~y~0=v_main_~y~0_4} OutVars{main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[] {15571#false} is VALID [2022-04-15 12:25:01,893 INFO L272 TraceCheckUtils]: 8: Hoare triple {15571#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {15571#false} is VALID [2022-04-15 12:25:01,893 INFO L290 TraceCheckUtils]: 9: Hoare triple {15571#false} ~cond := #in~cond; {15571#false} is VALID [2022-04-15 12:25:01,893 INFO L290 TraceCheckUtils]: 10: Hoare triple {15571#false} assume 0 == ~cond; {15571#false} is VALID [2022-04-15 12:25:01,893 INFO L290 TraceCheckUtils]: 11: Hoare triple {15571#false} assume !false; {15571#false} is VALID [2022-04-15 12:25:01,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:25:01,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:25:01,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094751782] [2022-04-15 12:25:01,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094751782] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:25:01,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:25:01,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:25:02,997 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:25:02,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1002483264] [2022-04-15 12:25:02,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1002483264] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:25:02,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:25:02,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2022-04-15 12:25:02,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409375205] [2022-04-15 12:25:02,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:25:02,997 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 1.0566037735849056) internal successors, (56), 52 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 60 [2022-04-15 12:25:02,998 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:25:02,998 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 53 states, 53 states have (on average 1.0566037735849056) internal successors, (56), 52 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:25:03,165 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:25:03,166 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-04-15 12:25:03,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:25:03,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-04-15 12:25:03,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2022-04-15 12:25:03,167 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand has 53 states, 53 states have (on average 1.0566037735849056) internal successors, (56), 52 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:26:20,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:26:20,260 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2022-04-15 12:26:20,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-04-15 12:26:20,260 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 1.0566037735849056) internal successors, (56), 52 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 60 [2022-04-15 12:26:20,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:26:20,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 1.0566037735849056) internal successors, (56), 52 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:26:20,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 67 transitions. [2022-04-15 12:26:20,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 1.0566037735849056) internal successors, (56), 52 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:26:20,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 67 transitions. [2022-04-15 12:26:20,262 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 67 transitions. [2022-04-15 12:26:20,433 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:26:20,434 INFO L225 Difference]: With dead ends: 67 [2022-04-15 12:26:20,434 INFO L226 Difference]: Without dead ends: 62 [2022-04-15 12:26:20,434 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=303, Invalid=10203, Unknown=0, NotChecked=0, Total=10506 [2022-04-15 12:26:20,435 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 2801 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 42.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 2853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 2801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 42.8s IncrementalHoareTripleChecker+Time [2022-04-15 12:26:20,435 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 263 Invalid, 2853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 2801 Invalid, 0 Unknown, 0 Unchecked, 42.8s Time] [2022-04-15 12:26:20,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-04-15 12:26:20,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-04-15 12:26:20,437 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:26:20,437 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand has 62 states, 57 states have (on average 1.0175438596491229) internal successors, (58), 57 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:26:20,437 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand has 62 states, 57 states have (on average 1.0175438596491229) internal successors, (58), 57 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:26:20,437 INFO L87 Difference]: Start difference. First operand 62 states. Second operand has 62 states, 57 states have (on average 1.0175438596491229) internal successors, (58), 57 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:26:20,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:26:20,437 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2022-04-15 12:26:20,438 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2022-04-15 12:26:20,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:26:20,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:26:20,438 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 57 states have (on average 1.0175438596491229) internal successors, (58), 57 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 62 states. [2022-04-15 12:26:20,438 INFO L87 Difference]: Start difference. First operand has 62 states, 57 states have (on average 1.0175438596491229) internal successors, (58), 57 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 62 states. [2022-04-15 12:26:20,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:26:20,438 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2022-04-15 12:26:20,438 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2022-04-15 12:26:20,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:26:20,439 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:26:20,439 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:26:20,439 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:26:20,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 57 states have (on average 1.0175438596491229) internal successors, (58), 57 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:26:20,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2022-04-15 12:26:20,439 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2022-04-15 12:26:20,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:26:20,440 INFO L478 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2022-04-15 12:26:20,440 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 1.0566037735849056) internal successors, (56), 52 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:26:20,440 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 62 transitions. [2022-04-15 12:26:20,825 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:26:20,827 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2022-04-15 12:26:20,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-15 12:26:20,828 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:26:20,828 INFO L499 BasicCegarLoop]: trace histogram [50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:26:20,828 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-04-15 12:26:20,828 INFO L403 AbstractCegarLoop]: === Iteration 52 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:26:20,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:26:20,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1206070556, now seen corresponding path program 50 times [2022-04-15 12:26:20,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:26:20,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1172150513] [2022-04-15 12:26:20,891 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:26:20,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1028854071, now seen corresponding path program 1 times [2022-04-15 12:26:20,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:26:20,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105021544] [2022-04-15 12:26:20,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:26:20,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:26:20,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:26:20,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:26:20,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:26:20,913 INFO L290 TraceCheckUtils]: 0: Hoare triple {16116#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {16110#true} is VALID [2022-04-15 12:26:20,913 INFO L290 TraceCheckUtils]: 1: Hoare triple {16110#true} assume true; {16110#true} is VALID [2022-04-15 12:26:20,913 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16110#true} {16110#true} #34#return; {16110#true} is VALID [2022-04-15 12:26:20,914 INFO L272 TraceCheckUtils]: 0: Hoare triple {16110#true} call ULTIMATE.init(); {16116#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:26:20,914 INFO L290 TraceCheckUtils]: 1: Hoare triple {16116#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {16110#true} is VALID [2022-04-15 12:26:20,914 INFO L290 TraceCheckUtils]: 2: Hoare triple {16110#true} assume true; {16110#true} is VALID [2022-04-15 12:26:20,914 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16110#true} {16110#true} #34#return; {16110#true} is VALID [2022-04-15 12:26:20,914 INFO L272 TraceCheckUtils]: 4: Hoare triple {16110#true} call #t~ret5 := main(); {16110#true} is VALID [2022-04-15 12:26:20,914 INFO L290 TraceCheckUtils]: 5: Hoare triple {16110#true} ~x~0 := 1;~y~0 := 0; {16115#(= main_~y~0 0)} is VALID [2022-04-15 12:26:20,915 INFO L290 TraceCheckUtils]: 6: Hoare triple {16115#(= main_~y~0 0)} [138] L16-2-->L16-3_primed: Formula: (or (and (< (mod (+ v_main_~y~0_Out_100 4294967295) 4294967296) 1024) (= |v_main_#t~post4_Out_100| 1) (= v_main_~y~0_Out_100 0) (= v_main_~x~0_Out_100 0) (= v_main_~y~0_Out_100 v_main_~y~0_In_50)) (= v_main_~y~0_In_50 v_main_~y~0_Out_100)) InVars {main_~y~0=v_main_~y~0_In_50} OutVars{main_#t~post4=|v_main_#t~post4_Out_100|, main_~y~0=v_main_~y~0_Out_100, main_~x~0=v_main_~x~0_Out_100} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {16115#(= main_~y~0 0)} is VALID [2022-04-15 12:26:20,915 INFO L290 TraceCheckUtils]: 7: Hoare triple {16115#(= main_~y~0 0)} [137] L16-3_primed-->L16-3: Formula: (not (< (mod v_main_~y~0_4 4294967296) 1024)) InVars {main_~y~0=v_main_~y~0_4} OutVars{main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[] {16111#false} is VALID [2022-04-15 12:26:20,915 INFO L272 TraceCheckUtils]: 8: Hoare triple {16111#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {16111#false} is VALID [2022-04-15 12:26:20,915 INFO L290 TraceCheckUtils]: 9: Hoare triple {16111#false} ~cond := #in~cond; {16111#false} is VALID [2022-04-15 12:26:20,915 INFO L290 TraceCheckUtils]: 10: Hoare triple {16111#false} assume 0 == ~cond; {16111#false} is VALID [2022-04-15 12:26:20,915 INFO L290 TraceCheckUtils]: 11: Hoare triple {16111#false} assume !false; {16111#false} is VALID [2022-04-15 12:26:20,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:26:20,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:26:20,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105021544] [2022-04-15 12:26:20,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105021544] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:26:20,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:26:20,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:26:22,144 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:26:22,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1172150513] [2022-04-15 12:26:22,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1172150513] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:26:22,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:26:22,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [54] imperfect sequences [] total 54 [2022-04-15 12:26:22,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697829660] [2022-04-15 12:26:22,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:26:22,145 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 1.0555555555555556) internal successors, (57), 53 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 61 [2022-04-15 12:26:22,145 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:26:22,145 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 54 states, 54 states have (on average 1.0555555555555556) internal successors, (57), 53 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:26:22,300 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:26:22,300 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-04-15 12:26:22,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:26:22,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-04-15 12:26:22,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2022-04-15 12:26:22,301 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand has 54 states, 54 states have (on average 1.0555555555555556) internal successors, (57), 53 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:27:51,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:27:51,637 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2022-04-15 12:27:51,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-04-15 12:27:51,637 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 1.0555555555555556) internal successors, (57), 53 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 61 [2022-04-15 12:27:51,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:27:51,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 54 states have (on average 1.0555555555555556) internal successors, (57), 53 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:27:51,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 68 transitions. [2022-04-15 12:27:51,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 54 states have (on average 1.0555555555555556) internal successors, (57), 53 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:27:51,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 68 transitions. [2022-04-15 12:27:51,638 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 68 transitions. [2022-04-15 12:27:51,868 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 12:27:51,869 INFO L225 Difference]: With dead ends: 68 [2022-04-15 12:27:51,869 INFO L226 Difference]: Without dead ends: 63 [2022-04-15 12:27:51,869 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1275 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=309, Invalid=10611, Unknown=0, NotChecked=0, Total=10920 [2022-04-15 12:27:51,870 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 2908 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 49.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 2961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 2908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 49.9s IncrementalHoareTripleChecker+Time [2022-04-15 12:27:51,870 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 268 Invalid, 2961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 2908 Invalid, 0 Unknown, 0 Unchecked, 49.9s Time] [2022-04-15 12:27:51,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-15 12:27:51,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-04-15 12:27:51,872 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:27:51,872 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 63 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:27:51,872 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 63 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:27:51,872 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 63 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:27:51,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:27:51,872 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2022-04-15 12:27:51,873 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2022-04-15 12:27:51,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:27:51,873 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:27:51,873 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 63 states. [2022-04-15 12:27:51,873 INFO L87 Difference]: Start difference. First operand has 63 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 63 states. [2022-04-15 12:27:51,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:27:51,873 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2022-04-15 12:27:51,873 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2022-04-15 12:27:51,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:27:51,874 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:27:51,874 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:27:51,874 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:27:51,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:27:51,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2022-04-15 12:27:51,874 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2022-04-15 12:27:51,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:27:51,874 INFO L478 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2022-04-15 12:27:51,874 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 1.0555555555555556) internal successors, (57), 53 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:27:51,875 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 63 transitions. [2022-04-15 12:27:52,221 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:27:52,221 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2022-04-15 12:27:52,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-15 12:27:52,221 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:27:52,221 INFO L499 BasicCegarLoop]: trace histogram [51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:27:52,222 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-04-15 12:27:52,222 INFO L403 AbstractCegarLoop]: === Iteration 53 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:27:52,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:27:52,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1230057162, now seen corresponding path program 51 times [2022-04-15 12:27:52,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:27:52,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1892967895] [2022-04-15 12:27:52,278 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:27:52,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1087959415, now seen corresponding path program 1 times [2022-04-15 12:27:52,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:27:52,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744935155] [2022-04-15 12:27:52,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:27:52,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:27:52,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:27:52,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:27:52,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:27:52,300 INFO L290 TraceCheckUtils]: 0: Hoare triple {16665#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {16659#true} is VALID [2022-04-15 12:27:52,300 INFO L290 TraceCheckUtils]: 1: Hoare triple {16659#true} assume true; {16659#true} is VALID [2022-04-15 12:27:52,300 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16659#true} {16659#true} #34#return; {16659#true} is VALID [2022-04-15 12:27:52,300 INFO L272 TraceCheckUtils]: 0: Hoare triple {16659#true} call ULTIMATE.init(); {16665#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:27:52,300 INFO L290 TraceCheckUtils]: 1: Hoare triple {16665#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {16659#true} is VALID [2022-04-15 12:27:52,301 INFO L290 TraceCheckUtils]: 2: Hoare triple {16659#true} assume true; {16659#true} is VALID [2022-04-15 12:27:52,301 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16659#true} {16659#true} #34#return; {16659#true} is VALID [2022-04-15 12:27:52,301 INFO L272 TraceCheckUtils]: 4: Hoare triple {16659#true} call #t~ret5 := main(); {16659#true} is VALID [2022-04-15 12:27:52,301 INFO L290 TraceCheckUtils]: 5: Hoare triple {16659#true} ~x~0 := 1;~y~0 := 0; {16664#(= main_~y~0 0)} is VALID [2022-04-15 12:27:52,301 INFO L290 TraceCheckUtils]: 6: Hoare triple {16664#(= main_~y~0 0)} [140] L16-2-->L16-3_primed: Formula: (or (= v_main_~y~0_In_51 v_main_~y~0_Out_102) (and (< (mod (+ v_main_~y~0_Out_102 4294967295) 4294967296) 1024) (= v_main_~x~0_Out_102 0) (= v_main_~y~0_Out_102 v_main_~y~0_In_51) (= v_main_~y~0_Out_102 0) (= |v_main_#t~post4_Out_102| 1))) InVars {main_~y~0=v_main_~y~0_In_51} OutVars{main_#t~post4=|v_main_#t~post4_Out_102|, main_~y~0=v_main_~y~0_Out_102, main_~x~0=v_main_~x~0_Out_102} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {16664#(= main_~y~0 0)} is VALID [2022-04-15 12:27:52,302 INFO L290 TraceCheckUtils]: 7: Hoare triple {16664#(= main_~y~0 0)} [139] L16-3_primed-->L16-3: Formula: (not (< (mod v_main_~y~0_4 4294967296) 1024)) InVars {main_~y~0=v_main_~y~0_4} OutVars{main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[] {16660#false} is VALID [2022-04-15 12:27:52,302 INFO L272 TraceCheckUtils]: 8: Hoare triple {16660#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {16660#false} is VALID [2022-04-15 12:27:52,302 INFO L290 TraceCheckUtils]: 9: Hoare triple {16660#false} ~cond := #in~cond; {16660#false} is VALID [2022-04-15 12:27:52,302 INFO L290 TraceCheckUtils]: 10: Hoare triple {16660#false} assume 0 == ~cond; {16660#false} is VALID [2022-04-15 12:27:52,302 INFO L290 TraceCheckUtils]: 11: Hoare triple {16660#false} assume !false; {16660#false} is VALID [2022-04-15 12:27:52,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:27:52,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:27:52,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744935155] [2022-04-15 12:27:52,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744935155] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:27:52,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:27:52,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:27:53,480 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:27:53,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1892967895] [2022-04-15 12:27:53,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1892967895] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:27:53,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:27:53,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [55] imperfect sequences [] total 55 [2022-04-15 12:27:53,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389551329] [2022-04-15 12:27:53,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:27:53,481 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 1.0545454545454545) internal successors, (58), 54 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2022-04-15 12:27:53,481 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:27:53,481 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 55 states, 55 states have (on average 1.0545454545454545) internal successors, (58), 54 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:27:53,644 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:27:53,644 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-04-15 12:27:53,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:27:53,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-04-15 12:27:53,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2022-04-15 12:27:53,645 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand has 55 states, 55 states have (on average 1.0545454545454545) internal successors, (58), 54 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:29:37,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:29:37,422 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2022-04-15 12:29:37,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-04-15 12:29:37,422 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 1.0545454545454545) internal successors, (58), 54 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2022-04-15 12:29:37,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:29:37,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 1.0545454545454545) internal successors, (58), 54 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:29:37,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 69 transitions. [2022-04-15 12:29:37,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 1.0545454545454545) internal successors, (58), 54 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:29:37,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 69 transitions. [2022-04-15 12:29:37,424 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 69 transitions. [2022-04-15 12:29:37,649 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:29:37,650 INFO L225 Difference]: With dead ends: 69 [2022-04-15 12:29:37,650 INFO L226 Difference]: Without dead ends: 64 [2022-04-15 12:29:37,650 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1326 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=315, Invalid=11027, Unknown=0, NotChecked=0, Total=11342 [2022-04-15 12:29:37,651 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 3017 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 58.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 3071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 3017 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 58.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:29:37,651 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 273 Invalid, 3071 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 3017 Invalid, 0 Unknown, 0 Unchecked, 58.3s Time] [2022-04-15 12:29:37,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-15 12:29:37,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-04-15 12:29:37,653 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:29:37,653 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 64 states, 59 states have (on average 1.0169491525423728) internal successors, (60), 59 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:29:37,653 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 64 states, 59 states have (on average 1.0169491525423728) internal successors, (60), 59 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:29:37,653 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 64 states, 59 states have (on average 1.0169491525423728) internal successors, (60), 59 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:29:37,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:29:37,654 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2022-04-15 12:29:37,654 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2022-04-15 12:29:37,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:29:37,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:29:37,654 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 59 states have (on average 1.0169491525423728) internal successors, (60), 59 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 64 states. [2022-04-15 12:29:37,654 INFO L87 Difference]: Start difference. First operand has 64 states, 59 states have (on average 1.0169491525423728) internal successors, (60), 59 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 64 states. [2022-04-15 12:29:37,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:29:37,655 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2022-04-15 12:29:37,655 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2022-04-15 12:29:37,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:29:37,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:29:37,655 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:29:37,655 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:29:37,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 59 states have (on average 1.0169491525423728) internal successors, (60), 59 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:29:37,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2022-04-15 12:29:37,656 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2022-04-15 12:29:37,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:29:37,656 INFO L478 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2022-04-15 12:29:37,656 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 1.0545454545454545) internal successors, (58), 54 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:29:37,656 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 64 states and 64 transitions. [2022-04-15 12:29:38,093 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 12:29:38,093 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2022-04-15 12:29:38,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-15 12:29:38,093 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:29:38,093 INFO L499 BasicCegarLoop]: trace histogram [52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:29:38,093 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-04-15 12:29:38,093 INFO L403 AbstractCegarLoop]: === Iteration 54 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:29:38,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:29:38,094 INFO L85 PathProgramCache]: Analyzing trace with hash 559394908, now seen corresponding path program 52 times [2022-04-15 12:29:38,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:29:38,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1881495882] [2022-04-15 12:29:38,148 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:29:38,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1147064759, now seen corresponding path program 1 times [2022-04-15 12:29:38,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:29:38,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130360604] [2022-04-15 12:29:38,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:29:38,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:29:38,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:29:38,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:29:38,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:29:38,177 INFO L290 TraceCheckUtils]: 0: Hoare triple {17223#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {17217#true} is VALID [2022-04-15 12:29:38,177 INFO L290 TraceCheckUtils]: 1: Hoare triple {17217#true} assume true; {17217#true} is VALID [2022-04-15 12:29:38,177 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17217#true} {17217#true} #34#return; {17217#true} is VALID [2022-04-15 12:29:38,178 INFO L272 TraceCheckUtils]: 0: Hoare triple {17217#true} call ULTIMATE.init(); {17223#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:29:38,178 INFO L290 TraceCheckUtils]: 1: Hoare triple {17223#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {17217#true} is VALID [2022-04-15 12:29:38,178 INFO L290 TraceCheckUtils]: 2: Hoare triple {17217#true} assume true; {17217#true} is VALID [2022-04-15 12:29:38,178 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17217#true} {17217#true} #34#return; {17217#true} is VALID [2022-04-15 12:29:38,178 INFO L272 TraceCheckUtils]: 4: Hoare triple {17217#true} call #t~ret5 := main(); {17217#true} is VALID [2022-04-15 12:29:38,178 INFO L290 TraceCheckUtils]: 5: Hoare triple {17217#true} ~x~0 := 1;~y~0 := 0; {17222#(= main_~y~0 0)} is VALID [2022-04-15 12:29:38,179 INFO L290 TraceCheckUtils]: 6: Hoare triple {17222#(= main_~y~0 0)} [142] L16-2-->L16-3_primed: Formula: (or (= v_main_~y~0_In_52 v_main_~y~0_Out_104) (and (= v_main_~y~0_Out_104 0) (= |v_main_#t~post4_Out_104| 1) (= v_main_~x~0_Out_104 0) (< (mod (+ v_main_~y~0_Out_104 4294967295) 4294967296) 1024) (= v_main_~y~0_Out_104 v_main_~y~0_In_52))) InVars {main_~y~0=v_main_~y~0_In_52} OutVars{main_#t~post4=|v_main_#t~post4_Out_104|, main_~y~0=v_main_~y~0_Out_104, main_~x~0=v_main_~x~0_Out_104} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {17222#(= main_~y~0 0)} is VALID [2022-04-15 12:29:38,179 INFO L290 TraceCheckUtils]: 7: Hoare triple {17222#(= main_~y~0 0)} [141] L16-3_primed-->L16-3: Formula: (not (< (mod v_main_~y~0_4 4294967296) 1024)) InVars {main_~y~0=v_main_~y~0_4} OutVars{main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[] {17218#false} is VALID [2022-04-15 12:29:38,179 INFO L272 TraceCheckUtils]: 8: Hoare triple {17218#false} call __VERIFIER_assert((if 1 == ~x~0 % 4294967296 then 1 else 0)); {17218#false} is VALID [2022-04-15 12:29:38,179 INFO L290 TraceCheckUtils]: 9: Hoare triple {17218#false} ~cond := #in~cond; {17218#false} is VALID [2022-04-15 12:29:38,179 INFO L290 TraceCheckUtils]: 10: Hoare triple {17218#false} assume 0 == ~cond; {17218#false} is VALID [2022-04-15 12:29:38,179 INFO L290 TraceCheckUtils]: 11: Hoare triple {17218#false} assume !false; {17218#false} is VALID [2022-04-15 12:29:38,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:29:38,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:29:38,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130360604] [2022-04-15 12:29:38,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130360604] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:29:38,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:29:38,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:29:39,441 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:29:39,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1881495882] [2022-04-15 12:29:39,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1881495882] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:29:39,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:29:39,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [56] imperfect sequences [] total 56 [2022-04-15 12:29:39,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675256883] [2022-04-15 12:29:39,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:29:39,442 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 1.0535714285714286) internal successors, (59), 55 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2022-04-15 12:29:39,442 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:29:39,442 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 56 states, 56 states have (on average 1.0535714285714286) internal successors, (59), 55 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:29:39,673 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:29:39,674 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-04-15 12:29:39,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:29:39,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-04-15 12:29:39,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2022-04-15 12:29:39,675 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand has 56 states, 56 states have (on average 1.0535714285714286) internal successors, (59), 55 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)