/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/locks/test_locks_6.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 18:03:32,288 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 18:03:32,289 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 18:03:32,321 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 18:03:32,321 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 18:03:32,322 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 18:03:32,324 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 18:03:32,328 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 18:03:32,329 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 18:03:32,332 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 18:03:32,333 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 18:03:32,334 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 18:03:32,334 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 18:03:32,336 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 18:03:32,337 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 18:03:32,339 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 18:03:32,340 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 18:03:32,340 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 18:03:32,342 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 18:03:32,346 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 18:03:32,347 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 18:03:32,348 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 18:03:32,348 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 18:03:32,349 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 18:03:32,350 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 18:03:32,354 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 18:03:32,354 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 18:03:32,354 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 18:03:32,355 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 18:03:32,355 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 18:03:32,356 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 18:03:32,356 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 18:03:32,358 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 18:03:32,358 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 18:03:32,358 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 18:03:32,359 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 18:03:32,359 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 18:03:32,359 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 18:03:32,359 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 18:03:32,360 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 18:03:32,360 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 18:03:32,361 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 18:03:32,362 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 18:03:32,369 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 18:03:32,370 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 18:03:32,371 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 18:03:32,371 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 18:03:32,371 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 18:03:32,371 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 18:03:32,371 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 18:03:32,371 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 18:03:32,371 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 18:03:32,372 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 18:03:32,372 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 18:03:32,372 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 18:03:32,372 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 18:03:32,372 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 18:03:32,372 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 18:03:32,372 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 18:03:32,372 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 18:03:32,372 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 18:03:32,372 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 18:03:32,373 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 18:03:32,373 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 18:03:32,373 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 18:03:32,373 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 18:03:32,566 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 18:03:32,581 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 18:03:32,582 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 18:03:32,583 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 18:03:32,584 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 18:03:32,585 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_6.c [2022-04-15 18:03:32,636 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/250f4a060/fcbe8830dfa944d8a430891768ec09ac/FLAG684de027d [2022-04-15 18:03:32,971 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 18:03:32,971 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_6.c [2022-04-15 18:03:32,976 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/250f4a060/fcbe8830dfa944d8a430891768ec09ac/FLAG684de027d [2022-04-15 18:03:33,413 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/250f4a060/fcbe8830dfa944d8a430891768ec09ac [2022-04-15 18:03:33,415 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 18:03:33,416 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 18:03:33,417 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 18:03:33,417 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 18:03:33,435 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 18:03:33,436 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:03:33" (1/1) ... [2022-04-15 18:03:33,437 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20cf0a6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:03:33, skipping insertion in model container [2022-04-15 18:03:33,437 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:03:33" (1/1) ... [2022-04-15 18:03:33,442 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 18:03:33,454 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 18:03:33,584 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_6.c[2544,2557] [2022-04-15 18:03:33,586 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 18:03:33,602 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 18:03:33,619 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_6.c[2544,2557] [2022-04-15 18:03:33,619 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 18:03:33,630 INFO L208 MainTranslator]: Completed translation [2022-04-15 18:03:33,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:03:33 WrapperNode [2022-04-15 18:03:33,631 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 18:03:33,632 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 18:03:33,632 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 18:03:33,632 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 18:03:33,650 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:03:33" (1/1) ... [2022-04-15 18:03:33,651 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:03:33" (1/1) ... [2022-04-15 18:03:33,656 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:03:33" (1/1) ... [2022-04-15 18:03:33,656 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:03:33" (1/1) ... [2022-04-15 18:03:33,661 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:03:33" (1/1) ... [2022-04-15 18:03:33,666 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:03:33" (1/1) ... [2022-04-15 18:03:33,667 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:03:33" (1/1) ... [2022-04-15 18:03:33,668 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 18:03:33,669 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 18:03:33,669 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 18:03:33,670 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 18:03:33,679 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:03:33" (1/1) ... [2022-04-15 18:03:33,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 18:03:33,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 18:03:33,706 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 18:03:33,710 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 18:03:33,735 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 18:03:33,736 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 18:03:33,736 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 18:03:33,736 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 18:03:33,736 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 18:03:33,736 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 18:03:33,736 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 18:03:33,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 18:03:33,736 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 18:03:33,736 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 18:03:33,736 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 18:03:33,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 18:03:33,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 18:03:33,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 18:03:33,737 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 18:03:33,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 18:03:33,783 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 18:03:33,784 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 18:03:33,909 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 18:03:33,914 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 18:03:33,914 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 18:03:33,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:03:33 BoogieIcfgContainer [2022-04-15 18:03:33,916 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 18:03:33,917 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 18:03:33,917 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 18:03:33,920 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 18:03:33,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 06:03:33" (1/3) ... [2022-04-15 18:03:33,920 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@367ba19f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:03:33, skipping insertion in model container [2022-04-15 18:03:33,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:03:33" (2/3) ... [2022-04-15 18:03:33,921 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@367ba19f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:03:33, skipping insertion in model container [2022-04-15 18:03:33,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:03:33" (3/3) ... [2022-04-15 18:03:33,922 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_6.c [2022-04-15 18:03:33,925 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 18:03:33,925 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 18:03:33,954 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 18:03:33,977 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 18:03:33,978 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 18:03:34,003 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 28 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 18:03:34,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 18:03:34,008 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:03:34,009 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:03:34,009 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:03:34,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:03:34,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1747552289, now seen corresponding path program 1 times [2022-04-15 18:03:34,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:03:34,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [188104603] [2022-04-15 18:03:34,039 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:03:34,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1747552289, now seen corresponding path program 2 times [2022-04-15 18:03:34,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:03:34,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997758642] [2022-04-15 18:03:34,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:03:34,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:03:34,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:03:34,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:03:34,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:03:34,305 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#(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(15, 2);call #Ultimate.allocInit(12, 3); {36#true} is VALID [2022-04-15 18:03:34,305 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume true; {36#true} is VALID [2022-04-15 18:03:34,306 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36#true} {36#true} #132#return; {36#true} is VALID [2022-04-15 18:03:34,309 INFO L272 TraceCheckUtils]: 0: Hoare triple {36#true} call ULTIMATE.init(); {42#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:03:34,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#(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(15, 2);call #Ultimate.allocInit(12, 3); {36#true} is VALID [2022-04-15 18:03:34,309 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#true} assume true; {36#true} is VALID [2022-04-15 18:03:34,310 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#true} {36#true} #132#return; {36#true} is VALID [2022-04-15 18:03:34,310 INFO L272 TraceCheckUtils]: 4: Hoare triple {36#true} call #t~ret11 := main(); {36#true} is VALID [2022-04-15 18:03:34,311 INFO L290 TraceCheckUtils]: 5: Hoare triple {36#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;havoc ~cond~0; {36#true} is VALID [2022-04-15 18:03:34,311 INFO L290 TraceCheckUtils]: 6: Hoare triple {36#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {36#true} is VALID [2022-04-15 18:03:34,311 INFO L290 TraceCheckUtils]: 7: Hoare triple {36#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {36#true} is VALID [2022-04-15 18:03:34,312 INFO L290 TraceCheckUtils]: 8: Hoare triple {36#true} assume 0 != ~p1~0;~lk1~0 := 1; {41#(= main_~lk1~0 1)} is VALID [2022-04-15 18:03:34,314 INFO L290 TraceCheckUtils]: 9: Hoare triple {41#(= main_~lk1~0 1)} assume !(0 != ~p2~0); {41#(= main_~lk1~0 1)} is VALID [2022-04-15 18:03:34,315 INFO L290 TraceCheckUtils]: 10: Hoare triple {41#(= main_~lk1~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {41#(= main_~lk1~0 1)} is VALID [2022-04-15 18:03:34,316 INFO L290 TraceCheckUtils]: 11: Hoare triple {41#(= main_~lk1~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {41#(= main_~lk1~0 1)} is VALID [2022-04-15 18:03:34,317 INFO L290 TraceCheckUtils]: 12: Hoare triple {41#(= main_~lk1~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {41#(= main_~lk1~0 1)} is VALID [2022-04-15 18:03:34,318 INFO L290 TraceCheckUtils]: 13: Hoare triple {41#(= main_~lk1~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {41#(= main_~lk1~0 1)} is VALID [2022-04-15 18:03:34,319 INFO L290 TraceCheckUtils]: 14: Hoare triple {41#(= main_~lk1~0 1)} assume 0 != ~p1~0; {41#(= main_~lk1~0 1)} is VALID [2022-04-15 18:03:34,320 INFO L290 TraceCheckUtils]: 15: Hoare triple {41#(= main_~lk1~0 1)} assume 1 != ~lk1~0; {37#false} is VALID [2022-04-15 18:03:34,321 INFO L290 TraceCheckUtils]: 16: Hoare triple {37#false} assume !false; {37#false} is VALID [2022-04-15 18:03:34,322 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 18:03:34,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:03:34,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997758642] [2022-04-15 18:03:34,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997758642] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:03:34,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:03:34,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:03:34,327 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:03:34,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [188104603] [2022-04-15 18:03:34,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [188104603] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:03:34,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:03:34,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:03:34,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594985287] [2022-04-15 18:03:34,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:03:34,335 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 18:03:34,338 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:03:34,342 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:34,377 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 18:03:34,377 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:03:34,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:03:34,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:03:34,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:03:34,394 INFO L87 Difference]: Start difference. First operand has 33 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 28 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:34,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:03:34,644 INFO L93 Difference]: Finished difference Result 64 states and 103 transitions. [2022-04-15 18:03:34,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:03:34,645 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 18:03:34,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:03:34,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:34,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2022-04-15 18:03:34,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:34,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2022-04-15 18:03:34,658 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 103 transitions. [2022-04-15 18:03:34,768 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:03:34,777 INFO L225 Difference]: With dead ends: 64 [2022-04-15 18:03:34,777 INFO L226 Difference]: Without dead ends: 49 [2022-04-15 18:03:34,780 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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 18:03:34,783 INFO L913 BasicCegarLoop]: 56 mSDtfsCounter, 106 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 18:03:34,784 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 65 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 18:03:34,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-15 18:03:34,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 35. [2022-04-15 18:03:34,814 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:03:34,815 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 35 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 31 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:34,816 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 35 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 31 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:34,816 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 35 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 31 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:34,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:03:34,821 INFO L93 Difference]: Finished difference Result 49 states and 81 transitions. [2022-04-15 18:03:34,821 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 81 transitions. [2022-04-15 18:03:34,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:03:34,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:03:34,822 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 31 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 49 states. [2022-04-15 18:03:34,823 INFO L87 Difference]: Start difference. First operand has 35 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 31 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 49 states. [2022-04-15 18:03:34,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:03:34,827 INFO L93 Difference]: Finished difference Result 49 states and 81 transitions. [2022-04-15 18:03:34,827 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 81 transitions. [2022-04-15 18:03:34,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:03:34,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:03:34,828 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:03:34,828 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:03:34,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 31 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:34,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 58 transitions. [2022-04-15 18:03:34,832 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 58 transitions. Word has length 17 [2022-04-15 18:03:34,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:03:34,833 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 58 transitions. [2022-04-15 18:03:34,833 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:34,833 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 58 transitions. [2022-04-15 18:03:34,889 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 18:03:34,889 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 58 transitions. [2022-04-15 18:03:34,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 18:03:34,890 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:03:34,890 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:03:34,890 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 18:03:34,891 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:03:34,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:03:34,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1867356637, now seen corresponding path program 1 times [2022-04-15 18:03:34,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:03:34,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [459576408] [2022-04-15 18:03:34,893 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:03:34,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1867356637, now seen corresponding path program 2 times [2022-04-15 18:03:34,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:03:34,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552112878] [2022-04-15 18:03:34,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:03:34,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:03:34,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:03:34,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:03:34,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:03:34,945 INFO L290 TraceCheckUtils]: 0: Hoare triple {350#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {344#true} is VALID [2022-04-15 18:03:34,945 INFO L290 TraceCheckUtils]: 1: Hoare triple {344#true} assume true; {344#true} is VALID [2022-04-15 18:03:34,945 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {344#true} {344#true} #132#return; {344#true} is VALID [2022-04-15 18:03:34,946 INFO L272 TraceCheckUtils]: 0: Hoare triple {344#true} call ULTIMATE.init(); {350#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:03:34,946 INFO L290 TraceCheckUtils]: 1: Hoare triple {350#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {344#true} is VALID [2022-04-15 18:03:34,946 INFO L290 TraceCheckUtils]: 2: Hoare triple {344#true} assume true; {344#true} is VALID [2022-04-15 18:03:34,947 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {344#true} {344#true} #132#return; {344#true} is VALID [2022-04-15 18:03:34,947 INFO L272 TraceCheckUtils]: 4: Hoare triple {344#true} call #t~ret11 := main(); {344#true} is VALID [2022-04-15 18:03:34,947 INFO L290 TraceCheckUtils]: 5: Hoare triple {344#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;havoc ~cond~0; {344#true} is VALID [2022-04-15 18:03:34,947 INFO L290 TraceCheckUtils]: 6: Hoare triple {344#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {344#true} is VALID [2022-04-15 18:03:34,947 INFO L290 TraceCheckUtils]: 7: Hoare triple {344#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {344#true} is VALID [2022-04-15 18:03:34,948 INFO L290 TraceCheckUtils]: 8: Hoare triple {344#true} assume !(0 != ~p1~0); {349#(= main_~p1~0 0)} is VALID [2022-04-15 18:03:34,948 INFO L290 TraceCheckUtils]: 9: Hoare triple {349#(= main_~p1~0 0)} assume !(0 != ~p2~0); {349#(= main_~p1~0 0)} is VALID [2022-04-15 18:03:34,949 INFO L290 TraceCheckUtils]: 10: Hoare triple {349#(= main_~p1~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {349#(= main_~p1~0 0)} is VALID [2022-04-15 18:03:34,949 INFO L290 TraceCheckUtils]: 11: Hoare triple {349#(= main_~p1~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {349#(= main_~p1~0 0)} is VALID [2022-04-15 18:03:34,950 INFO L290 TraceCheckUtils]: 12: Hoare triple {349#(= main_~p1~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {349#(= main_~p1~0 0)} is VALID [2022-04-15 18:03:34,950 INFO L290 TraceCheckUtils]: 13: Hoare triple {349#(= main_~p1~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {349#(= main_~p1~0 0)} is VALID [2022-04-15 18:03:34,951 INFO L290 TraceCheckUtils]: 14: Hoare triple {349#(= main_~p1~0 0)} assume 0 != ~p1~0; {345#false} is VALID [2022-04-15 18:03:34,951 INFO L290 TraceCheckUtils]: 15: Hoare triple {345#false} assume 1 != ~lk1~0; {345#false} is VALID [2022-04-15 18:03:34,951 INFO L290 TraceCheckUtils]: 16: Hoare triple {345#false} assume !false; {345#false} is VALID [2022-04-15 18:03:34,952 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 18:03:34,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:03:34,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552112878] [2022-04-15 18:03:34,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552112878] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:03:34,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:03:34,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:03:34,953 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:03:34,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [459576408] [2022-04-15 18:03:34,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [459576408] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:03:34,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:03:34,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:03:34,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900474438] [2022-04-15 18:03:34,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:03:34,954 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 18:03:34,955 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:03:34,955 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:34,968 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 18:03:34,969 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:03:34,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:03:34,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:03:34,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:03:34,970 INFO L87 Difference]: Start difference. First operand 35 states and 58 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:35,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:03:35,130 INFO L93 Difference]: Finished difference Result 78 states and 133 transitions. [2022-04-15 18:03:35,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:03:35,131 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 18:03:35,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:03:35,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:35,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 120 transitions. [2022-04-15 18:03:35,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:35,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 120 transitions. [2022-04-15 18:03:35,136 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 120 transitions. [2022-04-15 18:03:35,225 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:03:35,229 INFO L225 Difference]: With dead ends: 78 [2022-04-15 18:03:35,229 INFO L226 Difference]: Without dead ends: 49 [2022-04-15 18:03:35,230 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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 18:03:35,231 INFO L913 BasicCegarLoop]: 56 mSDtfsCounter, 88 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 18:03:35,232 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 63 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 18:03:35,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-15 18:03:35,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2022-04-15 18:03:35,240 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:03:35,240 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 47 states, 43 states have (on average 1.744186046511628) internal successors, (75), 43 states have internal predecessors, (75), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:35,241 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 47 states, 43 states have (on average 1.744186046511628) internal successors, (75), 43 states have internal predecessors, (75), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:35,241 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 47 states, 43 states have (on average 1.744186046511628) internal successors, (75), 43 states have internal predecessors, (75), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:35,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:03:35,244 INFO L93 Difference]: Finished difference Result 49 states and 79 transitions. [2022-04-15 18:03:35,244 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 79 transitions. [2022-04-15 18:03:35,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:03:35,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:03:35,245 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 43 states have (on average 1.744186046511628) internal successors, (75), 43 states have internal predecessors, (75), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 49 states. [2022-04-15 18:03:35,245 INFO L87 Difference]: Start difference. First operand has 47 states, 43 states have (on average 1.744186046511628) internal successors, (75), 43 states have internal predecessors, (75), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 49 states. [2022-04-15 18:03:35,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:03:35,247 INFO L93 Difference]: Finished difference Result 49 states and 79 transitions. [2022-04-15 18:03:35,247 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 79 transitions. [2022-04-15 18:03:35,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:03:35,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:03:35,248 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:03:35,248 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:03:35,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 43 states have (on average 1.744186046511628) internal successors, (75), 43 states have internal predecessors, (75), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:35,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 78 transitions. [2022-04-15 18:03:35,250 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 78 transitions. Word has length 17 [2022-04-15 18:03:35,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:03:35,251 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 78 transitions. [2022-04-15 18:03:35,251 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:35,251 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 78 transitions. [2022-04-15 18:03:35,328 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:03:35,328 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 78 transitions. [2022-04-15 18:03:35,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 18:03:35,329 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:03:35,329 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:03:35,329 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 18:03:35,330 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:03:35,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:03:35,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1660239210, now seen corresponding path program 1 times [2022-04-15 18:03:35,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:03:35,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1531280483] [2022-04-15 18:03:35,345 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:03:35,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1660239210, now seen corresponding path program 2 times [2022-04-15 18:03:35,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:03:35,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421726227] [2022-04-15 18:03:35,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:03:35,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:03:35,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:03:35,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:03:35,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:03:35,415 INFO L290 TraceCheckUtils]: 0: Hoare triple {710#(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(15, 2);call #Ultimate.allocInit(12, 3); {704#true} is VALID [2022-04-15 18:03:35,415 INFO L290 TraceCheckUtils]: 1: Hoare triple {704#true} assume true; {704#true} is VALID [2022-04-15 18:03:35,416 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {704#true} {704#true} #132#return; {704#true} is VALID [2022-04-15 18:03:35,417 INFO L272 TraceCheckUtils]: 0: Hoare triple {704#true} call ULTIMATE.init(); {710#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:03:35,419 INFO L290 TraceCheckUtils]: 1: Hoare triple {710#(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(15, 2);call #Ultimate.allocInit(12, 3); {704#true} is VALID [2022-04-15 18:03:35,420 INFO L290 TraceCheckUtils]: 2: Hoare triple {704#true} assume true; {704#true} is VALID [2022-04-15 18:03:35,423 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {704#true} {704#true} #132#return; {704#true} is VALID [2022-04-15 18:03:35,423 INFO L272 TraceCheckUtils]: 4: Hoare triple {704#true} call #t~ret11 := main(); {704#true} is VALID [2022-04-15 18:03:35,425 INFO L290 TraceCheckUtils]: 5: Hoare triple {704#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;havoc ~cond~0; {704#true} is VALID [2022-04-15 18:03:35,425 INFO L290 TraceCheckUtils]: 6: Hoare triple {704#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {704#true} is VALID [2022-04-15 18:03:35,426 INFO L290 TraceCheckUtils]: 7: Hoare triple {704#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {704#true} is VALID [2022-04-15 18:03:35,426 INFO L290 TraceCheckUtils]: 8: Hoare triple {704#true} assume 0 != ~p1~0;~lk1~0 := 1; {709#(not (= main_~p1~0 0))} is VALID [2022-04-15 18:03:35,426 INFO L290 TraceCheckUtils]: 9: Hoare triple {709#(not (= main_~p1~0 0))} assume !(0 != ~p2~0); {709#(not (= main_~p1~0 0))} is VALID [2022-04-15 18:03:35,427 INFO L290 TraceCheckUtils]: 10: Hoare triple {709#(not (= main_~p1~0 0))} assume 0 != ~p3~0;~lk3~0 := 1; {709#(not (= main_~p1~0 0))} is VALID [2022-04-15 18:03:35,427 INFO L290 TraceCheckUtils]: 11: Hoare triple {709#(not (= main_~p1~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {709#(not (= main_~p1~0 0))} is VALID [2022-04-15 18:03:35,429 INFO L290 TraceCheckUtils]: 12: Hoare triple {709#(not (= main_~p1~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {709#(not (= main_~p1~0 0))} is VALID [2022-04-15 18:03:35,429 INFO L290 TraceCheckUtils]: 13: Hoare triple {709#(not (= main_~p1~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {709#(not (= main_~p1~0 0))} is VALID [2022-04-15 18:03:35,430 INFO L290 TraceCheckUtils]: 14: Hoare triple {709#(not (= main_~p1~0 0))} assume !(0 != ~p1~0); {705#false} is VALID [2022-04-15 18:03:35,430 INFO L290 TraceCheckUtils]: 15: Hoare triple {705#false} assume 0 != ~p2~0; {705#false} is VALID [2022-04-15 18:03:35,430 INFO L290 TraceCheckUtils]: 16: Hoare triple {705#false} assume 1 != ~lk2~0; {705#false} is VALID [2022-04-15 18:03:35,430 INFO L290 TraceCheckUtils]: 17: Hoare triple {705#false} assume !false; {705#false} is VALID [2022-04-15 18:03:35,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 18:03:35,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:03:35,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421726227] [2022-04-15 18:03:35,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421726227] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:03:35,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:03:35,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:03:35,431 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:03:35,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1531280483] [2022-04-15 18:03:35,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1531280483] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:03:35,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:03:35,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:03:35,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936835791] [2022-04-15 18:03:35,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:03:35,432 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-15 18:03:35,432 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:03:35,432 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:35,443 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 18:03:35,444 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:03:35,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:03:35,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:03:35,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:03:35,444 INFO L87 Difference]: Start difference. First operand 47 states and 78 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:35,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:03:35,551 INFO L93 Difference]: Finished difference Result 73 states and 118 transitions. [2022-04-15 18:03:35,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:03:35,551 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-15 18:03:35,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:03:35,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:35,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2022-04-15 18:03:35,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:35,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2022-04-15 18:03:35,555 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 115 transitions. [2022-04-15 18:03:35,636 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:03:35,638 INFO L225 Difference]: With dead ends: 73 [2022-04-15 18:03:35,638 INFO L226 Difference]: Without dead ends: 52 [2022-04-15 18:03:35,638 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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 18:03:35,639 INFO L913 BasicCegarLoop]: 66 mSDtfsCounter, 79 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 18:03:35,640 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 73 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 18:03:35,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-15 18:03:35,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2022-04-15 18:03:35,647 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:03:35,648 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 50 states, 46 states have (on average 1.673913043478261) internal successors, (77), 46 states have internal predecessors, (77), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:35,648 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 50 states, 46 states have (on average 1.673913043478261) internal successors, (77), 46 states have internal predecessors, (77), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:35,648 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 50 states, 46 states have (on average 1.673913043478261) internal successors, (77), 46 states have internal predecessors, (77), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:35,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:03:35,650 INFO L93 Difference]: Finished difference Result 52 states and 81 transitions. [2022-04-15 18:03:35,651 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 81 transitions. [2022-04-15 18:03:35,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:03:35,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:03:35,651 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 46 states have (on average 1.673913043478261) internal successors, (77), 46 states have internal predecessors, (77), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 52 states. [2022-04-15 18:03:35,652 INFO L87 Difference]: Start difference. First operand has 50 states, 46 states have (on average 1.673913043478261) internal successors, (77), 46 states have internal predecessors, (77), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 52 states. [2022-04-15 18:03:35,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:03:35,654 INFO L93 Difference]: Finished difference Result 52 states and 81 transitions. [2022-04-15 18:03:35,654 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 81 transitions. [2022-04-15 18:03:35,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:03:35,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:03:35,654 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:03:35,655 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:03:35,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 46 states have (on average 1.673913043478261) internal successors, (77), 46 states have internal predecessors, (77), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:35,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 80 transitions. [2022-04-15 18:03:35,657 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 80 transitions. Word has length 18 [2022-04-15 18:03:35,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:03:35,657 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 80 transitions. [2022-04-15 18:03:35,657 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:35,658 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 80 transitions. [2022-04-15 18:03:35,722 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:03:35,722 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 80 transitions. [2022-04-15 18:03:35,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 18:03:35,723 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:03:35,723 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:03:35,723 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 18:03:35,723 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:03:35,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:03:35,724 INFO L85 PathProgramCache]: Analyzing trace with hash -2053266220, now seen corresponding path program 1 times [2022-04-15 18:03:35,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:03:35,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1072300216] [2022-04-15 18:03:35,724 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:03:35,724 INFO L85 PathProgramCache]: Analyzing trace with hash -2053266220, now seen corresponding path program 2 times [2022-04-15 18:03:35,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:03:35,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75231543] [2022-04-15 18:03:35,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:03:35,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:03:35,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:03:35,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:03:35,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:03:35,757 INFO L290 TraceCheckUtils]: 0: Hoare triple {1072#(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(15, 2);call #Ultimate.allocInit(12, 3); {1066#true} is VALID [2022-04-15 18:03:35,757 INFO L290 TraceCheckUtils]: 1: Hoare triple {1066#true} assume true; {1066#true} is VALID [2022-04-15 18:03:35,758 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1066#true} {1066#true} #132#return; {1066#true} is VALID [2022-04-15 18:03:35,758 INFO L272 TraceCheckUtils]: 0: Hoare triple {1066#true} call ULTIMATE.init(); {1072#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:03:35,758 INFO L290 TraceCheckUtils]: 1: Hoare triple {1072#(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(15, 2);call #Ultimate.allocInit(12, 3); {1066#true} is VALID [2022-04-15 18:03:35,758 INFO L290 TraceCheckUtils]: 2: Hoare triple {1066#true} assume true; {1066#true} is VALID [2022-04-15 18:03:35,758 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1066#true} {1066#true} #132#return; {1066#true} is VALID [2022-04-15 18:03:35,759 INFO L272 TraceCheckUtils]: 4: Hoare triple {1066#true} call #t~ret11 := main(); {1066#true} is VALID [2022-04-15 18:03:35,759 INFO L290 TraceCheckUtils]: 5: Hoare triple {1066#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;havoc ~cond~0; {1066#true} is VALID [2022-04-15 18:03:35,759 INFO L290 TraceCheckUtils]: 6: Hoare triple {1066#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {1066#true} is VALID [2022-04-15 18:03:35,759 INFO L290 TraceCheckUtils]: 7: Hoare triple {1066#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {1066#true} is VALID [2022-04-15 18:03:35,759 INFO L290 TraceCheckUtils]: 8: Hoare triple {1066#true} assume !(0 != ~p1~0); {1066#true} is VALID [2022-04-15 18:03:35,760 INFO L290 TraceCheckUtils]: 9: Hoare triple {1066#true} assume !(0 != ~p2~0); {1071#(= main_~p2~0 0)} is VALID [2022-04-15 18:03:35,760 INFO L290 TraceCheckUtils]: 10: Hoare triple {1071#(= main_~p2~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {1071#(= main_~p2~0 0)} is VALID [2022-04-15 18:03:35,760 INFO L290 TraceCheckUtils]: 11: Hoare triple {1071#(= main_~p2~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {1071#(= main_~p2~0 0)} is VALID [2022-04-15 18:03:35,761 INFO L290 TraceCheckUtils]: 12: Hoare triple {1071#(= main_~p2~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {1071#(= main_~p2~0 0)} is VALID [2022-04-15 18:03:35,761 INFO L290 TraceCheckUtils]: 13: Hoare triple {1071#(= main_~p2~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {1071#(= main_~p2~0 0)} is VALID [2022-04-15 18:03:35,761 INFO L290 TraceCheckUtils]: 14: Hoare triple {1071#(= main_~p2~0 0)} assume !(0 != ~p1~0); {1071#(= main_~p2~0 0)} is VALID [2022-04-15 18:03:35,761 INFO L290 TraceCheckUtils]: 15: Hoare triple {1071#(= main_~p2~0 0)} assume 0 != ~p2~0; {1067#false} is VALID [2022-04-15 18:03:35,762 INFO L290 TraceCheckUtils]: 16: Hoare triple {1067#false} assume 1 != ~lk2~0; {1067#false} is VALID [2022-04-15 18:03:35,762 INFO L290 TraceCheckUtils]: 17: Hoare triple {1067#false} assume !false; {1067#false} is VALID [2022-04-15 18:03:35,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 18:03:35,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:03:35,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75231543] [2022-04-15 18:03:35,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75231543] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:03:35,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:03:35,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:03:35,763 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:03:35,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1072300216] [2022-04-15 18:03:35,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1072300216] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:03:35,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:03:35,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:03:35,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413875548] [2022-04-15 18:03:35,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:03:35,764 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-15 18:03:35,764 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:03:35,764 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:35,774 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 18:03:35,775 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:03:35,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:03:35,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:03:35,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:03:35,776 INFO L87 Difference]: Start difference. First operand 50 states and 80 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:35,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:03:35,882 INFO L93 Difference]: Finished difference Result 130 states and 216 transitions. [2022-04-15 18:03:35,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:03:35,882 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-15 18:03:35,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:03:35,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:35,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions. [2022-04-15 18:03:35,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:35,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions. [2022-04-15 18:03:35,886 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 118 transitions. [2022-04-15 18:03:35,955 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:03:35,957 INFO L225 Difference]: With dead ends: 130 [2022-04-15 18:03:35,957 INFO L226 Difference]: Without dead ends: 89 [2022-04-15 18:03:35,958 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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 18:03:35,958 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 95 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 18:03:35,959 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 55 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 18:03:35,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-04-15 18:03:35,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2022-04-15 18:03:35,969 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:03:35,969 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand has 87 states, 83 states have (on average 1.6626506024096386) internal successors, (138), 83 states have internal predecessors, (138), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:35,969 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand has 87 states, 83 states have (on average 1.6626506024096386) internal successors, (138), 83 states have internal predecessors, (138), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:35,970 INFO L87 Difference]: Start difference. First operand 89 states. Second operand has 87 states, 83 states have (on average 1.6626506024096386) internal successors, (138), 83 states have internal predecessors, (138), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:35,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:03:35,972 INFO L93 Difference]: Finished difference Result 89 states and 142 transitions. [2022-04-15 18:03:35,973 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 142 transitions. [2022-04-15 18:03:35,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:03:35,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:03:35,973 INFO L74 IsIncluded]: Start isIncluded. First operand has 87 states, 83 states have (on average 1.6626506024096386) internal successors, (138), 83 states have internal predecessors, (138), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 89 states. [2022-04-15 18:03:35,974 INFO L87 Difference]: Start difference. First operand has 87 states, 83 states have (on average 1.6626506024096386) internal successors, (138), 83 states have internal predecessors, (138), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 89 states. [2022-04-15 18:03:35,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:03:35,976 INFO L93 Difference]: Finished difference Result 89 states and 142 transitions. [2022-04-15 18:03:35,977 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 142 transitions. [2022-04-15 18:03:35,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:03:35,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:03:35,977 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:03:35,977 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:03:35,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 83 states have (on average 1.6626506024096386) internal successors, (138), 83 states have internal predecessors, (138), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:35,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 141 transitions. [2022-04-15 18:03:35,980 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 141 transitions. Word has length 18 [2022-04-15 18:03:35,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:03:35,980 INFO L478 AbstractCegarLoop]: Abstraction has 87 states and 141 transitions. [2022-04-15 18:03:35,980 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:35,980 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 87 states and 141 transitions. [2022-04-15 18:03:36,095 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:03:36,095 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 141 transitions. [2022-04-15 18:03:36,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 18:03:36,096 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:03:36,096 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:03:36,096 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 18:03:36,096 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:03:36,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:03:36,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1561642706, now seen corresponding path program 1 times [2022-04-15 18:03:36,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:03:36,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1085080493] [2022-04-15 18:03:36,097 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:03:36,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1561642706, now seen corresponding path program 2 times [2022-04-15 18:03:36,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:03:36,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663075679] [2022-04-15 18:03:36,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:03:36,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:03:36,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:03:36,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:03:36,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:03:36,132 INFO L290 TraceCheckUtils]: 0: Hoare triple {1696#(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(15, 2);call #Ultimate.allocInit(12, 3); {1690#true} is VALID [2022-04-15 18:03:36,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {1690#true} assume true; {1690#true} is VALID [2022-04-15 18:03:36,132 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1690#true} {1690#true} #132#return; {1690#true} is VALID [2022-04-15 18:03:36,133 INFO L272 TraceCheckUtils]: 0: Hoare triple {1690#true} call ULTIMATE.init(); {1696#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:03:36,133 INFO L290 TraceCheckUtils]: 1: Hoare triple {1696#(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(15, 2);call #Ultimate.allocInit(12, 3); {1690#true} is VALID [2022-04-15 18:03:36,133 INFO L290 TraceCheckUtils]: 2: Hoare triple {1690#true} assume true; {1690#true} is VALID [2022-04-15 18:03:36,133 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1690#true} {1690#true} #132#return; {1690#true} is VALID [2022-04-15 18:03:36,133 INFO L272 TraceCheckUtils]: 4: Hoare triple {1690#true} call #t~ret11 := main(); {1690#true} is VALID [2022-04-15 18:03:36,134 INFO L290 TraceCheckUtils]: 5: Hoare triple {1690#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;havoc ~cond~0; {1690#true} is VALID [2022-04-15 18:03:36,134 INFO L290 TraceCheckUtils]: 6: Hoare triple {1690#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {1690#true} is VALID [2022-04-15 18:03:36,134 INFO L290 TraceCheckUtils]: 7: Hoare triple {1690#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {1690#true} is VALID [2022-04-15 18:03:36,134 INFO L290 TraceCheckUtils]: 8: Hoare triple {1690#true} assume !(0 != ~p1~0); {1690#true} is VALID [2022-04-15 18:03:36,134 INFO L290 TraceCheckUtils]: 9: Hoare triple {1690#true} assume 0 != ~p2~0;~lk2~0 := 1; {1695#(= main_~lk2~0 1)} is VALID [2022-04-15 18:03:36,135 INFO L290 TraceCheckUtils]: 10: Hoare triple {1695#(= main_~lk2~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {1695#(= main_~lk2~0 1)} is VALID [2022-04-15 18:03:36,135 INFO L290 TraceCheckUtils]: 11: Hoare triple {1695#(= main_~lk2~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {1695#(= main_~lk2~0 1)} is VALID [2022-04-15 18:03:36,136 INFO L290 TraceCheckUtils]: 12: Hoare triple {1695#(= main_~lk2~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {1695#(= main_~lk2~0 1)} is VALID [2022-04-15 18:03:36,136 INFO L290 TraceCheckUtils]: 13: Hoare triple {1695#(= main_~lk2~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {1695#(= main_~lk2~0 1)} is VALID [2022-04-15 18:03:36,136 INFO L290 TraceCheckUtils]: 14: Hoare triple {1695#(= main_~lk2~0 1)} assume !(0 != ~p1~0); {1695#(= main_~lk2~0 1)} is VALID [2022-04-15 18:03:36,137 INFO L290 TraceCheckUtils]: 15: Hoare triple {1695#(= main_~lk2~0 1)} assume 0 != ~p2~0; {1695#(= main_~lk2~0 1)} is VALID [2022-04-15 18:03:36,137 INFO L290 TraceCheckUtils]: 16: Hoare triple {1695#(= main_~lk2~0 1)} assume 1 != ~lk2~0; {1691#false} is VALID [2022-04-15 18:03:36,137 INFO L290 TraceCheckUtils]: 17: Hoare triple {1691#false} assume !false; {1691#false} is VALID [2022-04-15 18:03:36,137 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 18:03:36,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:03:36,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663075679] [2022-04-15 18:03:36,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663075679] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:03:36,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:03:36,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:03:36,138 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:03:36,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1085080493] [2022-04-15 18:03:36,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1085080493] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:03:36,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:03:36,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:03:36,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321177192] [2022-04-15 18:03:36,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:03:36,139 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-15 18:03:36,139 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:03:36,139 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:36,149 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 18:03:36,149 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:03:36,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:03:36,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:03:36,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:03:36,149 INFO L87 Difference]: Start difference. First operand 87 states and 141 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:36,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:03:36,239 INFO L93 Difference]: Finished difference Result 111 states and 179 transitions. [2022-04-15 18:03:36,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:03:36,239 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-15 18:03:36,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:03:36,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:36,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2022-04-15 18:03:36,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:36,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2022-04-15 18:03:36,241 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 76 transitions. [2022-04-15 18:03:36,287 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:03:36,289 INFO L225 Difference]: With dead ends: 111 [2022-04-15 18:03:36,290 INFO L226 Difference]: Without dead ends: 109 [2022-04-15 18:03:36,290 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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 18:03:36,291 INFO L913 BasicCegarLoop]: 73 mSDtfsCounter, 62 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 18:03:36,291 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 80 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 18:03:36,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-04-15 18:03:36,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 87. [2022-04-15 18:03:36,301 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:03:36,302 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand has 87 states, 83 states have (on average 1.6385542168674698) internal successors, (136), 83 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:36,302 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand has 87 states, 83 states have (on average 1.6385542168674698) internal successors, (136), 83 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:36,302 INFO L87 Difference]: Start difference. First operand 109 states. Second operand has 87 states, 83 states have (on average 1.6385542168674698) internal successors, (136), 83 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:36,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:03:36,305 INFO L93 Difference]: Finished difference Result 109 states and 176 transitions. [2022-04-15 18:03:36,305 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 176 transitions. [2022-04-15 18:03:36,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:03:36,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:03:36,306 INFO L74 IsIncluded]: Start isIncluded. First operand has 87 states, 83 states have (on average 1.6385542168674698) internal successors, (136), 83 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 109 states. [2022-04-15 18:03:36,306 INFO L87 Difference]: Start difference. First operand has 87 states, 83 states have (on average 1.6385542168674698) internal successors, (136), 83 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 109 states. [2022-04-15 18:03:36,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:03:36,309 INFO L93 Difference]: Finished difference Result 109 states and 176 transitions. [2022-04-15 18:03:36,309 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 176 transitions. [2022-04-15 18:03:36,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:03:36,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:03:36,309 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:03:36,309 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:03:36,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 83 states have (on average 1.6385542168674698) internal successors, (136), 83 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:36,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 139 transitions. [2022-04-15 18:03:36,311 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 139 transitions. Word has length 18 [2022-04-15 18:03:36,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:03:36,312 INFO L478 AbstractCegarLoop]: Abstraction has 87 states and 139 transitions. [2022-04-15 18:03:36,312 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:36,312 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 87 states and 139 transitions. [2022-04-15 18:03:36,405 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:03:36,405 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 139 transitions. [2022-04-15 18:03:36,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 18:03:36,406 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:03:36,406 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:03:36,406 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 18:03:36,406 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:03:36,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:03:36,406 INFO L85 PathProgramCache]: Analyzing trace with hash 773471640, now seen corresponding path program 1 times [2022-04-15 18:03:36,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:03:36,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [980453089] [2022-04-15 18:03:36,407 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:03:36,407 INFO L85 PathProgramCache]: Analyzing trace with hash 773471640, now seen corresponding path program 2 times [2022-04-15 18:03:36,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:03:36,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066471894] [2022-04-15 18:03:36,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:03:36,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:03:36,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:03:36,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:03:36,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:03:36,459 INFO L290 TraceCheckUtils]: 0: Hoare triple {2322#(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(15, 2);call #Ultimate.allocInit(12, 3); {2316#true} is VALID [2022-04-15 18:03:36,459 INFO L290 TraceCheckUtils]: 1: Hoare triple {2316#true} assume true; {2316#true} is VALID [2022-04-15 18:03:36,459 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2316#true} {2316#true} #132#return; {2316#true} is VALID [2022-04-15 18:03:36,459 INFO L272 TraceCheckUtils]: 0: Hoare triple {2316#true} call ULTIMATE.init(); {2322#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:03:36,460 INFO L290 TraceCheckUtils]: 1: Hoare triple {2322#(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(15, 2);call #Ultimate.allocInit(12, 3); {2316#true} is VALID [2022-04-15 18:03:36,460 INFO L290 TraceCheckUtils]: 2: Hoare triple {2316#true} assume true; {2316#true} is VALID [2022-04-15 18:03:36,460 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2316#true} {2316#true} #132#return; {2316#true} is VALID [2022-04-15 18:03:36,460 INFO L272 TraceCheckUtils]: 4: Hoare triple {2316#true} call #t~ret11 := main(); {2316#true} is VALID [2022-04-15 18:03:36,460 INFO L290 TraceCheckUtils]: 5: Hoare triple {2316#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;havoc ~cond~0; {2316#true} is VALID [2022-04-15 18:03:36,460 INFO L290 TraceCheckUtils]: 6: Hoare triple {2316#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {2316#true} is VALID [2022-04-15 18:03:36,460 INFO L290 TraceCheckUtils]: 7: Hoare triple {2316#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {2316#true} is VALID [2022-04-15 18:03:36,460 INFO L290 TraceCheckUtils]: 8: Hoare triple {2316#true} assume !(0 != ~p1~0); {2316#true} is VALID [2022-04-15 18:03:36,460 INFO L290 TraceCheckUtils]: 9: Hoare triple {2316#true} assume !(0 != ~p2~0); {2316#true} is VALID [2022-04-15 18:03:36,461 INFO L290 TraceCheckUtils]: 10: Hoare triple {2316#true} assume 0 != ~p3~0;~lk3~0 := 1; {2321#(= main_~lk3~0 1)} is VALID [2022-04-15 18:03:36,461 INFO L290 TraceCheckUtils]: 11: Hoare triple {2321#(= main_~lk3~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {2321#(= main_~lk3~0 1)} is VALID [2022-04-15 18:03:36,461 INFO L290 TraceCheckUtils]: 12: Hoare triple {2321#(= main_~lk3~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {2321#(= main_~lk3~0 1)} is VALID [2022-04-15 18:03:36,462 INFO L290 TraceCheckUtils]: 13: Hoare triple {2321#(= main_~lk3~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {2321#(= main_~lk3~0 1)} is VALID [2022-04-15 18:03:36,462 INFO L290 TraceCheckUtils]: 14: Hoare triple {2321#(= main_~lk3~0 1)} assume !(0 != ~p1~0); {2321#(= main_~lk3~0 1)} is VALID [2022-04-15 18:03:36,462 INFO L290 TraceCheckUtils]: 15: Hoare triple {2321#(= main_~lk3~0 1)} assume !(0 != ~p2~0); {2321#(= main_~lk3~0 1)} is VALID [2022-04-15 18:03:36,462 INFO L290 TraceCheckUtils]: 16: Hoare triple {2321#(= main_~lk3~0 1)} assume 0 != ~p3~0; {2321#(= main_~lk3~0 1)} is VALID [2022-04-15 18:03:36,463 INFO L290 TraceCheckUtils]: 17: Hoare triple {2321#(= main_~lk3~0 1)} assume 1 != ~lk3~0; {2317#false} is VALID [2022-04-15 18:03:36,463 INFO L290 TraceCheckUtils]: 18: Hoare triple {2317#false} assume !false; {2317#false} is VALID [2022-04-15 18:03:36,463 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 18:03:36,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:03:36,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066471894] [2022-04-15 18:03:36,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066471894] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:03:36,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:03:36,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:03:36,464 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:03:36,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [980453089] [2022-04-15 18:03:36,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [980453089] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:03:36,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:03:36,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:03:36,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240745204] [2022-04-15 18:03:36,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:03:36,464 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 18:03:36,464 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:03:36,464 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:36,474 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 18:03:36,474 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:03:36,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:03:36,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:03:36,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:03:36,475 INFO L87 Difference]: Start difference. First operand 87 states and 139 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:36,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:03:36,565 INFO L93 Difference]: Finished difference Result 155 states and 251 transitions. [2022-04-15 18:03:36,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:03:36,565 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 18:03:36,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:03:36,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:36,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2022-04-15 18:03:36,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:36,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2022-04-15 18:03:36,567 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 75 transitions. [2022-04-15 18:03:36,611 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:03:36,614 INFO L225 Difference]: With dead ends: 155 [2022-04-15 18:03:36,614 INFO L226 Difference]: Without dead ends: 153 [2022-04-15 18:03:36,614 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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 18:03:36,614 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 86 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 18:03:36,615 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 52 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 18:03:36,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-04-15 18:03:36,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 119. [2022-04-15 18:03:36,625 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:03:36,625 INFO L82 GeneralOperation]: Start isEquivalent. First operand 153 states. Second operand has 119 states, 115 states have (on average 1.617391304347826) internal successors, (186), 115 states have internal predecessors, (186), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:36,625 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand has 119 states, 115 states have (on average 1.617391304347826) internal successors, (186), 115 states have internal predecessors, (186), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:36,626 INFO L87 Difference]: Start difference. First operand 153 states. Second operand has 119 states, 115 states have (on average 1.617391304347826) internal successors, (186), 115 states have internal predecessors, (186), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:36,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:03:36,629 INFO L93 Difference]: Finished difference Result 153 states and 246 transitions. [2022-04-15 18:03:36,629 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 246 transitions. [2022-04-15 18:03:36,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:03:36,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:03:36,629 INFO L74 IsIncluded]: Start isIncluded. First operand has 119 states, 115 states have (on average 1.617391304347826) internal successors, (186), 115 states have internal predecessors, (186), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 153 states. [2022-04-15 18:03:36,630 INFO L87 Difference]: Start difference. First operand has 119 states, 115 states have (on average 1.617391304347826) internal successors, (186), 115 states have internal predecessors, (186), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 153 states. [2022-04-15 18:03:36,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:03:36,633 INFO L93 Difference]: Finished difference Result 153 states and 246 transitions. [2022-04-15 18:03:36,633 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 246 transitions. [2022-04-15 18:03:36,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:03:36,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:03:36,633 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:03:36,633 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:03:36,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 115 states have (on average 1.617391304347826) internal successors, (186), 115 states have internal predecessors, (186), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:36,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 189 transitions. [2022-04-15 18:03:36,636 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 189 transitions. Word has length 19 [2022-04-15 18:03:36,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:03:36,637 INFO L478 AbstractCegarLoop]: Abstraction has 119 states and 189 transitions. [2022-04-15 18:03:36,637 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:36,637 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 119 states and 189 transitions. [2022-04-15 18:03:36,786 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 189 edges. 189 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:03:36,787 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 189 transitions. [2022-04-15 18:03:36,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 18:03:36,787 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:03:36,787 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:03:36,787 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 18:03:36,787 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:03:36,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:03:36,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1453530010, now seen corresponding path program 1 times [2022-04-15 18:03:36,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:03:36,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2144356924] [2022-04-15 18:03:36,788 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:03:36,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1453530010, now seen corresponding path program 2 times [2022-04-15 18:03:36,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:03:36,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989356373] [2022-04-15 18:03:36,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:03:36,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:03:36,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:03:36,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:03:36,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:03:36,813 INFO L290 TraceCheckUtils]: 0: Hoare triple {3188#(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(15, 2);call #Ultimate.allocInit(12, 3); {3182#true} is VALID [2022-04-15 18:03:36,813 INFO L290 TraceCheckUtils]: 1: Hoare triple {3182#true} assume true; {3182#true} is VALID [2022-04-15 18:03:36,813 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3182#true} {3182#true} #132#return; {3182#true} is VALID [2022-04-15 18:03:36,814 INFO L272 TraceCheckUtils]: 0: Hoare triple {3182#true} call ULTIMATE.init(); {3188#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:03:36,814 INFO L290 TraceCheckUtils]: 1: Hoare triple {3188#(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(15, 2);call #Ultimate.allocInit(12, 3); {3182#true} is VALID [2022-04-15 18:03:36,814 INFO L290 TraceCheckUtils]: 2: Hoare triple {3182#true} assume true; {3182#true} is VALID [2022-04-15 18:03:36,814 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3182#true} {3182#true} #132#return; {3182#true} is VALID [2022-04-15 18:03:36,814 INFO L272 TraceCheckUtils]: 4: Hoare triple {3182#true} call #t~ret11 := main(); {3182#true} is VALID [2022-04-15 18:03:36,814 INFO L290 TraceCheckUtils]: 5: Hoare triple {3182#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;havoc ~cond~0; {3182#true} is VALID [2022-04-15 18:03:36,814 INFO L290 TraceCheckUtils]: 6: Hoare triple {3182#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {3182#true} is VALID [2022-04-15 18:03:36,815 INFO L290 TraceCheckUtils]: 7: Hoare triple {3182#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {3182#true} is VALID [2022-04-15 18:03:36,815 INFO L290 TraceCheckUtils]: 8: Hoare triple {3182#true} assume !(0 != ~p1~0); {3182#true} is VALID [2022-04-15 18:03:36,815 INFO L290 TraceCheckUtils]: 9: Hoare triple {3182#true} assume !(0 != ~p2~0); {3182#true} is VALID [2022-04-15 18:03:36,815 INFO L290 TraceCheckUtils]: 10: Hoare triple {3182#true} assume !(0 != ~p3~0); {3187#(= main_~p3~0 0)} is VALID [2022-04-15 18:03:36,815 INFO L290 TraceCheckUtils]: 11: Hoare triple {3187#(= main_~p3~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {3187#(= main_~p3~0 0)} is VALID [2022-04-15 18:03:36,816 INFO L290 TraceCheckUtils]: 12: Hoare triple {3187#(= main_~p3~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {3187#(= main_~p3~0 0)} is VALID [2022-04-15 18:03:36,816 INFO L290 TraceCheckUtils]: 13: Hoare triple {3187#(= main_~p3~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {3187#(= main_~p3~0 0)} is VALID [2022-04-15 18:03:36,816 INFO L290 TraceCheckUtils]: 14: Hoare triple {3187#(= main_~p3~0 0)} assume !(0 != ~p1~0); {3187#(= main_~p3~0 0)} is VALID [2022-04-15 18:03:36,816 INFO L290 TraceCheckUtils]: 15: Hoare triple {3187#(= main_~p3~0 0)} assume !(0 != ~p2~0); {3187#(= main_~p3~0 0)} is VALID [2022-04-15 18:03:36,817 INFO L290 TraceCheckUtils]: 16: Hoare triple {3187#(= main_~p3~0 0)} assume 0 != ~p3~0; {3183#false} is VALID [2022-04-15 18:03:36,817 INFO L290 TraceCheckUtils]: 17: Hoare triple {3183#false} assume 1 != ~lk3~0; {3183#false} is VALID [2022-04-15 18:03:36,817 INFO L290 TraceCheckUtils]: 18: Hoare triple {3183#false} assume !false; {3183#false} is VALID [2022-04-15 18:03:36,817 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 18:03:36,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:03:36,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989356373] [2022-04-15 18:03:36,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989356373] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:03:36,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:03:36,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:03:36,817 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:03:36,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2144356924] [2022-04-15 18:03:36,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2144356924] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:03:36,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:03:36,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:03:36,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637171447] [2022-04-15 18:03:36,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:03:36,818 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 18:03:36,818 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:03:36,818 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:36,828 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 18:03:36,828 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:03:36,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:03:36,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:03:36,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:03:36,828 INFO L87 Difference]: Start difference. First operand 119 states and 189 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:36,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:03:36,932 INFO L93 Difference]: Finished difference Result 271 states and 435 transitions. [2022-04-15 18:03:36,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:03:36,932 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 18:03:36,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:03:36,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:36,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2022-04-15 18:03:36,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:36,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2022-04-15 18:03:36,935 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 114 transitions. [2022-04-15 18:03:37,012 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:03:37,015 INFO L225 Difference]: With dead ends: 271 [2022-04-15 18:03:37,015 INFO L226 Difference]: Without dead ends: 161 [2022-04-15 18:03:37,016 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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 18:03:37,016 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 76 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 18:03:37,016 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 67 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 18:03:37,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-04-15 18:03:37,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 159. [2022-04-15 18:03:37,028 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:03:37,028 INFO L82 GeneralOperation]: Start isEquivalent. First operand 161 states. Second operand has 159 states, 155 states have (on average 1.5741935483870968) internal successors, (244), 155 states have internal predecessors, (244), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:37,029 INFO L74 IsIncluded]: Start isIncluded. First operand 161 states. Second operand has 159 states, 155 states have (on average 1.5741935483870968) internal successors, (244), 155 states have internal predecessors, (244), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:37,029 INFO L87 Difference]: Start difference. First operand 161 states. Second operand has 159 states, 155 states have (on average 1.5741935483870968) internal successors, (244), 155 states have internal predecessors, (244), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:37,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:03:37,032 INFO L93 Difference]: Finished difference Result 161 states and 248 transitions. [2022-04-15 18:03:37,033 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 248 transitions. [2022-04-15 18:03:37,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:03:37,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:03:37,033 INFO L74 IsIncluded]: Start isIncluded. First operand has 159 states, 155 states have (on average 1.5741935483870968) internal successors, (244), 155 states have internal predecessors, (244), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 161 states. [2022-04-15 18:03:37,033 INFO L87 Difference]: Start difference. First operand has 159 states, 155 states have (on average 1.5741935483870968) internal successors, (244), 155 states have internal predecessors, (244), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 161 states. [2022-04-15 18:03:37,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:03:37,037 INFO L93 Difference]: Finished difference Result 161 states and 248 transitions. [2022-04-15 18:03:37,037 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 248 transitions. [2022-04-15 18:03:37,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:03:37,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:03:37,037 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:03:37,037 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:03:37,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 155 states have (on average 1.5741935483870968) internal successors, (244), 155 states have internal predecessors, (244), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:37,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 247 transitions. [2022-04-15 18:03:37,041 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 247 transitions. Word has length 19 [2022-04-15 18:03:37,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:03:37,041 INFO L478 AbstractCegarLoop]: Abstraction has 159 states and 247 transitions. [2022-04-15 18:03:37,042 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:37,042 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 159 states and 247 transitions. [2022-04-15 18:03:37,249 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 247 edges. 247 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:03:37,249 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 247 transitions. [2022-04-15 18:03:37,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 18:03:37,249 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:03:37,249 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:03:37,250 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-15 18:03:37,250 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:03:37,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:03:37,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1791967575, now seen corresponding path program 1 times [2022-04-15 18:03:37,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:03:37,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [366788423] [2022-04-15 18:03:37,250 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:03:37,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1791967575, now seen corresponding path program 2 times [2022-04-15 18:03:37,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:03:37,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091916527] [2022-04-15 18:03:37,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:03:37,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:03:37,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:03:37,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:03:37,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:03:37,279 INFO L290 TraceCheckUtils]: 0: Hoare triple {4382#(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(15, 2);call #Ultimate.allocInit(12, 3); {4376#true} is VALID [2022-04-15 18:03:37,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {4376#true} assume true; {4376#true} is VALID [2022-04-15 18:03:37,279 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4376#true} {4376#true} #132#return; {4376#true} is VALID [2022-04-15 18:03:37,280 INFO L272 TraceCheckUtils]: 0: Hoare triple {4376#true} call ULTIMATE.init(); {4382#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:03:37,280 INFO L290 TraceCheckUtils]: 1: Hoare triple {4382#(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(15, 2);call #Ultimate.allocInit(12, 3); {4376#true} is VALID [2022-04-15 18:03:37,280 INFO L290 TraceCheckUtils]: 2: Hoare triple {4376#true} assume true; {4376#true} is VALID [2022-04-15 18:03:37,280 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4376#true} {4376#true} #132#return; {4376#true} is VALID [2022-04-15 18:03:37,280 INFO L272 TraceCheckUtils]: 4: Hoare triple {4376#true} call #t~ret11 := main(); {4376#true} is VALID [2022-04-15 18:03:37,280 INFO L290 TraceCheckUtils]: 5: Hoare triple {4376#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;havoc ~cond~0; {4376#true} is VALID [2022-04-15 18:03:37,280 INFO L290 TraceCheckUtils]: 6: Hoare triple {4376#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {4376#true} is VALID [2022-04-15 18:03:37,281 INFO L290 TraceCheckUtils]: 7: Hoare triple {4376#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {4376#true} is VALID [2022-04-15 18:03:37,281 INFO L290 TraceCheckUtils]: 8: Hoare triple {4376#true} assume !(0 != ~p1~0); {4376#true} is VALID [2022-04-15 18:03:37,281 INFO L290 TraceCheckUtils]: 9: Hoare triple {4376#true} assume !(0 != ~p2~0); {4376#true} is VALID [2022-04-15 18:03:37,281 INFO L290 TraceCheckUtils]: 10: Hoare triple {4376#true} assume 0 != ~p3~0;~lk3~0 := 1; {4381#(not (= main_~p3~0 0))} is VALID [2022-04-15 18:03:37,281 INFO L290 TraceCheckUtils]: 11: Hoare triple {4381#(not (= main_~p3~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {4381#(not (= main_~p3~0 0))} is VALID [2022-04-15 18:03:37,282 INFO L290 TraceCheckUtils]: 12: Hoare triple {4381#(not (= main_~p3~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {4381#(not (= main_~p3~0 0))} is VALID [2022-04-15 18:03:37,282 INFO L290 TraceCheckUtils]: 13: Hoare triple {4381#(not (= main_~p3~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {4381#(not (= main_~p3~0 0))} is VALID [2022-04-15 18:03:37,282 INFO L290 TraceCheckUtils]: 14: Hoare triple {4381#(not (= main_~p3~0 0))} assume !(0 != ~p1~0); {4381#(not (= main_~p3~0 0))} is VALID [2022-04-15 18:03:37,283 INFO L290 TraceCheckUtils]: 15: Hoare triple {4381#(not (= main_~p3~0 0))} assume !(0 != ~p2~0); {4381#(not (= main_~p3~0 0))} is VALID [2022-04-15 18:03:37,283 INFO L290 TraceCheckUtils]: 16: Hoare triple {4381#(not (= main_~p3~0 0))} assume !(0 != ~p3~0); {4377#false} is VALID [2022-04-15 18:03:37,283 INFO L290 TraceCheckUtils]: 17: Hoare triple {4377#false} assume 0 != ~p4~0; {4377#false} is VALID [2022-04-15 18:03:37,283 INFO L290 TraceCheckUtils]: 18: Hoare triple {4377#false} assume 1 != ~lk4~0; {4377#false} is VALID [2022-04-15 18:03:37,283 INFO L290 TraceCheckUtils]: 19: Hoare triple {4377#false} assume !false; {4377#false} is VALID [2022-04-15 18:03:37,284 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 18:03:37,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:03:37,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091916527] [2022-04-15 18:03:37,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091916527] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:03:37,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:03:37,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:03:37,284 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:03:37,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [366788423] [2022-04-15 18:03:37,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [366788423] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:03:37,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:03:37,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:03:37,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248618064] [2022-04-15 18:03:37,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:03:37,285 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-15 18:03:37,286 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:03:37,286 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:37,299 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 18:03:37,299 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:03:37,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:03:37,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:03:37,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:03:37,300 INFO L87 Difference]: Start difference. First operand 159 states and 247 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:37,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:03:37,403 INFO L93 Difference]: Finished difference Result 241 states and 373 transitions. [2022-04-15 18:03:37,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:03:37,403 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-15 18:03:37,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:03:37,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:37,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2022-04-15 18:03:37,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:37,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2022-04-15 18:03:37,406 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 109 transitions. [2022-04-15 18:03:37,467 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:03:37,469 INFO L225 Difference]: With dead ends: 241 [2022-04-15 18:03:37,469 INFO L226 Difference]: Without dead ends: 167 [2022-04-15 18:03:37,471 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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 18:03:37,472 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 77 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 18:03:37,472 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 67 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 18:03:37,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-04-15 18:03:37,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2022-04-15 18:03:37,486 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:03:37,486 INFO L82 GeneralOperation]: Start isEquivalent. First operand 167 states. Second operand has 165 states, 161 states have (on average 1.5403726708074534) internal successors, (248), 161 states have internal predecessors, (248), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:37,487 INFO L74 IsIncluded]: Start isIncluded. First operand 167 states. Second operand has 165 states, 161 states have (on average 1.5403726708074534) internal successors, (248), 161 states have internal predecessors, (248), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:37,491 INFO L87 Difference]: Start difference. First operand 167 states. Second operand has 165 states, 161 states have (on average 1.5403726708074534) internal successors, (248), 161 states have internal predecessors, (248), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:37,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:03:37,504 INFO L93 Difference]: Finished difference Result 167 states and 252 transitions. [2022-04-15 18:03:37,505 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 252 transitions. [2022-04-15 18:03:37,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:03:37,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:03:37,506 INFO L74 IsIncluded]: Start isIncluded. First operand has 165 states, 161 states have (on average 1.5403726708074534) internal successors, (248), 161 states have internal predecessors, (248), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 167 states. [2022-04-15 18:03:37,506 INFO L87 Difference]: Start difference. First operand has 165 states, 161 states have (on average 1.5403726708074534) internal successors, (248), 161 states have internal predecessors, (248), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 167 states. [2022-04-15 18:03:37,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:03:37,509 INFO L93 Difference]: Finished difference Result 167 states and 252 transitions. [2022-04-15 18:03:37,509 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 252 transitions. [2022-04-15 18:03:37,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:03:37,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:03:37,509 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:03:37,509 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:03:37,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 161 states have (on average 1.5403726708074534) internal successors, (248), 161 states have internal predecessors, (248), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:37,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 251 transitions. [2022-04-15 18:03:37,512 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 251 transitions. Word has length 20 [2022-04-15 18:03:37,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:03:37,512 INFO L478 AbstractCegarLoop]: Abstraction has 165 states and 251 transitions. [2022-04-15 18:03:37,512 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:37,512 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 165 states and 251 transitions. [2022-04-15 18:03:37,729 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 251 edges. 251 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:03:37,729 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 251 transitions. [2022-04-15 18:03:37,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 18:03:37,730 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:03:37,730 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:03:37,730 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-15 18:03:37,730 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:03:37,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:03:37,730 INFO L85 PathProgramCache]: Analyzing trace with hash 2109972711, now seen corresponding path program 1 times [2022-04-15 18:03:37,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:03:37,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [561149497] [2022-04-15 18:03:37,731 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:03:37,731 INFO L85 PathProgramCache]: Analyzing trace with hash 2109972711, now seen corresponding path program 2 times [2022-04-15 18:03:37,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:03:37,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920691225] [2022-04-15 18:03:37,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:03:37,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:03:37,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:03:37,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:03:37,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:03:37,786 INFO L290 TraceCheckUtils]: 0: Hoare triple {5540#(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(15, 2);call #Ultimate.allocInit(12, 3); {5534#true} is VALID [2022-04-15 18:03:37,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {5534#true} assume true; {5534#true} is VALID [2022-04-15 18:03:37,787 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5534#true} {5534#true} #132#return; {5534#true} is VALID [2022-04-15 18:03:37,788 INFO L272 TraceCheckUtils]: 0: Hoare triple {5534#true} call ULTIMATE.init(); {5540#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:03:37,788 INFO L290 TraceCheckUtils]: 1: Hoare triple {5540#(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(15, 2);call #Ultimate.allocInit(12, 3); {5534#true} is VALID [2022-04-15 18:03:37,788 INFO L290 TraceCheckUtils]: 2: Hoare triple {5534#true} assume true; {5534#true} is VALID [2022-04-15 18:03:37,788 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5534#true} {5534#true} #132#return; {5534#true} is VALID [2022-04-15 18:03:37,788 INFO L272 TraceCheckUtils]: 4: Hoare triple {5534#true} call #t~ret11 := main(); {5534#true} is VALID [2022-04-15 18:03:37,789 INFO L290 TraceCheckUtils]: 5: Hoare triple {5534#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;havoc ~cond~0; {5534#true} is VALID [2022-04-15 18:03:37,789 INFO L290 TraceCheckUtils]: 6: Hoare triple {5534#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {5534#true} is VALID [2022-04-15 18:03:37,789 INFO L290 TraceCheckUtils]: 7: Hoare triple {5534#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {5534#true} is VALID [2022-04-15 18:03:37,790 INFO L290 TraceCheckUtils]: 8: Hoare triple {5534#true} assume !(0 != ~p1~0); {5534#true} is VALID [2022-04-15 18:03:37,790 INFO L290 TraceCheckUtils]: 9: Hoare triple {5534#true} assume !(0 != ~p2~0); {5534#true} is VALID [2022-04-15 18:03:37,790 INFO L290 TraceCheckUtils]: 10: Hoare triple {5534#true} assume !(0 != ~p3~0); {5534#true} is VALID [2022-04-15 18:03:37,791 INFO L290 TraceCheckUtils]: 11: Hoare triple {5534#true} assume 0 != ~p4~0;~lk4~0 := 1; {5539#(= main_~lk4~0 1)} is VALID [2022-04-15 18:03:37,793 INFO L290 TraceCheckUtils]: 12: Hoare triple {5539#(= main_~lk4~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {5539#(= main_~lk4~0 1)} is VALID [2022-04-15 18:03:37,793 INFO L290 TraceCheckUtils]: 13: Hoare triple {5539#(= main_~lk4~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {5539#(= main_~lk4~0 1)} is VALID [2022-04-15 18:03:37,793 INFO L290 TraceCheckUtils]: 14: Hoare triple {5539#(= main_~lk4~0 1)} assume !(0 != ~p1~0); {5539#(= main_~lk4~0 1)} is VALID [2022-04-15 18:03:37,794 INFO L290 TraceCheckUtils]: 15: Hoare triple {5539#(= main_~lk4~0 1)} assume !(0 != ~p2~0); {5539#(= main_~lk4~0 1)} is VALID [2022-04-15 18:03:37,794 INFO L290 TraceCheckUtils]: 16: Hoare triple {5539#(= main_~lk4~0 1)} assume !(0 != ~p3~0); {5539#(= main_~lk4~0 1)} is VALID [2022-04-15 18:03:37,794 INFO L290 TraceCheckUtils]: 17: Hoare triple {5539#(= main_~lk4~0 1)} assume 0 != ~p4~0; {5539#(= main_~lk4~0 1)} is VALID [2022-04-15 18:03:37,794 INFO L290 TraceCheckUtils]: 18: Hoare triple {5539#(= main_~lk4~0 1)} assume 1 != ~lk4~0; {5535#false} is VALID [2022-04-15 18:03:37,795 INFO L290 TraceCheckUtils]: 19: Hoare triple {5535#false} assume !false; {5535#false} is VALID [2022-04-15 18:03:37,795 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 18:03:37,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:03:37,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920691225] [2022-04-15 18:03:37,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920691225] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:03:37,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:03:37,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:03:37,795 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:03:37,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [561149497] [2022-04-15 18:03:37,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [561149497] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:03:37,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:03:37,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:03:37,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147475111] [2022-04-15 18:03:37,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:03:37,796 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-15 18:03:37,796 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:03:37,796 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:37,805 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 18:03:37,805 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:03:37,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:03:37,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:03:37,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:03:37,806 INFO L87 Difference]: Start difference. First operand 165 states and 251 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:37,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:03:37,898 INFO L93 Difference]: Finished difference Result 285 states and 437 transitions. [2022-04-15 18:03:37,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:03:37,898 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-15 18:03:37,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:03:37,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:37,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2022-04-15 18:03:37,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:37,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2022-04-15 18:03:37,900 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 71 transitions. [2022-04-15 18:03:37,938 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:03:37,942 INFO L225 Difference]: With dead ends: 285 [2022-04-15 18:03:37,942 INFO L226 Difference]: Without dead ends: 283 [2022-04-15 18:03:37,943 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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 18:03:37,945 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 79 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 18:03:37,945 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 51 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 18:03:37,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2022-04-15 18:03:37,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 233. [2022-04-15 18:03:37,960 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:03:37,961 INFO L82 GeneralOperation]: Start isEquivalent. First operand 283 states. Second operand has 233 states, 229 states have (on average 1.502183406113537) internal successors, (344), 229 states have internal predecessors, (344), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:37,961 INFO L74 IsIncluded]: Start isIncluded. First operand 283 states. Second operand has 233 states, 229 states have (on average 1.502183406113537) internal successors, (344), 229 states have internal predecessors, (344), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:37,961 INFO L87 Difference]: Start difference. First operand 283 states. Second operand has 233 states, 229 states have (on average 1.502183406113537) internal successors, (344), 229 states have internal predecessors, (344), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:37,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:03:37,966 INFO L93 Difference]: Finished difference Result 283 states and 428 transitions. [2022-04-15 18:03:37,966 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 428 transitions. [2022-04-15 18:03:37,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:03:37,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:03:37,967 INFO L74 IsIncluded]: Start isIncluded. First operand has 233 states, 229 states have (on average 1.502183406113537) internal successors, (344), 229 states have internal predecessors, (344), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 283 states. [2022-04-15 18:03:37,967 INFO L87 Difference]: Start difference. First operand has 233 states, 229 states have (on average 1.502183406113537) internal successors, (344), 229 states have internal predecessors, (344), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 283 states. [2022-04-15 18:03:37,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:03:37,974 INFO L93 Difference]: Finished difference Result 283 states and 428 transitions. [2022-04-15 18:03:37,974 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 428 transitions. [2022-04-15 18:03:37,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:03:37,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:03:37,975 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:03:37,975 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:03:37,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 229 states have (on average 1.502183406113537) internal successors, (344), 229 states have internal predecessors, (344), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:37,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 347 transitions. [2022-04-15 18:03:37,982 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 347 transitions. Word has length 20 [2022-04-15 18:03:37,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:03:37,982 INFO L478 AbstractCegarLoop]: Abstraction has 233 states and 347 transitions. [2022-04-15 18:03:37,982 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:37,982 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 233 states and 347 transitions. [2022-04-15 18:03:38,298 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 347 edges. 347 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:03:38,298 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 347 transitions. [2022-04-15 18:03:38,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 18:03:38,299 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:03:38,299 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:03:38,299 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-15 18:03:38,299 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:03:38,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:03:38,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1504936215, now seen corresponding path program 1 times [2022-04-15 18:03:38,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:03:38,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1859092671] [2022-04-15 18:03:38,300 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:03:38,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1504936215, now seen corresponding path program 2 times [2022-04-15 18:03:38,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:03:38,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056201093] [2022-04-15 18:03:38,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:03:38,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:03:38,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:03:38,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:03:38,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:03:38,326 INFO L290 TraceCheckUtils]: 0: Hoare triple {7154#(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(15, 2);call #Ultimate.allocInit(12, 3); {7148#true} is VALID [2022-04-15 18:03:38,326 INFO L290 TraceCheckUtils]: 1: Hoare triple {7148#true} assume true; {7148#true} is VALID [2022-04-15 18:03:38,326 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7148#true} {7148#true} #132#return; {7148#true} is VALID [2022-04-15 18:03:38,327 INFO L272 TraceCheckUtils]: 0: Hoare triple {7148#true} call ULTIMATE.init(); {7154#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:03:38,327 INFO L290 TraceCheckUtils]: 1: Hoare triple {7154#(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(15, 2);call #Ultimate.allocInit(12, 3); {7148#true} is VALID [2022-04-15 18:03:38,327 INFO L290 TraceCheckUtils]: 2: Hoare triple {7148#true} assume true; {7148#true} is VALID [2022-04-15 18:03:38,327 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7148#true} {7148#true} #132#return; {7148#true} is VALID [2022-04-15 18:03:38,327 INFO L272 TraceCheckUtils]: 4: Hoare triple {7148#true} call #t~ret11 := main(); {7148#true} is VALID [2022-04-15 18:03:38,327 INFO L290 TraceCheckUtils]: 5: Hoare triple {7148#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;havoc ~cond~0; {7148#true} is VALID [2022-04-15 18:03:38,327 INFO L290 TraceCheckUtils]: 6: Hoare triple {7148#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {7148#true} is VALID [2022-04-15 18:03:38,327 INFO L290 TraceCheckUtils]: 7: Hoare triple {7148#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {7148#true} is VALID [2022-04-15 18:03:38,327 INFO L290 TraceCheckUtils]: 8: Hoare triple {7148#true} assume !(0 != ~p1~0); {7148#true} is VALID [2022-04-15 18:03:38,327 INFO L290 TraceCheckUtils]: 9: Hoare triple {7148#true} assume !(0 != ~p2~0); {7148#true} is VALID [2022-04-15 18:03:38,327 INFO L290 TraceCheckUtils]: 10: Hoare triple {7148#true} assume !(0 != ~p3~0); {7148#true} is VALID [2022-04-15 18:03:38,328 INFO L290 TraceCheckUtils]: 11: Hoare triple {7148#true} assume !(0 != ~p4~0); {7153#(= main_~p4~0 0)} is VALID [2022-04-15 18:03:38,328 INFO L290 TraceCheckUtils]: 12: Hoare triple {7153#(= main_~p4~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {7153#(= main_~p4~0 0)} is VALID [2022-04-15 18:03:38,328 INFO L290 TraceCheckUtils]: 13: Hoare triple {7153#(= main_~p4~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {7153#(= main_~p4~0 0)} is VALID [2022-04-15 18:03:38,328 INFO L290 TraceCheckUtils]: 14: Hoare triple {7153#(= main_~p4~0 0)} assume !(0 != ~p1~0); {7153#(= main_~p4~0 0)} is VALID [2022-04-15 18:03:38,329 INFO L290 TraceCheckUtils]: 15: Hoare triple {7153#(= main_~p4~0 0)} assume !(0 != ~p2~0); {7153#(= main_~p4~0 0)} is VALID [2022-04-15 18:03:38,329 INFO L290 TraceCheckUtils]: 16: Hoare triple {7153#(= main_~p4~0 0)} assume !(0 != ~p3~0); {7153#(= main_~p4~0 0)} is VALID [2022-04-15 18:03:38,329 INFO L290 TraceCheckUtils]: 17: Hoare triple {7153#(= main_~p4~0 0)} assume 0 != ~p4~0; {7149#false} is VALID [2022-04-15 18:03:38,329 INFO L290 TraceCheckUtils]: 18: Hoare triple {7149#false} assume 1 != ~lk4~0; {7149#false} is VALID [2022-04-15 18:03:38,329 INFO L290 TraceCheckUtils]: 19: Hoare triple {7149#false} assume !false; {7149#false} is VALID [2022-04-15 18:03:38,330 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 18:03:38,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:03:38,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056201093] [2022-04-15 18:03:38,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056201093] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:03:38,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:03:38,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:03:38,330 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:03:38,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1859092671] [2022-04-15 18:03:38,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1859092671] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:03:38,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:03:38,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:03:38,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986624192] [2022-04-15 18:03:38,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:03:38,331 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-15 18:03:38,331 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:03:38,331 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:38,341 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 18:03:38,341 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:03:38,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:03:38,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:03:38,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:03:38,341 INFO L87 Difference]: Start difference. First operand 233 states and 347 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:38,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:03:38,447 INFO L93 Difference]: Finished difference Result 525 states and 781 transitions. [2022-04-15 18:03:38,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:03:38,447 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-15 18:03:38,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:03:38,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:38,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2022-04-15 18:03:38,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:38,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2022-04-15 18:03:38,450 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 111 transitions. [2022-04-15 18:03:38,515 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:03:38,520 INFO L225 Difference]: With dead ends: 525 [2022-04-15 18:03:38,520 INFO L226 Difference]: Without dead ends: 307 [2022-04-15 18:03:38,521 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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 18:03:38,521 INFO L913 BasicCegarLoop]: 62 mSDtfsCounter, 70 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 18:03:38,521 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 69 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 18:03:38,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2022-04-15 18:03:38,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 305. [2022-04-15 18:03:38,536 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:03:38,537 INFO L82 GeneralOperation]: Start isEquivalent. First operand 307 states. Second operand has 305 states, 301 states have (on average 1.4485049833887043) internal successors, (436), 301 states have internal predecessors, (436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:38,537 INFO L74 IsIncluded]: Start isIncluded. First operand 307 states. Second operand has 305 states, 301 states have (on average 1.4485049833887043) internal successors, (436), 301 states have internal predecessors, (436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:38,537 INFO L87 Difference]: Start difference. First operand 307 states. Second operand has 305 states, 301 states have (on average 1.4485049833887043) internal successors, (436), 301 states have internal predecessors, (436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:38,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:03:38,542 INFO L93 Difference]: Finished difference Result 307 states and 440 transitions. [2022-04-15 18:03:38,542 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 440 transitions. [2022-04-15 18:03:38,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:03:38,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:03:38,543 INFO L74 IsIncluded]: Start isIncluded. First operand has 305 states, 301 states have (on average 1.4485049833887043) internal successors, (436), 301 states have internal predecessors, (436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 307 states. [2022-04-15 18:03:38,543 INFO L87 Difference]: Start difference. First operand has 305 states, 301 states have (on average 1.4485049833887043) internal successors, (436), 301 states have internal predecessors, (436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 307 states. [2022-04-15 18:03:38,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:03:38,548 INFO L93 Difference]: Finished difference Result 307 states and 440 transitions. [2022-04-15 18:03:38,548 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 440 transitions. [2022-04-15 18:03:38,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:03:38,548 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:03:38,548 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:03:38,548 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:03:38,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 301 states have (on average 1.4485049833887043) internal successors, (436), 301 states have internal predecessors, (436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:38,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 439 transitions. [2022-04-15 18:03:38,554 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 439 transitions. Word has length 20 [2022-04-15 18:03:38,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:03:38,554 INFO L478 AbstractCegarLoop]: Abstraction has 305 states and 439 transitions. [2022-04-15 18:03:38,554 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:38,554 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 305 states and 439 transitions. [2022-04-15 18:03:38,932 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 439 edges. 439 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:03:38,932 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 439 transitions. [2022-04-15 18:03:38,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 18:03:38,932 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:03:38,932 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:03:38,933 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-15 18:03:38,933 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:03:38,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:03:38,933 INFO L85 PathProgramCache]: Analyzing trace with hash 984860303, now seen corresponding path program 1 times [2022-04-15 18:03:38,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:03:38,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2134273775] [2022-04-15 18:03:38,933 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:03:38,933 INFO L85 PathProgramCache]: Analyzing trace with hash 984860303, now seen corresponding path program 2 times [2022-04-15 18:03:38,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:03:38,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28150109] [2022-04-15 18:03:38,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:03:38,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:03:38,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:03:38,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:03:38,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:03:38,992 INFO L290 TraceCheckUtils]: 0: Hoare triple {9440#(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(15, 2);call #Ultimate.allocInit(12, 3); {9434#true} is VALID [2022-04-15 18:03:38,992 INFO L290 TraceCheckUtils]: 1: Hoare triple {9434#true} assume true; {9434#true} is VALID [2022-04-15 18:03:38,992 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9434#true} {9434#true} #132#return; {9434#true} is VALID [2022-04-15 18:03:38,992 INFO L272 TraceCheckUtils]: 0: Hoare triple {9434#true} call ULTIMATE.init(); {9440#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:03:38,992 INFO L290 TraceCheckUtils]: 1: Hoare triple {9440#(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(15, 2);call #Ultimate.allocInit(12, 3); {9434#true} is VALID [2022-04-15 18:03:38,992 INFO L290 TraceCheckUtils]: 2: Hoare triple {9434#true} assume true; {9434#true} is VALID [2022-04-15 18:03:38,993 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9434#true} {9434#true} #132#return; {9434#true} is VALID [2022-04-15 18:03:38,993 INFO L272 TraceCheckUtils]: 4: Hoare triple {9434#true} call #t~ret11 := main(); {9434#true} is VALID [2022-04-15 18:03:38,993 INFO L290 TraceCheckUtils]: 5: Hoare triple {9434#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;havoc ~cond~0; {9434#true} is VALID [2022-04-15 18:03:38,993 INFO L290 TraceCheckUtils]: 6: Hoare triple {9434#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {9434#true} is VALID [2022-04-15 18:03:38,993 INFO L290 TraceCheckUtils]: 7: Hoare triple {9434#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {9434#true} is VALID [2022-04-15 18:03:38,993 INFO L290 TraceCheckUtils]: 8: Hoare triple {9434#true} assume !(0 != ~p1~0); {9434#true} is VALID [2022-04-15 18:03:38,993 INFO L290 TraceCheckUtils]: 9: Hoare triple {9434#true} assume !(0 != ~p2~0); {9434#true} is VALID [2022-04-15 18:03:38,993 INFO L290 TraceCheckUtils]: 10: Hoare triple {9434#true} assume !(0 != ~p3~0); {9434#true} is VALID [2022-04-15 18:03:38,993 INFO L290 TraceCheckUtils]: 11: Hoare triple {9434#true} assume 0 != ~p4~0;~lk4~0 := 1; {9439#(not (= main_~p4~0 0))} is VALID [2022-04-15 18:03:38,994 INFO L290 TraceCheckUtils]: 12: Hoare triple {9439#(not (= main_~p4~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {9439#(not (= main_~p4~0 0))} is VALID [2022-04-15 18:03:38,994 INFO L290 TraceCheckUtils]: 13: Hoare triple {9439#(not (= main_~p4~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {9439#(not (= main_~p4~0 0))} is VALID [2022-04-15 18:03:38,994 INFO L290 TraceCheckUtils]: 14: Hoare triple {9439#(not (= main_~p4~0 0))} assume !(0 != ~p1~0); {9439#(not (= main_~p4~0 0))} is VALID [2022-04-15 18:03:38,995 INFO L290 TraceCheckUtils]: 15: Hoare triple {9439#(not (= main_~p4~0 0))} assume !(0 != ~p2~0); {9439#(not (= main_~p4~0 0))} is VALID [2022-04-15 18:03:38,995 INFO L290 TraceCheckUtils]: 16: Hoare triple {9439#(not (= main_~p4~0 0))} assume !(0 != ~p3~0); {9439#(not (= main_~p4~0 0))} is VALID [2022-04-15 18:03:38,995 INFO L290 TraceCheckUtils]: 17: Hoare triple {9439#(not (= main_~p4~0 0))} assume !(0 != ~p4~0); {9435#false} is VALID [2022-04-15 18:03:38,995 INFO L290 TraceCheckUtils]: 18: Hoare triple {9435#false} assume 0 != ~p5~0; {9435#false} is VALID [2022-04-15 18:03:38,995 INFO L290 TraceCheckUtils]: 19: Hoare triple {9435#false} assume 1 != ~lk5~0; {9435#false} is VALID [2022-04-15 18:03:38,995 INFO L290 TraceCheckUtils]: 20: Hoare triple {9435#false} assume !false; {9435#false} is VALID [2022-04-15 18:03:38,995 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 18:03:38,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:03:38,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28150109] [2022-04-15 18:03:38,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28150109] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:03:38,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:03:38,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:03:38,996 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:03:38,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2134273775] [2022-04-15 18:03:38,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2134273775] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:03:38,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:03:38,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:03:38,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476039936] [2022-04-15 18:03:38,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:03:38,996 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-15 18:03:38,997 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:03:38,997 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:39,007 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 18:03:39,007 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:03:39,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:03:39,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:03:39,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:03:39,008 INFO L87 Difference]: Start difference. First operand 305 states and 439 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:39,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:03:39,112 INFO L93 Difference]: Finished difference Result 457 states and 653 transitions. [2022-04-15 18:03:39,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:03:39,112 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-15 18:03:39,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:03:39,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:39,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2022-04-15 18:03:39,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:39,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2022-04-15 18:03:39,114 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 106 transitions. [2022-04-15 18:03:39,174 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:03:39,178 INFO L225 Difference]: With dead ends: 457 [2022-04-15 18:03:39,178 INFO L226 Difference]: Without dead ends: 315 [2022-04-15 18:03:39,179 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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 18:03:39,180 INFO L913 BasicCegarLoop]: 57 mSDtfsCounter, 76 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 18:03:39,180 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 64 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 18:03:39,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2022-04-15 18:03:39,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 313. [2022-04-15 18:03:39,198 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:03:39,199 INFO L82 GeneralOperation]: Start isEquivalent. First operand 315 states. Second operand has 313 states, 309 states have (on average 1.4110032362459546) internal successors, (436), 309 states have internal predecessors, (436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:39,199 INFO L74 IsIncluded]: Start isIncluded. First operand 315 states. Second operand has 313 states, 309 states have (on average 1.4110032362459546) internal successors, (436), 309 states have internal predecessors, (436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:39,200 INFO L87 Difference]: Start difference. First operand 315 states. Second operand has 313 states, 309 states have (on average 1.4110032362459546) internal successors, (436), 309 states have internal predecessors, (436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:39,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:03:39,206 INFO L93 Difference]: Finished difference Result 315 states and 440 transitions. [2022-04-15 18:03:39,207 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 440 transitions. [2022-04-15 18:03:39,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:03:39,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:03:39,208 INFO L74 IsIncluded]: Start isIncluded. First operand has 313 states, 309 states have (on average 1.4110032362459546) internal successors, (436), 309 states have internal predecessors, (436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 315 states. [2022-04-15 18:03:39,208 INFO L87 Difference]: Start difference. First operand has 313 states, 309 states have (on average 1.4110032362459546) internal successors, (436), 309 states have internal predecessors, (436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 315 states. [2022-04-15 18:03:39,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:03:39,214 INFO L93 Difference]: Finished difference Result 315 states and 440 transitions. [2022-04-15 18:03:39,215 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 440 transitions. [2022-04-15 18:03:39,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:03:39,215 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:03:39,215 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:03:39,215 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:03:39,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 309 states have (on average 1.4110032362459546) internal successors, (436), 309 states have internal predecessors, (436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:39,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 439 transitions. [2022-04-15 18:03:39,223 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 439 transitions. Word has length 21 [2022-04-15 18:03:39,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:03:39,223 INFO L478 AbstractCegarLoop]: Abstraction has 313 states and 439 transitions. [2022-04-15 18:03:39,223 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:39,224 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 313 states and 439 transitions. [2022-04-15 18:03:39,622 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 439 edges. 439 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:03:39,622 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 439 transitions. [2022-04-15 18:03:39,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 18:03:39,623 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:03:39,623 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:03:39,623 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-15 18:03:39,623 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:03:39,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:03:39,624 INFO L85 PathProgramCache]: Analyzing trace with hash 591833293, now seen corresponding path program 1 times [2022-04-15 18:03:39,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:03:39,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1034730866] [2022-04-15 18:03:39,624 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:03:39,624 INFO L85 PathProgramCache]: Analyzing trace with hash 591833293, now seen corresponding path program 2 times [2022-04-15 18:03:39,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:03:39,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695880559] [2022-04-15 18:03:39,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:03:39,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:03:39,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:03:39,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:03:39,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:03:39,654 INFO L290 TraceCheckUtils]: 0: Hoare triple {11622#(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(15, 2);call #Ultimate.allocInit(12, 3); {11616#true} is VALID [2022-04-15 18:03:39,654 INFO L290 TraceCheckUtils]: 1: Hoare triple {11616#true} assume true; {11616#true} is VALID [2022-04-15 18:03:39,654 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11616#true} {11616#true} #132#return; {11616#true} is VALID [2022-04-15 18:03:39,654 INFO L272 TraceCheckUtils]: 0: Hoare triple {11616#true} call ULTIMATE.init(); {11622#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:03:39,655 INFO L290 TraceCheckUtils]: 1: Hoare triple {11622#(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(15, 2);call #Ultimate.allocInit(12, 3); {11616#true} is VALID [2022-04-15 18:03:39,655 INFO L290 TraceCheckUtils]: 2: Hoare triple {11616#true} assume true; {11616#true} is VALID [2022-04-15 18:03:39,655 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11616#true} {11616#true} #132#return; {11616#true} is VALID [2022-04-15 18:03:39,655 INFO L272 TraceCheckUtils]: 4: Hoare triple {11616#true} call #t~ret11 := main(); {11616#true} is VALID [2022-04-15 18:03:39,655 INFO L290 TraceCheckUtils]: 5: Hoare triple {11616#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;havoc ~cond~0; {11616#true} is VALID [2022-04-15 18:03:39,655 INFO L290 TraceCheckUtils]: 6: Hoare triple {11616#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {11616#true} is VALID [2022-04-15 18:03:39,655 INFO L290 TraceCheckUtils]: 7: Hoare triple {11616#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {11616#true} is VALID [2022-04-15 18:03:39,655 INFO L290 TraceCheckUtils]: 8: Hoare triple {11616#true} assume !(0 != ~p1~0); {11616#true} is VALID [2022-04-15 18:03:39,655 INFO L290 TraceCheckUtils]: 9: Hoare triple {11616#true} assume !(0 != ~p2~0); {11616#true} is VALID [2022-04-15 18:03:39,655 INFO L290 TraceCheckUtils]: 10: Hoare triple {11616#true} assume !(0 != ~p3~0); {11616#true} is VALID [2022-04-15 18:03:39,655 INFO L290 TraceCheckUtils]: 11: Hoare triple {11616#true} assume !(0 != ~p4~0); {11616#true} is VALID [2022-04-15 18:03:39,656 INFO L290 TraceCheckUtils]: 12: Hoare triple {11616#true} assume 0 != ~p5~0;~lk5~0 := 1; {11621#(= main_~lk5~0 1)} is VALID [2022-04-15 18:03:39,656 INFO L290 TraceCheckUtils]: 13: Hoare triple {11621#(= main_~lk5~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {11621#(= main_~lk5~0 1)} is VALID [2022-04-15 18:03:39,656 INFO L290 TraceCheckUtils]: 14: Hoare triple {11621#(= main_~lk5~0 1)} assume !(0 != ~p1~0); {11621#(= main_~lk5~0 1)} is VALID [2022-04-15 18:03:39,656 INFO L290 TraceCheckUtils]: 15: Hoare triple {11621#(= main_~lk5~0 1)} assume !(0 != ~p2~0); {11621#(= main_~lk5~0 1)} is VALID [2022-04-15 18:03:39,657 INFO L290 TraceCheckUtils]: 16: Hoare triple {11621#(= main_~lk5~0 1)} assume !(0 != ~p3~0); {11621#(= main_~lk5~0 1)} is VALID [2022-04-15 18:03:39,657 INFO L290 TraceCheckUtils]: 17: Hoare triple {11621#(= main_~lk5~0 1)} assume !(0 != ~p4~0); {11621#(= main_~lk5~0 1)} is VALID [2022-04-15 18:03:39,657 INFO L290 TraceCheckUtils]: 18: Hoare triple {11621#(= main_~lk5~0 1)} assume 0 != ~p5~0; {11621#(= main_~lk5~0 1)} is VALID [2022-04-15 18:03:39,657 INFO L290 TraceCheckUtils]: 19: Hoare triple {11621#(= main_~lk5~0 1)} assume 1 != ~lk5~0; {11617#false} is VALID [2022-04-15 18:03:39,657 INFO L290 TraceCheckUtils]: 20: Hoare triple {11617#false} assume !false; {11617#false} is VALID [2022-04-15 18:03:39,658 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 18:03:39,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:03:39,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695880559] [2022-04-15 18:03:39,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695880559] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:03:39,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:03:39,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:03:39,658 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:03:39,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1034730866] [2022-04-15 18:03:39,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1034730866] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:03:39,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:03:39,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:03:39,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170855403] [2022-04-15 18:03:39,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:03:39,659 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-15 18:03:39,659 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:03:39,659 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:39,668 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 18:03:39,669 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:03:39,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:03:39,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:03:39,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:03:39,669 INFO L87 Difference]: Start difference. First operand 313 states and 439 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:39,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:03:39,783 INFO L93 Difference]: Finished difference Result 525 states and 737 transitions. [2022-04-15 18:03:39,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:03:39,784 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-15 18:03:39,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:03:39,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:39,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2022-04-15 18:03:39,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:39,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2022-04-15 18:03:39,785 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 67 transitions. [2022-04-15 18:03:39,821 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 18:03:39,833 INFO L225 Difference]: With dead ends: 525 [2022-04-15 18:03:39,833 INFO L226 Difference]: Without dead ends: 523 [2022-04-15 18:03:39,833 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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 18:03:39,834 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 72 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 18:03:39,834 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 50 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 18:03:39,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2022-04-15 18:03:39,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 457. [2022-04-15 18:03:39,858 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:03:39,859 INFO L82 GeneralOperation]: Start isEquivalent. First operand 523 states. Second operand has 457 states, 453 states have (on average 1.3686534216335542) internal successors, (620), 453 states have internal predecessors, (620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:39,859 INFO L74 IsIncluded]: Start isIncluded. First operand 523 states. Second operand has 457 states, 453 states have (on average 1.3686534216335542) internal successors, (620), 453 states have internal predecessors, (620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:39,860 INFO L87 Difference]: Start difference. First operand 523 states. Second operand has 457 states, 453 states have (on average 1.3686534216335542) internal successors, (620), 453 states have internal predecessors, (620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:39,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:03:39,869 INFO L93 Difference]: Finished difference Result 523 states and 720 transitions. [2022-04-15 18:03:39,869 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 720 transitions. [2022-04-15 18:03:39,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:03:39,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:03:39,871 INFO L74 IsIncluded]: Start isIncluded. First operand has 457 states, 453 states have (on average 1.3686534216335542) internal successors, (620), 453 states have internal predecessors, (620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 523 states. [2022-04-15 18:03:39,871 INFO L87 Difference]: Start difference. First operand has 457 states, 453 states have (on average 1.3686534216335542) internal successors, (620), 453 states have internal predecessors, (620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 523 states. [2022-04-15 18:03:39,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:03:39,881 INFO L93 Difference]: Finished difference Result 523 states and 720 transitions. [2022-04-15 18:03:39,881 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 720 transitions. [2022-04-15 18:03:39,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:03:39,882 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:03:39,882 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:03:39,882 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:03:39,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 453 states have (on average 1.3686534216335542) internal successors, (620), 453 states have internal predecessors, (620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:39,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 623 transitions. [2022-04-15 18:03:39,893 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 623 transitions. Word has length 21 [2022-04-15 18:03:39,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:03:39,893 INFO L478 AbstractCegarLoop]: Abstraction has 457 states and 623 transitions. [2022-04-15 18:03:39,893 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:39,893 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 457 states and 623 transitions. [2022-04-15 18:03:40,501 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 623 edges. 623 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:03:40,502 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 623 transitions. [2022-04-15 18:03:40,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 18:03:40,503 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:03:40,503 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:03:40,503 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-15 18:03:40,503 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:03:40,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:03:40,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1271891663, now seen corresponding path program 1 times [2022-04-15 18:03:40,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:03:40,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1530861515] [2022-04-15 18:03:40,504 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:03:40,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1271891663, now seen corresponding path program 2 times [2022-04-15 18:03:40,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:03:40,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520123233] [2022-04-15 18:03:40,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:03:40,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:03:40,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:03:40,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:03:40,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:03:40,552 INFO L290 TraceCheckUtils]: 0: Hoare triple {14644#(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(15, 2);call #Ultimate.allocInit(12, 3); {14638#true} is VALID [2022-04-15 18:03:40,552 INFO L290 TraceCheckUtils]: 1: Hoare triple {14638#true} assume true; {14638#true} is VALID [2022-04-15 18:03:40,552 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14638#true} {14638#true} #132#return; {14638#true} is VALID [2022-04-15 18:03:40,552 INFO L272 TraceCheckUtils]: 0: Hoare triple {14638#true} call ULTIMATE.init(); {14644#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:03:40,552 INFO L290 TraceCheckUtils]: 1: Hoare triple {14644#(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(15, 2);call #Ultimate.allocInit(12, 3); {14638#true} is VALID [2022-04-15 18:03:40,553 INFO L290 TraceCheckUtils]: 2: Hoare triple {14638#true} assume true; {14638#true} is VALID [2022-04-15 18:03:40,553 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14638#true} {14638#true} #132#return; {14638#true} is VALID [2022-04-15 18:03:40,553 INFO L272 TraceCheckUtils]: 4: Hoare triple {14638#true} call #t~ret11 := main(); {14638#true} is VALID [2022-04-15 18:03:40,554 INFO L290 TraceCheckUtils]: 5: Hoare triple {14638#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;havoc ~cond~0; {14638#true} is VALID [2022-04-15 18:03:40,554 INFO L290 TraceCheckUtils]: 6: Hoare triple {14638#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {14638#true} is VALID [2022-04-15 18:03:40,555 INFO L290 TraceCheckUtils]: 7: Hoare triple {14638#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {14638#true} is VALID [2022-04-15 18:03:40,555 INFO L290 TraceCheckUtils]: 8: Hoare triple {14638#true} assume !(0 != ~p1~0); {14638#true} is VALID [2022-04-15 18:03:40,555 INFO L290 TraceCheckUtils]: 9: Hoare triple {14638#true} assume !(0 != ~p2~0); {14638#true} is VALID [2022-04-15 18:03:40,555 INFO L290 TraceCheckUtils]: 10: Hoare triple {14638#true} assume !(0 != ~p3~0); {14638#true} is VALID [2022-04-15 18:03:40,555 INFO L290 TraceCheckUtils]: 11: Hoare triple {14638#true} assume !(0 != ~p4~0); {14638#true} is VALID [2022-04-15 18:03:40,556 INFO L290 TraceCheckUtils]: 12: Hoare triple {14638#true} assume !(0 != ~p5~0); {14643#(= main_~p5~0 0)} is VALID [2022-04-15 18:03:40,556 INFO L290 TraceCheckUtils]: 13: Hoare triple {14643#(= main_~p5~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {14643#(= main_~p5~0 0)} is VALID [2022-04-15 18:03:40,556 INFO L290 TraceCheckUtils]: 14: Hoare triple {14643#(= main_~p5~0 0)} assume !(0 != ~p1~0); {14643#(= main_~p5~0 0)} is VALID [2022-04-15 18:03:40,557 INFO L290 TraceCheckUtils]: 15: Hoare triple {14643#(= main_~p5~0 0)} assume !(0 != ~p2~0); {14643#(= main_~p5~0 0)} is VALID [2022-04-15 18:03:40,557 INFO L290 TraceCheckUtils]: 16: Hoare triple {14643#(= main_~p5~0 0)} assume !(0 != ~p3~0); {14643#(= main_~p5~0 0)} is VALID [2022-04-15 18:03:40,557 INFO L290 TraceCheckUtils]: 17: Hoare triple {14643#(= main_~p5~0 0)} assume !(0 != ~p4~0); {14643#(= main_~p5~0 0)} is VALID [2022-04-15 18:03:40,557 INFO L290 TraceCheckUtils]: 18: Hoare triple {14643#(= main_~p5~0 0)} assume 0 != ~p5~0; {14639#false} is VALID [2022-04-15 18:03:40,558 INFO L290 TraceCheckUtils]: 19: Hoare triple {14639#false} assume 1 != ~lk5~0; {14639#false} is VALID [2022-04-15 18:03:40,558 INFO L290 TraceCheckUtils]: 20: Hoare triple {14639#false} assume !false; {14639#false} is VALID [2022-04-15 18:03:40,559 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 18:03:40,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:03:40,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520123233] [2022-04-15 18:03:40,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520123233] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:03:40,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:03:40,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:03:40,560 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:03:40,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1530861515] [2022-04-15 18:03:40,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1530861515] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:03:40,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:03:40,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:03:40,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672726387] [2022-04-15 18:03:40,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:03:40,561 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-15 18:03:40,562 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:03:40,562 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:40,573 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 18:03:40,573 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:03:40,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:03:40,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:03:40,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:03:40,574 INFO L87 Difference]: Start difference. First operand 457 states and 623 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:40,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:03:40,725 INFO L93 Difference]: Finished difference Result 1021 states and 1377 transitions. [2022-04-15 18:03:40,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:03:40,725 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-15 18:03:40,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:03:40,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:40,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2022-04-15 18:03:40,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:40,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2022-04-15 18:03:40,727 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 108 transitions. [2022-04-15 18:03:40,785 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:03:40,800 INFO L225 Difference]: With dead ends: 1021 [2022-04-15 18:03:40,800 INFO L226 Difference]: Without dead ends: 587 [2022-04-15 18:03:40,801 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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 18:03:40,801 INFO L913 BasicCegarLoop]: 64 mSDtfsCounter, 64 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 18:03:40,802 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 71 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 18:03:40,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2022-04-15 18:03:40,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 585. [2022-04-15 18:03:40,847 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:03:40,848 INFO L82 GeneralOperation]: Start isEquivalent. First operand 587 states. Second operand has 585 states, 581 states have (on average 1.3012048192771084) internal successors, (756), 581 states have internal predecessors, (756), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:40,849 INFO L74 IsIncluded]: Start isIncluded. First operand 587 states. Second operand has 585 states, 581 states have (on average 1.3012048192771084) internal successors, (756), 581 states have internal predecessors, (756), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:40,849 INFO L87 Difference]: Start difference. First operand 587 states. Second operand has 585 states, 581 states have (on average 1.3012048192771084) internal successors, (756), 581 states have internal predecessors, (756), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:40,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:03:40,861 INFO L93 Difference]: Finished difference Result 587 states and 760 transitions. [2022-04-15 18:03:40,861 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 760 transitions. [2022-04-15 18:03:40,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:03:40,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:03:40,863 INFO L74 IsIncluded]: Start isIncluded. First operand has 585 states, 581 states have (on average 1.3012048192771084) internal successors, (756), 581 states have internal predecessors, (756), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 587 states. [2022-04-15 18:03:40,864 INFO L87 Difference]: Start difference. First operand has 585 states, 581 states have (on average 1.3012048192771084) internal successors, (756), 581 states have internal predecessors, (756), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 587 states. [2022-04-15 18:03:40,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:03:40,875 INFO L93 Difference]: Finished difference Result 587 states and 760 transitions. [2022-04-15 18:03:40,875 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 760 transitions. [2022-04-15 18:03:40,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:03:40,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:03:40,876 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:03:40,876 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:03:40,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 581 states have (on average 1.3012048192771084) internal successors, (756), 581 states have internal predecessors, (756), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:40,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 759 transitions. [2022-04-15 18:03:40,891 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 759 transitions. Word has length 21 [2022-04-15 18:03:40,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:03:40,892 INFO L478 AbstractCegarLoop]: Abstraction has 585 states and 759 transitions. [2022-04-15 18:03:40,892 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:40,892 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 585 states and 759 transitions. [2022-04-15 18:03:41,578 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 759 edges. 759 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:03:41,578 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 759 transitions. [2022-04-15 18:03:41,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 18:03:41,579 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:03:41,579 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:03:41,579 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-15 18:03:41,580 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:03:41,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:03:41,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1167178942, now seen corresponding path program 1 times [2022-04-15 18:03:41,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:03:41,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1984988680] [2022-04-15 18:03:41,580 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:03:41,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1167178942, now seen corresponding path program 2 times [2022-04-15 18:03:41,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:03:41,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060812179] [2022-04-15 18:03:41,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:03:41,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:03:41,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:03:41,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:03:41,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:03:41,628 INFO L290 TraceCheckUtils]: 0: Hoare triple {19042#(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(15, 2);call #Ultimate.allocInit(12, 3); {19036#true} is VALID [2022-04-15 18:03:41,628 INFO L290 TraceCheckUtils]: 1: Hoare triple {19036#true} assume true; {19036#true} is VALID [2022-04-15 18:03:41,628 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19036#true} {19036#true} #132#return; {19036#true} is VALID [2022-04-15 18:03:41,629 INFO L272 TraceCheckUtils]: 0: Hoare triple {19036#true} call ULTIMATE.init(); {19042#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:03:41,629 INFO L290 TraceCheckUtils]: 1: Hoare triple {19042#(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(15, 2);call #Ultimate.allocInit(12, 3); {19036#true} is VALID [2022-04-15 18:03:41,629 INFO L290 TraceCheckUtils]: 2: Hoare triple {19036#true} assume true; {19036#true} is VALID [2022-04-15 18:03:41,629 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19036#true} {19036#true} #132#return; {19036#true} is VALID [2022-04-15 18:03:41,629 INFO L272 TraceCheckUtils]: 4: Hoare triple {19036#true} call #t~ret11 := main(); {19036#true} is VALID [2022-04-15 18:03:41,629 INFO L290 TraceCheckUtils]: 5: Hoare triple {19036#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;havoc ~cond~0; {19036#true} is VALID [2022-04-15 18:03:41,630 INFO L290 TraceCheckUtils]: 6: Hoare triple {19036#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {19036#true} is VALID [2022-04-15 18:03:41,630 INFO L290 TraceCheckUtils]: 7: Hoare triple {19036#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {19036#true} is VALID [2022-04-15 18:03:41,630 INFO L290 TraceCheckUtils]: 8: Hoare triple {19036#true} assume !(0 != ~p1~0); {19036#true} is VALID [2022-04-15 18:03:41,630 INFO L290 TraceCheckUtils]: 9: Hoare triple {19036#true} assume !(0 != ~p2~0); {19036#true} is VALID [2022-04-15 18:03:41,630 INFO L290 TraceCheckUtils]: 10: Hoare triple {19036#true} assume !(0 != ~p3~0); {19036#true} is VALID [2022-04-15 18:03:41,630 INFO L290 TraceCheckUtils]: 11: Hoare triple {19036#true} assume !(0 != ~p4~0); {19036#true} is VALID [2022-04-15 18:03:41,630 INFO L290 TraceCheckUtils]: 12: Hoare triple {19036#true} assume 0 != ~p5~0;~lk5~0 := 1; {19041#(not (= main_~p5~0 0))} is VALID [2022-04-15 18:03:41,632 INFO L290 TraceCheckUtils]: 13: Hoare triple {19041#(not (= main_~p5~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {19041#(not (= main_~p5~0 0))} is VALID [2022-04-15 18:03:41,632 INFO L290 TraceCheckUtils]: 14: Hoare triple {19041#(not (= main_~p5~0 0))} assume !(0 != ~p1~0); {19041#(not (= main_~p5~0 0))} is VALID [2022-04-15 18:03:41,632 INFO L290 TraceCheckUtils]: 15: Hoare triple {19041#(not (= main_~p5~0 0))} assume !(0 != ~p2~0); {19041#(not (= main_~p5~0 0))} is VALID [2022-04-15 18:03:41,633 INFO L290 TraceCheckUtils]: 16: Hoare triple {19041#(not (= main_~p5~0 0))} assume !(0 != ~p3~0); {19041#(not (= main_~p5~0 0))} is VALID [2022-04-15 18:03:41,633 INFO L290 TraceCheckUtils]: 17: Hoare triple {19041#(not (= main_~p5~0 0))} assume !(0 != ~p4~0); {19041#(not (= main_~p5~0 0))} is VALID [2022-04-15 18:03:41,633 INFO L290 TraceCheckUtils]: 18: Hoare triple {19041#(not (= main_~p5~0 0))} assume !(0 != ~p5~0); {19037#false} is VALID [2022-04-15 18:03:41,633 INFO L290 TraceCheckUtils]: 19: Hoare triple {19037#false} assume 0 != ~p6~0; {19037#false} is VALID [2022-04-15 18:03:41,634 INFO L290 TraceCheckUtils]: 20: Hoare triple {19037#false} assume 1 != ~lk6~0; {19037#false} is VALID [2022-04-15 18:03:41,634 INFO L290 TraceCheckUtils]: 21: Hoare triple {19037#false} assume !false; {19037#false} is VALID [2022-04-15 18:03:41,634 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 18:03:41,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:03:41,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060812179] [2022-04-15 18:03:41,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060812179] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:03:41,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:03:41,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:03:41,634 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:03:41,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1984988680] [2022-04-15 18:03:41,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1984988680] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:03:41,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:03:41,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:03:41,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156021770] [2022-04-15 18:03:41,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:03:41,635 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-15 18:03:41,635 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:03:41,635 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:41,648 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 18:03:41,648 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:03:41,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:03:41,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:03:41,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:03:41,649 INFO L87 Difference]: Start difference. First operand 585 states and 759 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:41,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:03:41,805 INFO L93 Difference]: Finished difference Result 877 states and 1129 transitions. [2022-04-15 18:03:41,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:03:41,805 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-15 18:03:41,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:03:41,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:41,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2022-04-15 18:03:41,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:41,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2022-04-15 18:03:41,807 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 103 transitions. [2022-04-15 18:03:41,863 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:03:41,877 INFO L225 Difference]: With dead ends: 877 [2022-04-15 18:03:41,877 INFO L226 Difference]: Without dead ends: 603 [2022-04-15 18:03:41,878 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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 18:03:41,879 INFO L913 BasicCegarLoop]: 54 mSDtfsCounter, 75 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 18:03:41,879 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 61 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 18:03:41,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2022-04-15 18:03:41,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 601. [2022-04-15 18:03:41,911 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:03:41,912 INFO L82 GeneralOperation]: Start isEquivalent. First operand 603 states. Second operand has 601 states, 597 states have (on average 1.2663316582914572) internal successors, (756), 597 states have internal predecessors, (756), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:41,912 INFO L74 IsIncluded]: Start isIncluded. First operand 603 states. Second operand has 601 states, 597 states have (on average 1.2663316582914572) internal successors, (756), 597 states have internal predecessors, (756), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:41,913 INFO L87 Difference]: Start difference. First operand 603 states. Second operand has 601 states, 597 states have (on average 1.2663316582914572) internal successors, (756), 597 states have internal predecessors, (756), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:41,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:03:41,925 INFO L93 Difference]: Finished difference Result 603 states and 760 transitions. [2022-04-15 18:03:41,925 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 760 transitions. [2022-04-15 18:03:41,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:03:41,926 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:03:41,927 INFO L74 IsIncluded]: Start isIncluded. First operand has 601 states, 597 states have (on average 1.2663316582914572) internal successors, (756), 597 states have internal predecessors, (756), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 603 states. [2022-04-15 18:03:41,927 INFO L87 Difference]: Start difference. First operand has 601 states, 597 states have (on average 1.2663316582914572) internal successors, (756), 597 states have internal predecessors, (756), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 603 states. [2022-04-15 18:03:41,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:03:41,941 INFO L93 Difference]: Finished difference Result 603 states and 760 transitions. [2022-04-15 18:03:41,941 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 760 transitions. [2022-04-15 18:03:41,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:03:41,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:03:41,941 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:03:41,941 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:03:41,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 597 states have (on average 1.2663316582914572) internal successors, (756), 597 states have internal predecessors, (756), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:41,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 759 transitions. [2022-04-15 18:03:41,958 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 759 transitions. Word has length 22 [2022-04-15 18:03:41,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:03:41,958 INFO L478 AbstractCegarLoop]: Abstraction has 601 states and 759 transitions. [2022-04-15 18:03:41,958 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:41,958 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 601 states and 759 transitions. [2022-04-15 18:03:42,635 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 759 edges. 759 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:03:42,636 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 759 transitions. [2022-04-15 18:03:42,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 18:03:42,636 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:03:42,636 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:03:42,636 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-15 18:03:42,636 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:03:42,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:03:42,637 INFO L85 PathProgramCache]: Analyzing trace with hash 774151932, now seen corresponding path program 1 times [2022-04-15 18:03:42,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:03:42,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [614802450] [2022-04-15 18:03:42,637 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:03:42,637 INFO L85 PathProgramCache]: Analyzing trace with hash 774151932, now seen corresponding path program 2 times [2022-04-15 18:03:42,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:03:42,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772171733] [2022-04-15 18:03:42,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:03:42,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:03:42,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:03:42,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:03:42,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:03:42,663 INFO L290 TraceCheckUtils]: 0: Hoare triple {23216#(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(15, 2);call #Ultimate.allocInit(12, 3); {23210#true} is VALID [2022-04-15 18:03:42,664 INFO L290 TraceCheckUtils]: 1: Hoare triple {23210#true} assume true; {23210#true} is VALID [2022-04-15 18:03:42,664 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23210#true} {23210#true} #132#return; {23210#true} is VALID [2022-04-15 18:03:42,664 INFO L272 TraceCheckUtils]: 0: Hoare triple {23210#true} call ULTIMATE.init(); {23216#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:03:42,664 INFO L290 TraceCheckUtils]: 1: Hoare triple {23216#(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(15, 2);call #Ultimate.allocInit(12, 3); {23210#true} is VALID [2022-04-15 18:03:42,664 INFO L290 TraceCheckUtils]: 2: Hoare triple {23210#true} assume true; {23210#true} is VALID [2022-04-15 18:03:42,664 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23210#true} {23210#true} #132#return; {23210#true} is VALID [2022-04-15 18:03:42,664 INFO L272 TraceCheckUtils]: 4: Hoare triple {23210#true} call #t~ret11 := main(); {23210#true} is VALID [2022-04-15 18:03:42,664 INFO L290 TraceCheckUtils]: 5: Hoare triple {23210#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;havoc ~cond~0; {23210#true} is VALID [2022-04-15 18:03:42,664 INFO L290 TraceCheckUtils]: 6: Hoare triple {23210#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {23210#true} is VALID [2022-04-15 18:03:42,665 INFO L290 TraceCheckUtils]: 7: Hoare triple {23210#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {23210#true} is VALID [2022-04-15 18:03:42,665 INFO L290 TraceCheckUtils]: 8: Hoare triple {23210#true} assume !(0 != ~p1~0); {23210#true} is VALID [2022-04-15 18:03:42,665 INFO L290 TraceCheckUtils]: 9: Hoare triple {23210#true} assume !(0 != ~p2~0); {23210#true} is VALID [2022-04-15 18:03:42,665 INFO L290 TraceCheckUtils]: 10: Hoare triple {23210#true} assume !(0 != ~p3~0); {23210#true} is VALID [2022-04-15 18:03:42,665 INFO L290 TraceCheckUtils]: 11: Hoare triple {23210#true} assume !(0 != ~p4~0); {23210#true} is VALID [2022-04-15 18:03:42,665 INFO L290 TraceCheckUtils]: 12: Hoare triple {23210#true} assume !(0 != ~p5~0); {23210#true} is VALID [2022-04-15 18:03:42,665 INFO L290 TraceCheckUtils]: 13: Hoare triple {23210#true} assume 0 != ~p6~0;~lk6~0 := 1; {23215#(= main_~lk6~0 1)} is VALID [2022-04-15 18:03:42,665 INFO L290 TraceCheckUtils]: 14: Hoare triple {23215#(= main_~lk6~0 1)} assume !(0 != ~p1~0); {23215#(= main_~lk6~0 1)} is VALID [2022-04-15 18:03:42,666 INFO L290 TraceCheckUtils]: 15: Hoare triple {23215#(= main_~lk6~0 1)} assume !(0 != ~p2~0); {23215#(= main_~lk6~0 1)} is VALID [2022-04-15 18:03:42,666 INFO L290 TraceCheckUtils]: 16: Hoare triple {23215#(= main_~lk6~0 1)} assume !(0 != ~p3~0); {23215#(= main_~lk6~0 1)} is VALID [2022-04-15 18:03:42,666 INFO L290 TraceCheckUtils]: 17: Hoare triple {23215#(= main_~lk6~0 1)} assume !(0 != ~p4~0); {23215#(= main_~lk6~0 1)} is VALID [2022-04-15 18:03:42,667 INFO L290 TraceCheckUtils]: 18: Hoare triple {23215#(= main_~lk6~0 1)} assume !(0 != ~p5~0); {23215#(= main_~lk6~0 1)} is VALID [2022-04-15 18:03:42,667 INFO L290 TraceCheckUtils]: 19: Hoare triple {23215#(= main_~lk6~0 1)} assume 0 != ~p6~0; {23215#(= main_~lk6~0 1)} is VALID [2022-04-15 18:03:42,667 INFO L290 TraceCheckUtils]: 20: Hoare triple {23215#(= main_~lk6~0 1)} assume 1 != ~lk6~0; {23211#false} is VALID [2022-04-15 18:03:42,667 INFO L290 TraceCheckUtils]: 21: Hoare triple {23211#false} assume !false; {23211#false} is VALID [2022-04-15 18:03:42,667 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 18:03:42,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:03:42,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772171733] [2022-04-15 18:03:42,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772171733] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:03:42,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:03:42,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:03:42,668 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:03:42,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [614802450] [2022-04-15 18:03:42,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [614802450] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:03:42,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:03:42,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:03:42,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961296870] [2022-04-15 18:03:42,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:03:42,668 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-15 18:03:42,669 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:03:42,669 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:42,680 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 18:03:42,680 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:03:42,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:03:42,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:03:42,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:03:42,681 INFO L87 Difference]: Start difference. First operand 601 states and 759 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:42,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:03:42,866 INFO L93 Difference]: Finished difference Result 971 states and 1208 transitions. [2022-04-15 18:03:42,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:03:42,866 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-15 18:03:42,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:03:42,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:42,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2022-04-15 18:03:42,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:42,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2022-04-15 18:03:42,867 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 62 transitions. [2022-04-15 18:03:42,901 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 18:03:42,938 INFO L225 Difference]: With dead ends: 971 [2022-04-15 18:03:42,938 INFO L226 Difference]: Without dead ends: 969 [2022-04-15 18:03:42,938 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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 18:03:42,939 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 64 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 18:03:42,939 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 48 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 18:03:42,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2022-04-15 18:03:42,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 905. [2022-04-15 18:03:42,995 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:03:42,997 INFO L82 GeneralOperation]: Start isEquivalent. First operand 969 states. Second operand has 905 states, 901 states have (on average 1.2297447280799112) internal successors, (1108), 901 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:42,999 INFO L74 IsIncluded]: Start isIncluded. First operand 969 states. Second operand has 905 states, 901 states have (on average 1.2297447280799112) internal successors, (1108), 901 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:43,000 INFO L87 Difference]: Start difference. First operand 969 states. Second operand has 905 states, 901 states have (on average 1.2297447280799112) internal successors, (1108), 901 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:43,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:03:43,029 INFO L93 Difference]: Finished difference Result 969 states and 1175 transitions. [2022-04-15 18:03:43,029 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1175 transitions. [2022-04-15 18:03:43,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:03:43,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:03:43,032 INFO L74 IsIncluded]: Start isIncluded. First operand has 905 states, 901 states have (on average 1.2297447280799112) internal successors, (1108), 901 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 969 states. [2022-04-15 18:03:43,033 INFO L87 Difference]: Start difference. First operand has 905 states, 901 states have (on average 1.2297447280799112) internal successors, (1108), 901 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 969 states. [2022-04-15 18:03:43,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:03:43,062 INFO L93 Difference]: Finished difference Result 969 states and 1175 transitions. [2022-04-15 18:03:43,062 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1175 transitions. [2022-04-15 18:03:43,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:03:43,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:03:43,063 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:03:43,063 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:03:43,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 901 states have (on average 1.2297447280799112) internal successors, (1108), 901 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:43,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1111 transitions. [2022-04-15 18:03:43,126 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1111 transitions. Word has length 22 [2022-04-15 18:03:43,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:03:43,126 INFO L478 AbstractCegarLoop]: Abstraction has 905 states and 1111 transitions. [2022-04-15 18:03:43,126 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:43,126 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 905 states and 1111 transitions. [2022-04-15 18:03:44,109 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1111 edges. 1111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:03:44,110 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1111 transitions. [2022-04-15 18:03:44,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 18:03:44,111 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 18:03:44,111 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 18:03:44,111 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-15 18:03:44,111 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 18:03:44,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 18:03:44,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1454210302, now seen corresponding path program 1 times [2022-04-15 18:03:44,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 18:03:44,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1001846326] [2022-04-15 18:03:44,112 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 18:03:44,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1454210302, now seen corresponding path program 2 times [2022-04-15 18:03:44,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 18:03:44,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180754128] [2022-04-15 18:03:44,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 18:03:44,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 18:03:44,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:03:44,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 18:03:44,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 18:03:44,138 INFO L290 TraceCheckUtils]: 0: Hoare triple {28918#(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(15, 2);call #Ultimate.allocInit(12, 3); {28912#true} is VALID [2022-04-15 18:03:44,138 INFO L290 TraceCheckUtils]: 1: Hoare triple {28912#true} assume true; {28912#true} is VALID [2022-04-15 18:03:44,138 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28912#true} {28912#true} #132#return; {28912#true} is VALID [2022-04-15 18:03:44,138 INFO L272 TraceCheckUtils]: 0: Hoare triple {28912#true} call ULTIMATE.init(); {28918#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 18:03:44,138 INFO L290 TraceCheckUtils]: 1: Hoare triple {28918#(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(15, 2);call #Ultimate.allocInit(12, 3); {28912#true} is VALID [2022-04-15 18:03:44,138 INFO L290 TraceCheckUtils]: 2: Hoare triple {28912#true} assume true; {28912#true} is VALID [2022-04-15 18:03:44,139 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28912#true} {28912#true} #132#return; {28912#true} is VALID [2022-04-15 18:03:44,139 INFO L272 TraceCheckUtils]: 4: Hoare triple {28912#true} call #t~ret11 := main(); {28912#true} is VALID [2022-04-15 18:03:44,139 INFO L290 TraceCheckUtils]: 5: Hoare triple {28912#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;havoc ~cond~0; {28912#true} is VALID [2022-04-15 18:03:44,139 INFO L290 TraceCheckUtils]: 6: Hoare triple {28912#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {28912#true} is VALID [2022-04-15 18:03:44,139 INFO L290 TraceCheckUtils]: 7: Hoare triple {28912#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {28912#true} is VALID [2022-04-15 18:03:44,139 INFO L290 TraceCheckUtils]: 8: Hoare triple {28912#true} assume !(0 != ~p1~0); {28912#true} is VALID [2022-04-15 18:03:44,139 INFO L290 TraceCheckUtils]: 9: Hoare triple {28912#true} assume !(0 != ~p2~0); {28912#true} is VALID [2022-04-15 18:03:44,139 INFO L290 TraceCheckUtils]: 10: Hoare triple {28912#true} assume !(0 != ~p3~0); {28912#true} is VALID [2022-04-15 18:03:44,139 INFO L290 TraceCheckUtils]: 11: Hoare triple {28912#true} assume !(0 != ~p4~0); {28912#true} is VALID [2022-04-15 18:03:44,139 INFO L290 TraceCheckUtils]: 12: Hoare triple {28912#true} assume !(0 != ~p5~0); {28912#true} is VALID [2022-04-15 18:03:44,140 INFO L290 TraceCheckUtils]: 13: Hoare triple {28912#true} assume !(0 != ~p6~0); {28917#(= main_~p6~0 0)} is VALID [2022-04-15 18:03:44,140 INFO L290 TraceCheckUtils]: 14: Hoare triple {28917#(= main_~p6~0 0)} assume !(0 != ~p1~0); {28917#(= main_~p6~0 0)} is VALID [2022-04-15 18:03:44,140 INFO L290 TraceCheckUtils]: 15: Hoare triple {28917#(= main_~p6~0 0)} assume !(0 != ~p2~0); {28917#(= main_~p6~0 0)} is VALID [2022-04-15 18:03:44,141 INFO L290 TraceCheckUtils]: 16: Hoare triple {28917#(= main_~p6~0 0)} assume !(0 != ~p3~0); {28917#(= main_~p6~0 0)} is VALID [2022-04-15 18:03:44,141 INFO L290 TraceCheckUtils]: 17: Hoare triple {28917#(= main_~p6~0 0)} assume !(0 != ~p4~0); {28917#(= main_~p6~0 0)} is VALID [2022-04-15 18:03:44,141 INFO L290 TraceCheckUtils]: 18: Hoare triple {28917#(= main_~p6~0 0)} assume !(0 != ~p5~0); {28917#(= main_~p6~0 0)} is VALID [2022-04-15 18:03:44,142 INFO L290 TraceCheckUtils]: 19: Hoare triple {28917#(= main_~p6~0 0)} assume 0 != ~p6~0; {28913#false} is VALID [2022-04-15 18:03:44,142 INFO L290 TraceCheckUtils]: 20: Hoare triple {28913#false} assume 1 != ~lk6~0; {28913#false} is VALID [2022-04-15 18:03:44,142 INFO L290 TraceCheckUtils]: 21: Hoare triple {28913#false} assume !false; {28913#false} is VALID [2022-04-15 18:03:44,142 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 18:03:44,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 18:03:44,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180754128] [2022-04-15 18:03:44,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180754128] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:03:44,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:03:44,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:03:44,143 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 18:03:44,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1001846326] [2022-04-15 18:03:44,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1001846326] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 18:03:44,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 18:03:44,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 18:03:44,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026526875] [2022-04-15 18:03:44,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 18:03:44,143 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-15 18:03:44,143 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 18:03:44,144 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:44,155 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 18:03:44,155 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 18:03:44,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 18:03:44,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 18:03:44,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 18:03:44,156 INFO L87 Difference]: Start difference. First operand 905 states and 1111 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:44,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:03:44,495 INFO L93 Difference]: Finished difference Result 1993 states and 2391 transitions. [2022-04-15 18:03:44,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 18:03:44,495 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-15 18:03:44,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 18:03:44,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:44,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2022-04-15 18:03:44,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:44,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2022-04-15 18:03:44,497 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 103 transitions. [2022-04-15 18:03:44,555 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:03:44,556 INFO L225 Difference]: With dead ends: 1993 [2022-04-15 18:03:44,556 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 18:03:44,559 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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 18:03:44,559 INFO L913 BasicCegarLoop]: 65 mSDtfsCounter, 55 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 18:03:44,559 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 72 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 18:03:44,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 18:03:44,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 18:03:44,560 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 18:03:44,560 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 18:03:44,560 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 18:03:44,560 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 18:03:44,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:03:44,560 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 18:03:44,560 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 18:03:44,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:03:44,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:03:44,560 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 18:03:44,560 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 18:03:44,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 18:03:44,561 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 18:03:44,561 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 18:03:44,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:03:44,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 18:03:44,561 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 18:03:44,561 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 18:03:44,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 18:03:44,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 18:03:44,561 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2022-04-15 18:03:44,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 18:03:44,561 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 18:03:44,561 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 18:03:44,561 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-15 18:03:44,561 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 18:03:44,561 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 18:03:44,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 18:03:44,563 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 18:03:44,566 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-15 18:03:44,567 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 18:03:53,224 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-15 18:03:53,225 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-15 18:03:53,225 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-15 18:03:53,225 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-15 18:03:53,225 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-15 18:03:53,225 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-15 18:03:53,225 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-15 18:03:53,225 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 18:03:53,225 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 18:03:53,225 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-15 18:03:53,226 INFO L878 garLoopResultBuilder]: At program point L60-1(lines 29 104) the Hoare annotation is: (let ((.cse5 (= main_~lk1~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse1 (= main_~lk3~0 1)) (.cse3 (= main_~p2~0 0)) (.cse4 (= main_~p4~0 0)) (.cse2 (= main_~p1~0 0)) (.cse6 (= main_~p3~0 0)) (.cse7 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse1 .cse3) (and .cse5 .cse0 .cse6 .cse7) (and .cse4 .cse2 .cse3 .cse6) (and .cse4 .cse1 .cse2 .cse3) (and .cse0 .cse2 .cse3 .cse6) (and .cse5 .cse0 .cse3 .cse6) (and .cse4 .cse5 .cse6 .cse7) (and .cse5 .cse0 .cse1 .cse7) (and .cse4 .cse1 .cse2 .cse7) (and .cse0 .cse1 .cse2 .cse7) (and .cse4 .cse5 .cse3 .cse6) (and .cse0 .cse2 .cse6 .cse7) (and .cse4 .cse5 .cse1 .cse7) (and .cse5 .cse0 .cse1 .cse3) (and .cse4 .cse2 .cse6 .cse7))) [2022-04-15 18:03:53,226 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 6 109) the Hoare annotation is: true [2022-04-15 18:03:53,226 INFO L878 garLoopResultBuilder]: At program point L85(line 85) the Hoare annotation is: (let ((.cse1 (= main_~p4~0 0)) (.cse2 (= main_~lk5~0 1)) (.cse5 (= main_~lk6~0 1)) (.cse0 (not (= main_~p3~0 0))) (.cse7 (= main_~lk4~0 1)) (.cse3 (= main_~lk3~0 1)) (.cse6 (= main_~p5~0 0)) (.cse4 (= main_~p6~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse5) (and .cse0 .cse1 .cse3 .cse6 .cse5) (and .cse0 .cse2 .cse7 .cse3 .cse5) (and .cse0 .cse1 .cse3 .cse6 .cse4) (and .cse0 .cse2 .cse7 .cse3 .cse4) (and .cse0 .cse7 .cse3 .cse6 .cse5) (and .cse0 .cse7 .cse3 .cse6 .cse4))) [2022-04-15 18:03:53,226 INFO L878 garLoopResultBuilder]: At program point L52-1(lines 29 104) the Hoare annotation is: (let ((.cse0 (= main_~lk1~0 1)) (.cse3 (= main_~p2~0 0)) (.cse2 (= main_~p1~0 0)) (.cse1 (= main_~lk2~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse0 .cse3) (and .cse2 .cse1))) [2022-04-15 18:03:53,226 INFO L878 garLoopResultBuilder]: At program point L94-1(lines 29 104) the Hoare annotation is: (or (= main_~p6~0 0) (= main_~lk6~0 1)) [2022-04-15 18:03:53,226 INFO L878 garLoopResultBuilder]: At program point L95(line 95) the Hoare annotation is: (let ((.cse0 (not (= main_~p5~0 0))) (.cse1 (= main_~lk5~0 1))) (or (and .cse0 .cse1 (= main_~p6~0 0)) (and .cse0 .cse1 (= main_~lk6~0 1)))) [2022-04-15 18:03:53,226 INFO L878 garLoopResultBuilder]: At program point L79-1(lines 29 104) the Hoare annotation is: (let ((.cse1 (= main_~p5~0 0)) (.cse2 (= main_~lk6~0 1)) (.cse0 (= main_~p4~0 0)) (.cse6 (= main_~lk3~0 1)) (.cse4 (= main_~lk5~0 1)) (.cse5 (= main_~lk4~0 1)) (.cse7 (= main_~p6~0 0)) (.cse3 (= main_~p3~0 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse6 .cse1 .cse7) (and .cse5 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse7 .cse3) (and .cse0 .cse4 .cse2 .cse3) (and .cse0 .cse6 .cse1 .cse2) (and .cse5 .cse6 .cse1 .cse2) (and .cse4 .cse5 .cse2 .cse3) (and .cse5 .cse6 .cse1 .cse7) (and .cse0 .cse4 .cse6 .cse2) (and .cse5 .cse1 .cse7 .cse3) (and .cse0 .cse4 .cse7 .cse3) (and .cse4 .cse5 .cse6 .cse2) (and .cse0 .cse4 .cse6 .cse7) (and .cse4 .cse5 .cse7 .cse3))) [2022-04-15 18:03:53,226 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 6 109) the Hoare annotation is: true [2022-04-15 18:03:53,226 INFO L878 garLoopResultBuilder]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 107) the Hoare annotation is: false [2022-04-15 18:03:53,226 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 6 109) the Hoare annotation is: true [2022-04-15 18:03:53,227 INFO L878 garLoopResultBuilder]: At program point L80(line 80) the Hoare annotation is: (let ((.cse0 (= main_~p4~0 0)) (.cse1 (= main_~p5~0 0)) (.cse2 (= main_~lk6~0 1)) (.cse3 (= main_~p3~0 0)) (.cse6 (= main_~lk5~0 1)) (.cse7 (= main_~lk4~0 1)) (.cse8 (= main_~lk3~0 1)) (.cse5 (= main_~p6~0 0)) (.cse4 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse5 .cse3 .cse4) (and .cse0 .cse6 .cse5 .cse3 .cse4) (and .cse6 .cse7 .cse8 .cse2 .cse4) (and .cse6 .cse7 .cse5 .cse3 .cse4) (and .cse7 .cse8 .cse1 .cse2 .cse4) (and .cse0 .cse8 .cse1 .cse2 .cse4) (and .cse7 .cse1 .cse5 .cse3 .cse4) (and .cse6 .cse7 .cse2 .cse3 .cse4) (and .cse0 .cse6 .cse8 .cse2 .cse4) (and .cse7 .cse8 .cse1 .cse5 .cse4) (and .cse0 .cse6 .cse2 .cse3 .cse4) (and .cse0 .cse6 .cse8 .cse5 .cse4) (and .cse0 .cse8 .cse1 .cse5 .cse4) (and .cse7 .cse1 .cse2 .cse3 .cse4) (and .cse6 .cse7 .cse8 .cse5 .cse4))) [2022-04-15 18:03:53,227 INFO L885 garLoopResultBuilder]: At program point L105(lines 7 109) the Hoare annotation is: true [2022-04-15 18:03:53,227 INFO L885 garLoopResultBuilder]: At program point L31(lines 31 33) the Hoare annotation is: true [2022-04-15 18:03:53,227 INFO L878 garLoopResultBuilder]: At program point L64-1(lines 29 104) the Hoare annotation is: (let ((.cse9 (= main_~lk2~0 1)) (.cse4 (= main_~p3~0 0)) (.cse5 (= main_~p4~0 0)) (.cse0 (= main_~lk5~0 1)) (.cse1 (= main_~lk1~0 1)) (.cse2 (= main_~lk4~0 1)) (.cse6 (= main_~lk3~0 1)) (.cse8 (= main_~p1~0 0)) (.cse7 (= main_~p5~0 0)) (.cse3 (= main_~p2~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse6 .cse7 .cse3) (and .cse1 .cse2 .cse7 .cse3 .cse4) (and .cse2 .cse8 .cse7 .cse4 .cse9) (and .cse0 .cse2 .cse8 .cse3 .cse4) (and .cse5 .cse0 .cse8 .cse4 .cse9) (and .cse0 .cse2 .cse6 .cse8 .cse9) (and .cse5 .cse1 .cse7 .cse3 .cse4) (and .cse5 .cse6 .cse8 .cse7 .cse9) (and .cse0 .cse1 .cse2 .cse6 .cse3) (and .cse5 .cse0 .cse6 .cse8 .cse3) (and .cse0 .cse1 .cse2 .cse4 .cse9) (and .cse0 .cse1 .cse2 .cse6 .cse9) (and .cse5 .cse0 .cse1 .cse6 .cse9) (and .cse1 .cse2 .cse6 .cse7 .cse9) (and .cse1 .cse2 .cse7 .cse4 .cse9) (and .cse5 .cse0 .cse6 .cse8 .cse9) (and .cse0 .cse2 .cse6 .cse8 .cse3) (and .cse5 .cse0 .cse8 .cse3 .cse4) (and .cse5 .cse1 .cse7 .cse4 .cse9) (and .cse5 .cse8 .cse7 .cse3 .cse4) (and .cse2 .cse6 .cse8 .cse7 .cse9) (and .cse5 .cse0 .cse1 .cse4 .cse9) (and .cse2 .cse8 .cse7 .cse3 .cse4) (and .cse5 .cse1 .cse6 .cse7 .cse9) (and .cse1 .cse2 .cse6 .cse7 .cse3) (and .cse0 .cse2 .cse8 .cse4 .cse9) (and .cse5 .cse8 .cse7 .cse4 .cse9) (and .cse5 .cse6 .cse8 .cse7 .cse3) (and .cse5 .cse0 .cse1 .cse3 .cse4) (and .cse5 .cse0 .cse1 .cse6 .cse3) (and .cse2 .cse6 .cse8 .cse7 .cse3))) [2022-04-15 18:03:53,227 INFO L878 garLoopResultBuilder]: At program point L89-1(lines 29 104) the Hoare annotation is: (let ((.cse0 (= main_~lk5~0 1)) (.cse3 (= main_~lk6~0 1)) (.cse2 (= main_~p5~0 0)) (.cse1 (= main_~p6~0 0))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse0 .cse3) (and .cse2 .cse1))) [2022-04-15 18:03:53,227 INFO L878 garLoopResultBuilder]: At program point L56-1(lines 29 104) the Hoare annotation is: (let ((.cse4 (= main_~p1~0 0)) (.cse2 (= main_~p3~0 0)) (.cse5 (= main_~lk2~0 1)) (.cse0 (= main_~lk1~0 1)) (.cse3 (= main_~lk3~0 1)) (.cse1 (= main_~p2~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5) (and .cse4 .cse1 .cse2) (and .cse0 .cse3 .cse5) (and .cse3 .cse4 .cse1) (and .cse0 .cse2 .cse5) (and .cse4 .cse2 .cse5) (and .cse0 .cse3 .cse1))) [2022-04-15 18:03:53,227 INFO L885 garLoopResultBuilder]: At program point L48(lines 48 50) the Hoare annotation is: true [2022-04-15 18:03:53,227 INFO L878 garLoopResultBuilder]: At program point L48-2(lines 29 104) the Hoare annotation is: (or (= main_~lk1~0 1) (= main_~p1~0 0)) [2022-04-15 18:03:53,227 INFO L878 garLoopResultBuilder]: At program point L90(line 90) the Hoare annotation is: (let ((.cse3 (= main_~p6~0 0)) (.cse4 (= main_~p5~0 0)) (.cse0 (= main_~lk5~0 1)) (.cse1 (not (= main_~p4~0 0))) (.cse2 (= main_~lk4~0 1)) (.cse5 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse1 .cse2 .cse4 .cse3) (and .cse1 .cse2 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse5))) [2022-04-15 18:03:53,227 INFO L878 garLoopResultBuilder]: At program point L74-1(lines 29 104) the Hoare annotation is: (let ((.cse8 (= main_~p4~0 0)) (.cse2 (= main_~p2~0 0)) (.cse6 (= main_~p5~0 0)) (.cse3 (= main_~lk6~0 1)) (.cse4 (= main_~p3~0 0)) (.cse0 (= main_~lk5~0 1)) (.cse1 (= main_~lk4~0 1)) (.cse5 (= main_~lk3~0 1)) (.cse7 (= main_~p6~0 0)) (.cse9 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse5 .cse6 .cse2 .cse7) (and .cse0 .cse1 .cse5 .cse2 .cse7) (and .cse8 .cse5 .cse6 .cse2 .cse7) (and .cse8 .cse6 .cse3 .cse4 .cse9) (and .cse8 .cse5 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse7 .cse4) (and .cse8 .cse6 .cse7 .cse4 .cse9) (and .cse8 .cse0 .cse7 .cse4 .cse9) (and .cse0 .cse1 .cse5 .cse3 .cse9) (and .cse8 .cse6 .cse2 .cse7 .cse4) (and .cse0 .cse1 .cse7 .cse4 .cse9) (and .cse1 .cse5 .cse6 .cse3 .cse9) (and .cse8 .cse5 .cse6 .cse3 .cse9) (and .cse1 .cse6 .cse2 .cse7 .cse4) (and .cse1 .cse6 .cse7 .cse4 .cse9) (and .cse8 .cse6 .cse2 .cse3 .cse4) (and .cse1 .cse5 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse3 .cse4 .cse9) (and .cse8 .cse0 .cse5 .cse3 .cse9) (and .cse1 .cse5 .cse6 .cse7 .cse9) (and .cse8 .cse0 .cse5 .cse2 .cse7) (and .cse8 .cse0 .cse3 .cse4 .cse9) (and .cse1 .cse6 .cse2 .cse3 .cse4) (and .cse8 .cse0 .cse2 .cse7 .cse4) (and .cse0 .cse1 .cse5 .cse2 .cse3) (and .cse8 .cse0 .cse5 .cse7 .cse9) (and .cse8 .cse0 .cse2 .cse3 .cse4) (and .cse8 .cse5 .cse6 .cse7 .cse9) (and .cse8 .cse0 .cse5 .cse2 .cse3) (and .cse1 .cse6 .cse3 .cse4 .cse9) (and .cse0 .cse1 .cse5 .cse7 .cse9))) [2022-04-15 18:03:53,227 INFO L885 garLoopResultBuilder]: At program point L99-1(lines 29 104) the Hoare annotation is: true [2022-04-15 18:03:53,228 INFO L878 garLoopResultBuilder]: At program point L75(line 75) the Hoare annotation is: (let ((.cse8 (= main_~p5~0 0)) (.cse7 (= main_~lk4~0 1)) (.cse10 (= main_~p2~0 0)) (.cse4 (= main_~p6~0 0)) (.cse5 (= main_~p3~0 0)) (.cse0 (= main_~p4~0 0)) (.cse1 (= main_~lk5~0 1)) (.cse2 (not (= main_~p1~0 0))) (.cse3 (= main_~lk1~0 1)) (.cse11 (= main_~lk3~0 1)) (.cse9 (= main_~lk6~0 1)) (.cse6 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse3 .cse7 .cse8 .cse9 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse9 .cse5) (and .cse2 .cse3 .cse7 .cse8 .cse4 .cse5 .cse6) (and .cse2 .cse3 .cse7 .cse11 .cse8 .cse4 .cse6) (and .cse2 .cse3 .cse7 .cse8 .cse10 .cse4 .cse5) (and .cse0 .cse2 .cse3 .cse8 .cse10 .cse4 .cse5) (and .cse2 .cse3 .cse7 .cse8 .cse10 .cse9 .cse5) (and .cse0 .cse2 .cse3 .cse11 .cse8 .cse9 .cse6) (and .cse2 .cse3 .cse7 .cse11 .cse8 .cse10 .cse4) (and .cse0 .cse2 .cse3 .cse11 .cse8 .cse4 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse11 .cse10 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse11 .cse4 .cse6) (and .cse0 .cse2 .cse3 .cse11 .cse8 .cse10 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse9 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse10 .cse9 .cse5) (and .cse1 .cse2 .cse3 .cse7 .cse9 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse11 .cse10 .cse9) (and .cse2 .cse3 .cse7 .cse11 .cse8 .cse9 .cse6) (and .cse0 .cse2 .cse3 .cse8 .cse10 .cse9 .cse5) (and .cse0 .cse2 .cse3 .cse8 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse11 .cse10 .cse4) (and .cse1 .cse2 .cse3 .cse7 .cse11 .cse4 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse11 .cse10 .cse9) (and .cse0 .cse2 .cse3 .cse8 .cse9 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse11 .cse9 .cse6) (and .cse0 .cse2 .cse3 .cse11 .cse8 .cse10 .cse9) (and .cse2 .cse3 .cse7 .cse11 .cse8 .cse10 .cse9) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse10 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse11 .cse9 .cse6))) [2022-04-15 18:03:53,228 INFO L878 garLoopResultBuilder]: At program point L100(line 100) the Hoare annotation is: (= main_~lk6~0 1) [2022-04-15 18:03:53,228 INFO L878 garLoopResultBuilder]: At program point L100-1(lines 7 109) the Hoare annotation is: false [2022-04-15 18:03:53,228 INFO L878 garLoopResultBuilder]: At program point L84-1(lines 29 104) the Hoare annotation is: (let ((.cse0 (= main_~p4~0 0)) (.cse4 (= main_~p5~0 0)) (.cse2 (= main_~p6~0 0)) (.cse1 (= main_~lk5~0 1)) (.cse5 (= main_~lk4~0 1)) (.cse3 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse1 .cse3) (and .cse0 .cse4 .cse2) (and .cse5 .cse4 .cse3) (and .cse0 .cse4 .cse3) (and .cse1 .cse5 .cse2) (and .cse5 .cse4 .cse2) (and .cse1 .cse5 .cse3))) [2022-04-15 18:03:53,228 INFO L878 garLoopResultBuilder]: At program point L68-1(lines 29 104) the Hoare annotation is: (let ((.cse3 (= main_~p2~0 0)) (.cse7 (= main_~p4~0 0)) (.cse0 (= main_~lk5~0 1)) (.cse9 (= main_~p1~0 0)) (.cse4 (= main_~lk6~0 1)) (.cse8 (= main_~lk3~0 1)) (.cse1 (= main_~lk1~0 1)) (.cse2 (= main_~lk4~0 1)) (.cse11 (= main_~p5~0 0)) (.cse6 (= main_~p6~0 0)) (.cse5 (= main_~p3~0 0)) (.cse10 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse5) (and .cse7 .cse0 .cse8 .cse9 .cse6 .cse10) (and .cse7 .cse8 .cse9 .cse11 .cse3 .cse4) (and .cse7 .cse1 .cse8 .cse11 .cse6 .cse10) (and .cse0 .cse2 .cse9 .cse4 .cse5 .cse10) (and .cse7 .cse1 .cse11 .cse4 .cse5 .cse10) (and .cse7 .cse0 .cse1 .cse3 .cse6 .cse5) (and .cse7 .cse0 .cse9 .cse3 .cse6 .cse5) (and .cse7 .cse0 .cse9 .cse6 .cse5 .cse10) (and .cse2 .cse8 .cse9 .cse11 .cse6 .cse10) (and .cse7 .cse1 .cse11 .cse3 .cse4 .cse5) (and .cse7 .cse0 .cse1 .cse4 .cse5 .cse10) (and .cse1 .cse2 .cse8 .cse11 .cse3 .cse6) (and .cse0 .cse1 .cse2 .cse8 .cse4 .cse10) (and .cse7 .cse0 .cse8 .cse9 .cse3 .cse6) (and .cse0 .cse2 .cse8 .cse9 .cse4 .cse10) (and .cse7 .cse9 .cse11 .cse3 .cse6 .cse5) (and .cse7 .cse0 .cse8 .cse9 .cse3 .cse4) (and .cse7 .cse8 .cse9 .cse11 .cse6 .cse10) (and .cse2 .cse9 .cse11 .cse4 .cse5 .cse10) (and .cse7 .cse0 .cse1 .cse8 .cse4 .cse10) (and .cse7 .cse1 .cse11 .cse3 .cse6 .cse5) (and .cse7 .cse0 .cse8 .cse9 .cse4 .cse10) (and .cse1 .cse2 .cse11 .cse4 .cse5 .cse10) (and .cse7 .cse9 .cse11 .cse4 .cse5 .cse10) (and .cse7 .cse8 .cse9 .cse11 .cse4 .cse10) (and .cse7 .cse1 .cse8 .cse11 .cse3 .cse6) (and .cse0 .cse2 .cse9 .cse6 .cse5 .cse10) (and .cse1 .cse2 .cse11 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse9 .cse3 .cse6 .cse5) (and .cse0 .cse2 .cse9 .cse3 .cse4 .cse5) (and .cse1 .cse2 .cse8 .cse11 .cse3 .cse4) (and .cse0 .cse2 .cse8 .cse9 .cse3 .cse6) (and .cse0 .cse1 .cse2 .cse8 .cse6 .cse10) (and .cse7 .cse0 .cse1 .cse8 .cse3 .cse4) (and .cse7 .cse9 .cse11 .cse6 .cse5 .cse10) (and .cse7 .cse0 .cse1 .cse6 .cse5 .cse10) (and .cse7 .cse0 .cse1 .cse8 .cse3 .cse6) (and .cse7 .cse0 .cse9 .cse3 .cse4 .cse5) (and .cse7 .cse0 .cse1 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse8 .cse3 .cse6) (and .cse0 .cse2 .cse8 .cse9 .cse6 .cse10) (and .cse2 .cse8 .cse9 .cse11 .cse3 .cse6) (and .cse7 .cse0 .cse1 .cse8 .cse6 .cse10) (and .cse2 .cse9 .cse11 .cse6 .cse5 .cse10) (and .cse7 .cse1 .cse11 .cse6 .cse5 .cse10) (and .cse2 .cse9 .cse11 .cse3 .cse6 .cse5) (and .cse7 .cse9 .cse11 .cse3 .cse4 .cse5) (and .cse7 .cse8 .cse9 .cse11 .cse3 .cse6) (and .cse2 .cse8 .cse9 .cse11 .cse3 .cse4) (and .cse7 .cse1 .cse8 .cse11 .cse4 .cse10) (and .cse0 .cse1 .cse2 .cse6 .cse5 .cse10) (and .cse2 .cse8 .cse9 .cse11 .cse4 .cse10) (and .cse1 .cse2 .cse8 .cse11 .cse4 .cse10) (and .cse1 .cse2 .cse11 .cse3 .cse6 .cse5) (and .cse0 .cse1 .cse2 .cse8 .cse3 .cse4) (and .cse2 .cse9 .cse11 .cse3 .cse4 .cse5) (and .cse7 .cse1 .cse8 .cse11 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse10) (and .cse0 .cse2 .cse8 .cse9 .cse3 .cse4) (and .cse7 .cse0 .cse9 .cse4 .cse5 .cse10) (and .cse1 .cse2 .cse8 .cse11 .cse6 .cse10) (and .cse1 .cse2 .cse11 .cse6 .cse5 .cse10))) [2022-04-15 18:03:53,230 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] [2022-04-15 18:03:53,231 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 18:03:53,233 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 18:03:53,234 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-15 18:03:53,267 INFO L163 areAnnotationChecker]: CFG has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 18:03:53,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 06:03:53 BoogieIcfgContainer [2022-04-15 18:03:53,273 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 18:03:53,273 INFO L158 Benchmark]: Toolchain (without parser) took 19857.28ms. Allocated memory was 203.4MB in the beginning and 515.9MB in the end (delta: 312.5MB). Free memory was 152.9MB in the beginning and 456.0MB in the end (delta: -303.1MB). Peak memory consumption was 289.2MB. Max. memory is 8.0GB. [2022-04-15 18:03:53,273 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 203.4MB. Free memory was 169.1MB in the beginning and 169.0MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 18:03:53,274 INFO L158 Benchmark]: CACSL2BoogieTranslator took 213.94ms. Allocated memory is still 203.4MB. Free memory was 152.6MB in the beginning and 179.3MB in the end (delta: -26.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 18:03:53,274 INFO L158 Benchmark]: Boogie Preprocessor took 36.59ms. Allocated memory is still 203.4MB. Free memory was 179.1MB in the beginning and 177.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 18:03:53,274 INFO L158 Benchmark]: RCFGBuilder took 246.63ms. Allocated memory is still 203.4MB. Free memory was 177.2MB in the beginning and 165.4MB in the end (delta: 11.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 18:03:53,274 INFO L158 Benchmark]: TraceAbstraction took 19355.81ms. Allocated memory was 203.4MB in the beginning and 515.9MB in the end (delta: 312.5MB). Free memory was 164.7MB in the beginning and 456.0MB in the end (delta: -291.3MB). Peak memory consumption was 301.9MB. Max. memory is 8.0GB. [2022-04-15 18:03:53,274 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 203.4MB. Free memory was 169.1MB in the beginning and 169.0MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 213.94ms. Allocated memory is still 203.4MB. Free memory was 152.6MB in the beginning and 179.3MB in the end (delta: -26.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.59ms. Allocated memory is still 203.4MB. Free memory was 179.1MB in the beginning and 177.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 246.63ms. Allocated memory is still 203.4MB. Free memory was 177.2MB in the beginning and 165.4MB in the end (delta: 11.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 19355.81ms. Allocated memory was 203.4MB in the beginning and 515.9MB in the end (delta: 312.5MB). Free memory was 164.7MB in the beginning and 456.0MB in the end (delta: -291.3MB). Peak memory consumption was 301.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 107]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 36 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.3s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 8.7s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1224 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1224 mSDsluCounter, 1008 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 114 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 614 IncrementalHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 894 mSDtfsCounter, 614 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 112 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=905occurred in iteration=15, InterpolantAutomatonStates: 64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 16 MinimizatonAttempts, 268 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 33 LocationsWithAnnotation, 33 PreInvPairs, 1162 NumberOfFragments, 4131 HoareAnnotationTreeSize, 33 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 2.8s HoareSimplificationTime, 33 FomulaSimplificationsInter, 38507 FormulaSimplificationTreeSizeReductionInter, 5.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: 1 - ProcedureContractResult [Line: 6]: Procedure Contract for main Derived contract for procedure main: 1 RESULT: Ultimate proved your program to be correct! [2022-04-15 18:03:53,297 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...