/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/locks/test_locks_6.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 11:18:35,503 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 11:18:35,505 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 11:18:35,551 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 11:18:35,551 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 11:18:35,552 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 11:18:35,555 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 11:18:35,557 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 11:18:35,559 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 11:18:35,564 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 11:18:35,565 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 11:18:35,566 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 11:18:35,566 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 11:18:35,568 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 11:18:35,569 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 11:18:35,572 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 11:18:35,573 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 11:18:35,573 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 11:18:35,575 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 11:18:35,579 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 11:18:35,580 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 11:18:35,581 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 11:18:35,582 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 11:18:35,582 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 11:18:35,584 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 11:18:35,589 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 11:18:35,589 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 11:18:35,589 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 11:18:35,590 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 11:18:35,590 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 11:18:35,591 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 11:18:35,591 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 11:18:35,591 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 11:18:35,592 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 11:18:35,592 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 11:18:35,593 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 11:18:35,593 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 11:18:35,593 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 11:18:35,594 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 11:18:35,594 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 11:18:35,594 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 11:18:35,599 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 11:18:35,599 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 11:18:35,609 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 11:18:35,609 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 11:18:35,611 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 11:18:35,611 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 11:18:35,611 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 11:18:35,611 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 11:18:35,611 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 11:18:35,611 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 11:18:35,611 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 11:18:35,612 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 11:18:35,612 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 11:18:35,612 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 11:18:35,612 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 11:18:35,612 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 11:18:35,613 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 11:18:35,613 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 11:18:35,613 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 11:18:35,613 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 11:18:35,613 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 11:18:35,613 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 11:18:35,613 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 11:18:35,613 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 11:18:35,613 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 11:18:35,614 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 11:18:35,614 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 11:18:35,614 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 11:18:35,809 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 11:18:35,827 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 11:18:35,828 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 11:18:35,829 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 11:18:35,829 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 11:18:35,830 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 11:18:35,881 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/440b44d63/1cd51a82fb44492fa24348b7915b5737/FLAG3645802d5 [2022-04-15 11:18:36,230 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 11:18:36,230 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_6.c [2022-04-15 11:18:36,236 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/440b44d63/1cd51a82fb44492fa24348b7915b5737/FLAG3645802d5 [2022-04-15 11:18:36,248 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/440b44d63/1cd51a82fb44492fa24348b7915b5737 [2022-04-15 11:18:36,249 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 11:18:36,252 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 11:18:36,252 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 11:18:36,253 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 11:18:36,255 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 11:18:36,255 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 11:18:36" (1/1) ... [2022-04-15 11:18:36,256 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8699d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:18:36, skipping insertion in model container [2022-04-15 11:18:36,257 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 11:18:36" (1/1) ... [2022-04-15 11:18:36,261 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 11:18:36,272 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 11:18:36,435 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 11:18:36,437 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 11:18:36,446 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 11:18:36,474 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 11:18:36,476 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 11:18:36,484 INFO L208 MainTranslator]: Completed translation [2022-04-15 11:18:36,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:18:36 WrapperNode [2022-04-15 11:18:36,484 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 11:18:36,485 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 11:18:36,485 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 11:18:36,485 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 11:18:36,494 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:18:36" (1/1) ... [2022-04-15 11:18:36,495 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:18:36" (1/1) ... [2022-04-15 11:18:36,501 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:18:36" (1/1) ... [2022-04-15 11:18:36,501 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:18:36" (1/1) ... [2022-04-15 11:18:36,514 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:18:36" (1/1) ... [2022-04-15 11:18:36,522 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:18:36" (1/1) ... [2022-04-15 11:18:36,526 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:18:36" (1/1) ... [2022-04-15 11:18:36,529 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 11:18:36,529 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 11:18:36,529 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 11:18:36,529 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 11:18:36,531 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:18:36" (1/1) ... [2022-04-15 11:18:36,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 11:18:36,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:18:36,561 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 11:18:36,571 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 11:18:36,602 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 11:18:36,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 11:18:36,603 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 11:18:36,603 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 11:18:36,603 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 11:18:36,603 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 11:18:36,603 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 11:18:36,604 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 11:18:36,604 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 11:18:36,604 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 11:18:36,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 11:18:36,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 11:18:36,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 11:18:36,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 11:18:36,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 11:18:36,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 11:18:36,650 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 11:18:36,651 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 11:18:36,816 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 11:18:36,820 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 11:18:36,821 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 11:18:36,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 11:18:36 BoogieIcfgContainer [2022-04-15 11:18:36,822 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 11:18:36,823 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 11:18:36,823 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 11:18:36,832 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 11:18:36,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 11:18:36" (1/3) ... [2022-04-15 11:18:36,833 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ac15ef8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 11:18:36, skipping insertion in model container [2022-04-15 11:18:36,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:18:36" (2/3) ... [2022-04-15 11:18:36,833 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ac15ef8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 11:18:36, skipping insertion in model container [2022-04-15 11:18:36,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 11:18:36" (3/3) ... [2022-04-15 11:18:36,834 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_6.c [2022-04-15 11:18:36,837 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 11:18:36,837 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 11:18:36,881 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 11:18:36,887 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 11:18:36,887 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 11:18:36,903 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 11:18:36,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 11:18:36,908 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:18:36,909 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 11:18:36,909 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:18:36,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:18:36,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1747552289, now seen corresponding path program 1 times [2022-04-15 11:18:36,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:36,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1146120861] [2022-04-15 11:18:36,929 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:18:36,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1747552289, now seen corresponding path program 2 times [2022-04-15 11:18:36,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:18:36,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114833378] [2022-04-15 11:18:36,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:18:36,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:18:37,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:37,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:18:37,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:37,106 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 11:18:37,106 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume true; {36#true} is VALID [2022-04-15 11:18:37,107 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36#true} {36#true} #132#return; {36#true} is VALID [2022-04-15 11:18:37,109 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 11:18:37,110 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 11:18:37,110 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#true} assume true; {36#true} is VALID [2022-04-15 11:18:37,110 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#true} {36#true} #132#return; {36#true} is VALID [2022-04-15 11:18:37,110 INFO L272 TraceCheckUtils]: 4: Hoare triple {36#true} call #t~ret11 := main(); {36#true} is VALID [2022-04-15 11:18:37,110 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 11:18:37,111 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 11:18:37,111 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 11:18:37,113 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 11:18:37,114 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 11:18:37,115 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 11:18:37,115 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 11:18:37,116 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 11:18:37,117 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 11:18:37,117 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 11:18:37,119 INFO L290 TraceCheckUtils]: 15: Hoare triple {41#(= main_~lk1~0 1)} assume 1 != ~lk1~0; {37#false} is VALID [2022-04-15 11:18:37,119 INFO L290 TraceCheckUtils]: 16: Hoare triple {37#false} assume !false; {37#false} is VALID [2022-04-15 11:18:37,119 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 11:18:37,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:18:37,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114833378] [2022-04-15 11:18:37,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114833378] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:37,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:37,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:37,122 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:18:37,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1146120861] [2022-04-15 11:18:37,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1146120861] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:37,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:37,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:37,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19535710] [2022-04-15 11:18:37,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:18:37,127 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 11:18:37,128 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:18:37,130 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 11:18:37,163 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 11:18:37,163 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:18:37,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:37,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:18:37,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:18:37,184 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 11:18:37,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:37,466 INFO L93 Difference]: Finished difference Result 64 states and 103 transitions. [2022-04-15 11:18:37,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:18:37,467 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 11:18:37,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:18:37,468 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 11:18:37,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2022-04-15 11:18:37,474 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 11:18:37,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2022-04-15 11:18:37,476 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 103 transitions. [2022-04-15 11:18:37,564 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 11:18:37,576 INFO L225 Difference]: With dead ends: 64 [2022-04-15 11:18:37,576 INFO L226 Difference]: Without dead ends: 49 [2022-04-15 11:18:37,579 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 11:18:37,581 INFO L913 BasicCegarLoop]: 56 mSDtfsCounter, 106 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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 11:18:37,582 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 11:18:37,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-15 11:18:37,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 35. [2022-04-15 11:18:37,611 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:18:37,612 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 11:18:37,613 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 11:18:37,613 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 11:18:37,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:37,618 INFO L93 Difference]: Finished difference Result 49 states and 81 transitions. [2022-04-15 11:18:37,618 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 81 transitions. [2022-04-15 11:18:37,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:37,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:37,619 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 11:18:37,620 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 11:18:37,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:37,626 INFO L93 Difference]: Finished difference Result 49 states and 81 transitions. [2022-04-15 11:18:37,626 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 81 transitions. [2022-04-15 11:18:37,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:37,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:37,627 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:18:37,627 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:18:37,629 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 11:18:37,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 58 transitions. [2022-04-15 11:18:37,632 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 58 transitions. Word has length 17 [2022-04-15 11:18:37,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:18:37,633 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 58 transitions. [2022-04-15 11:18:37,636 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 11:18:37,636 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 58 transitions. [2022-04-15 11:18:37,691 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 11:18:37,692 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 58 transitions. [2022-04-15 11:18:37,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 11:18:37,693 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:18:37,693 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 11:18:37,693 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 11:18:37,694 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:18:37,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:18:37,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1867356637, now seen corresponding path program 1 times [2022-04-15 11:18:37,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:37,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1347844718] [2022-04-15 11:18:37,696 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:18:37,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1867356637, now seen corresponding path program 2 times [2022-04-15 11:18:37,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:18:37,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555936264] [2022-04-15 11:18:37,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:18:37,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:18:37,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:37,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:18:37,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:37,776 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 11:18:37,777 INFO L290 TraceCheckUtils]: 1: Hoare triple {344#true} assume true; {344#true} is VALID [2022-04-15 11:18:37,777 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {344#true} {344#true} #132#return; {344#true} is VALID [2022-04-15 11:18:37,777 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 11:18:37,778 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 11:18:37,778 INFO L290 TraceCheckUtils]: 2: Hoare triple {344#true} assume true; {344#true} is VALID [2022-04-15 11:18:37,778 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {344#true} {344#true} #132#return; {344#true} is VALID [2022-04-15 11:18:37,778 INFO L272 TraceCheckUtils]: 4: Hoare triple {344#true} call #t~ret11 := main(); {344#true} is VALID [2022-04-15 11:18:37,778 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 11:18:37,778 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 11:18:37,779 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 11:18:37,779 INFO L290 TraceCheckUtils]: 8: Hoare triple {344#true} assume !(0 != ~p1~0); {349#(= main_~p1~0 0)} is VALID [2022-04-15 11:18:37,779 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 11:18:37,780 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 11:18:37,781 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 11:18:37,781 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 11:18:37,781 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 11:18:37,782 INFO L290 TraceCheckUtils]: 14: Hoare triple {349#(= main_~p1~0 0)} assume 0 != ~p1~0; {345#false} is VALID [2022-04-15 11:18:37,782 INFO L290 TraceCheckUtils]: 15: Hoare triple {345#false} assume 1 != ~lk1~0; {345#false} is VALID [2022-04-15 11:18:37,782 INFO L290 TraceCheckUtils]: 16: Hoare triple {345#false} assume !false; {345#false} is VALID [2022-04-15 11:18:37,782 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 11:18:37,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:18:37,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555936264] [2022-04-15 11:18:37,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555936264] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:37,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:37,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:37,786 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:18:37,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1347844718] [2022-04-15 11:18:37,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1347844718] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:37,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:37,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:37,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449364497] [2022-04-15 11:18:37,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:18:37,788 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 11:18:37,788 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:18:37,788 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 11:18:37,801 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 11:18:37,801 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:18:37,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:37,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:18:37,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:18:37,802 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 11:18:37,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:37,958 INFO L93 Difference]: Finished difference Result 78 states and 133 transitions. [2022-04-15 11:18:37,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:18:37,958 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 11:18:37,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:18:37,958 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 11:18:37,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 120 transitions. [2022-04-15 11:18:37,961 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 11:18:37,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 120 transitions. [2022-04-15 11:18:37,963 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 120 transitions. [2022-04-15 11:18:38,052 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 11:18:38,057 INFO L225 Difference]: With dead ends: 78 [2022-04-15 11:18:38,057 INFO L226 Difference]: Without dead ends: 49 [2022-04-15 11:18:38,058 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 11:18:38,059 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 11:18:38,060 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 11:18:38,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-15 11:18:38,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2022-04-15 11:18:38,073 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:18:38,073 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 11:18:38,074 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 11:18:38,075 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 11:18:38,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:38,079 INFO L93 Difference]: Finished difference Result 49 states and 79 transitions. [2022-04-15 11:18:38,079 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 79 transitions. [2022-04-15 11:18:38,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:38,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:38,080 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 11:18:38,080 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 11:18:38,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:38,082 INFO L93 Difference]: Finished difference Result 49 states and 79 transitions. [2022-04-15 11:18:38,082 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 79 transitions. [2022-04-15 11:18:38,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:38,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:38,084 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:18:38,084 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:18:38,084 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 11:18:38,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 78 transitions. [2022-04-15 11:18:38,087 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 78 transitions. Word has length 17 [2022-04-15 11:18:38,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:18:38,088 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 78 transitions. [2022-04-15 11:18:38,088 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 11:18:38,088 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 78 transitions. [2022-04-15 11:18:38,163 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 11:18:38,164 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 78 transitions. [2022-04-15 11:18:38,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 11:18:38,168 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:18:38,168 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 11:18:38,168 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 11:18:38,168 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:18:38,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:18:38,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1660239210, now seen corresponding path program 1 times [2022-04-15 11:18:38,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:38,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1649264432] [2022-04-15 11:18:38,172 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:18:38,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1660239210, now seen corresponding path program 2 times [2022-04-15 11:18:38,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:18:38,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308994212] [2022-04-15 11:18:38,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:18:38,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:18:38,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:38,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:18:38,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:38,246 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 11:18:38,246 INFO L290 TraceCheckUtils]: 1: Hoare triple {704#true} assume true; {704#true} is VALID [2022-04-15 11:18:38,246 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {704#true} {704#true} #132#return; {704#true} is VALID [2022-04-15 11:18:38,247 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 11:18:38,247 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 11:18:38,247 INFO L290 TraceCheckUtils]: 2: Hoare triple {704#true} assume true; {704#true} is VALID [2022-04-15 11:18:38,247 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {704#true} {704#true} #132#return; {704#true} is VALID [2022-04-15 11:18:38,247 INFO L272 TraceCheckUtils]: 4: Hoare triple {704#true} call #t~ret11 := main(); {704#true} is VALID [2022-04-15 11:18:38,247 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 11:18:38,247 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 11:18:38,248 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 11:18:38,253 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 11:18:38,253 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 11:18:38,254 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 11:18:38,254 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 11:18:38,254 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 11:18:38,255 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 11:18:38,256 INFO L290 TraceCheckUtils]: 14: Hoare triple {709#(not (= main_~p1~0 0))} assume !(0 != ~p1~0); {705#false} is VALID [2022-04-15 11:18:38,256 INFO L290 TraceCheckUtils]: 15: Hoare triple {705#false} assume 0 != ~p2~0; {705#false} is VALID [2022-04-15 11:18:38,256 INFO L290 TraceCheckUtils]: 16: Hoare triple {705#false} assume 1 != ~lk2~0; {705#false} is VALID [2022-04-15 11:18:38,256 INFO L290 TraceCheckUtils]: 17: Hoare triple {705#false} assume !false; {705#false} is VALID [2022-04-15 11:18:38,256 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 11:18:38,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:18:38,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308994212] [2022-04-15 11:18:38,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308994212] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:38,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:38,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:38,257 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:18:38,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1649264432] [2022-04-15 11:18:38,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1649264432] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:38,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:38,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:38,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322251179] [2022-04-15 11:18:38,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:18:38,258 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 11:18:38,258 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:18:38,258 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 11:18:38,269 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 11:18:38,269 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:18:38,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:38,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:18:38,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:18:38,270 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 11:18:38,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:38,391 INFO L93 Difference]: Finished difference Result 73 states and 118 transitions. [2022-04-15 11:18:38,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:18:38,391 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 11:18:38,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:18:38,391 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 11:18:38,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2022-04-15 11:18:38,393 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 11:18:38,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2022-04-15 11:18:38,394 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 115 transitions. [2022-04-15 11:18:38,477 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 11:18:38,478 INFO L225 Difference]: With dead ends: 73 [2022-04-15 11:18:38,478 INFO L226 Difference]: Without dead ends: 52 [2022-04-15 11:18:38,479 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 11:18:38,480 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 11:18:38,480 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 11:18:38,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-15 11:18:38,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2022-04-15 11:18:38,485 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:18:38,485 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 11:18:38,486 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 11:18:38,486 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 11:18:38,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:38,487 INFO L93 Difference]: Finished difference Result 52 states and 81 transitions. [2022-04-15 11:18:38,487 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 81 transitions. [2022-04-15 11:18:38,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:38,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:38,488 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 11:18:38,488 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 11:18:38,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:38,489 INFO L93 Difference]: Finished difference Result 52 states and 81 transitions. [2022-04-15 11:18:38,489 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 81 transitions. [2022-04-15 11:18:38,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:38,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:38,490 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:18:38,490 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:18:38,490 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 11:18:38,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 80 transitions. [2022-04-15 11:18:38,492 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 80 transitions. Word has length 18 [2022-04-15 11:18:38,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:18:38,492 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 80 transitions. [2022-04-15 11:18:38,492 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 11:18:38,492 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 80 transitions. [2022-04-15 11:18:38,576 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 11:18:38,576 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 80 transitions. [2022-04-15 11:18:38,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 11:18:38,577 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:18:38,577 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 11:18:38,577 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 11:18:38,577 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:18:38,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:18:38,581 INFO L85 PathProgramCache]: Analyzing trace with hash -2053266220, now seen corresponding path program 1 times [2022-04-15 11:18:38,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:38,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [653914545] [2022-04-15 11:18:38,582 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:18:38,582 INFO L85 PathProgramCache]: Analyzing trace with hash -2053266220, now seen corresponding path program 2 times [2022-04-15 11:18:38,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:18:38,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324548417] [2022-04-15 11:18:38,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:18:38,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:18:38,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:38,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:18:38,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:38,648 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 11:18:38,648 INFO L290 TraceCheckUtils]: 1: Hoare triple {1066#true} assume true; {1066#true} is VALID [2022-04-15 11:18:38,648 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1066#true} {1066#true} #132#return; {1066#true} is VALID [2022-04-15 11:18:38,649 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 11:18:38,649 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 11:18:38,649 INFO L290 TraceCheckUtils]: 2: Hoare triple {1066#true} assume true; {1066#true} is VALID [2022-04-15 11:18:38,650 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1066#true} {1066#true} #132#return; {1066#true} is VALID [2022-04-15 11:18:38,650 INFO L272 TraceCheckUtils]: 4: Hoare triple {1066#true} call #t~ret11 := main(); {1066#true} is VALID [2022-04-15 11:18:38,650 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 11:18:38,650 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 11:18:38,650 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 11:18:38,650 INFO L290 TraceCheckUtils]: 8: Hoare triple {1066#true} assume !(0 != ~p1~0); {1066#true} is VALID [2022-04-15 11:18:38,651 INFO L290 TraceCheckUtils]: 9: Hoare triple {1066#true} assume !(0 != ~p2~0); {1071#(= main_~p2~0 0)} is VALID [2022-04-15 11:18:38,654 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 11:18:38,654 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 11:18:38,655 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 11:18:38,655 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 11:18:38,655 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 11:18:38,656 INFO L290 TraceCheckUtils]: 15: Hoare triple {1071#(= main_~p2~0 0)} assume 0 != ~p2~0; {1067#false} is VALID [2022-04-15 11:18:38,656 INFO L290 TraceCheckUtils]: 16: Hoare triple {1067#false} assume 1 != ~lk2~0; {1067#false} is VALID [2022-04-15 11:18:38,656 INFO L290 TraceCheckUtils]: 17: Hoare triple {1067#false} assume !false; {1067#false} is VALID [2022-04-15 11:18:38,657 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 11:18:38,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:18:38,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324548417] [2022-04-15 11:18:38,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324548417] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:38,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:38,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:38,660 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:18:38,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [653914545] [2022-04-15 11:18:38,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [653914545] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:38,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:38,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:38,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482283560] [2022-04-15 11:18:38,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:18:38,661 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 11:18:38,661 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:18:38,661 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 11:18:38,674 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 11:18:38,675 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:18:38,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:38,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:18:38,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:18:38,676 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 11:18:38,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:38,796 INFO L93 Difference]: Finished difference Result 130 states and 216 transitions. [2022-04-15 11:18:38,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:18:38,797 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 11:18:38,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:18:38,797 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 11:18:38,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions. [2022-04-15 11:18:38,799 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 11:18:38,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions. [2022-04-15 11:18:38,801 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 118 transitions. [2022-04-15 11:18:38,909 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 11:18:38,913 INFO L225 Difference]: With dead ends: 130 [2022-04-15 11:18:38,913 INFO L226 Difference]: Without dead ends: 89 [2022-04-15 11:18:38,915 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 11:18:38,916 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 11:18:38,917 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 11:18:38,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-04-15 11:18:38,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2022-04-15 11:18:38,937 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:18:38,938 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 11:18:38,938 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 11:18:38,938 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 11:18:38,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:38,942 INFO L93 Difference]: Finished difference Result 89 states and 142 transitions. [2022-04-15 11:18:38,942 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 142 transitions. [2022-04-15 11:18:38,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:38,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:38,943 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 11:18:38,944 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 11:18:38,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:38,947 INFO L93 Difference]: Finished difference Result 89 states and 142 transitions. [2022-04-15 11:18:38,947 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 142 transitions. [2022-04-15 11:18:38,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:38,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:38,947 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:18:38,947 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:18:38,948 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 11:18:38,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 141 transitions. [2022-04-15 11:18:38,950 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 141 transitions. Word has length 18 [2022-04-15 11:18:38,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:18:38,950 INFO L478 AbstractCegarLoop]: Abstraction has 87 states and 141 transitions. [2022-04-15 11:18:38,950 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 11:18:38,950 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 87 states and 141 transitions. [2022-04-15 11:18:39,069 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 11:18:39,069 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 141 transitions. [2022-04-15 11:18:39,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 11:18:39,070 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:18:39,070 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 11:18:39,070 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 11:18:39,070 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:18:39,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:18:39,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1561642706, now seen corresponding path program 1 times [2022-04-15 11:18:39,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:39,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [928920101] [2022-04-15 11:18:39,071 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:18:39,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1561642706, now seen corresponding path program 2 times [2022-04-15 11:18:39,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:18:39,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902239019] [2022-04-15 11:18:39,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:18:39,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:18:39,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:39,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:18:39,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:39,136 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 11:18:39,136 INFO L290 TraceCheckUtils]: 1: Hoare triple {1690#true} assume true; {1690#true} is VALID [2022-04-15 11:18:39,137 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1690#true} {1690#true} #132#return; {1690#true} is VALID [2022-04-15 11:18:39,137 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 11:18:39,138 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 11:18:39,139 INFO L290 TraceCheckUtils]: 2: Hoare triple {1690#true} assume true; {1690#true} is VALID [2022-04-15 11:18:39,139 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1690#true} {1690#true} #132#return; {1690#true} is VALID [2022-04-15 11:18:39,139 INFO L272 TraceCheckUtils]: 4: Hoare triple {1690#true} call #t~ret11 := main(); {1690#true} is VALID [2022-04-15 11:18:39,140 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 11:18:39,140 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 11:18:39,140 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 11:18:39,140 INFO L290 TraceCheckUtils]: 8: Hoare triple {1690#true} assume !(0 != ~p1~0); {1690#true} is VALID [2022-04-15 11:18:39,140 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 11:18:39,141 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 11:18:39,141 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 11:18:39,141 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 11:18:39,142 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 11:18:39,142 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 11:18:39,142 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 11:18:39,143 INFO L290 TraceCheckUtils]: 16: Hoare triple {1695#(= main_~lk2~0 1)} assume 1 != ~lk2~0; {1691#false} is VALID [2022-04-15 11:18:39,143 INFO L290 TraceCheckUtils]: 17: Hoare triple {1691#false} assume !false; {1691#false} is VALID [2022-04-15 11:18:39,144 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 11:18:39,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:18:39,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902239019] [2022-04-15 11:18:39,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902239019] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:39,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:39,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:39,144 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:18:39,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [928920101] [2022-04-15 11:18:39,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [928920101] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:39,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:39,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:39,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839064594] [2022-04-15 11:18:39,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:18:39,145 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 11:18:39,145 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:18:39,146 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 11:18:39,158 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 11:18:39,158 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:18:39,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:39,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:18:39,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:18:39,159 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 11:18:39,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:39,248 INFO L93 Difference]: Finished difference Result 111 states and 179 transitions. [2022-04-15 11:18:39,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:18:39,249 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 11:18:39,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:18:39,249 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 11:18:39,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2022-04-15 11:18:39,250 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 11:18:39,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2022-04-15 11:18:39,251 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 76 transitions. [2022-04-15 11:18:39,302 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 11:18:39,304 INFO L225 Difference]: With dead ends: 111 [2022-04-15 11:18:39,304 INFO L226 Difference]: Without dead ends: 109 [2022-04-15 11:18:39,304 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 11:18:39,305 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 11:18:39,306 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 11:18:39,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-04-15 11:18:39,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 87. [2022-04-15 11:18:39,321 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:18:39,321 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 11:18:39,321 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 11:18:39,321 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 11:18:39,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:39,324 INFO L93 Difference]: Finished difference Result 109 states and 176 transitions. [2022-04-15 11:18:39,324 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 176 transitions. [2022-04-15 11:18:39,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:39,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:39,325 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 11:18:39,325 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 11:18:39,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:39,328 INFO L93 Difference]: Finished difference Result 109 states and 176 transitions. [2022-04-15 11:18:39,328 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 176 transitions. [2022-04-15 11:18:39,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:39,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:39,328 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:18:39,328 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:18:39,329 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 11:18:39,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 139 transitions. [2022-04-15 11:18:39,330 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 139 transitions. Word has length 18 [2022-04-15 11:18:39,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:18:39,331 INFO L478 AbstractCegarLoop]: Abstraction has 87 states and 139 transitions. [2022-04-15 11:18:39,331 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 11:18:39,331 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 87 states and 139 transitions. [2022-04-15 11:18:39,456 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 11:18:39,457 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 139 transitions. [2022-04-15 11:18:39,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 11:18:39,457 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:18:39,457 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 11:18:39,457 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 11:18:39,457 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:18:39,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:18:39,458 INFO L85 PathProgramCache]: Analyzing trace with hash 773471640, now seen corresponding path program 1 times [2022-04-15 11:18:39,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:39,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1144121178] [2022-04-15 11:18:39,458 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:18:39,458 INFO L85 PathProgramCache]: Analyzing trace with hash 773471640, now seen corresponding path program 2 times [2022-04-15 11:18:39,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:18:39,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458287601] [2022-04-15 11:18:39,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:18:39,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:18:39,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:39,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:18:39,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:39,496 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 11:18:39,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {2316#true} assume true; {2316#true} is VALID [2022-04-15 11:18:39,496 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2316#true} {2316#true} #132#return; {2316#true} is VALID [2022-04-15 11:18:39,497 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 11:18:39,497 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 11:18:39,497 INFO L290 TraceCheckUtils]: 2: Hoare triple {2316#true} assume true; {2316#true} is VALID [2022-04-15 11:18:39,497 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2316#true} {2316#true} #132#return; {2316#true} is VALID [2022-04-15 11:18:39,497 INFO L272 TraceCheckUtils]: 4: Hoare triple {2316#true} call #t~ret11 := main(); {2316#true} is VALID [2022-04-15 11:18:39,498 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 11:18:39,498 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 11:18:39,498 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 11:18:39,499 INFO L290 TraceCheckUtils]: 8: Hoare triple {2316#true} assume !(0 != ~p1~0); {2316#true} is VALID [2022-04-15 11:18:39,499 INFO L290 TraceCheckUtils]: 9: Hoare triple {2316#true} assume !(0 != ~p2~0); {2316#true} is VALID [2022-04-15 11:18:39,500 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 11:18:39,501 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 11:18:39,501 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 11:18:39,508 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 11:18:39,508 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 11:18:39,509 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 11:18:39,509 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 11:18:39,509 INFO L290 TraceCheckUtils]: 17: Hoare triple {2321#(= main_~lk3~0 1)} assume 1 != ~lk3~0; {2317#false} is VALID [2022-04-15 11:18:39,509 INFO L290 TraceCheckUtils]: 18: Hoare triple {2317#false} assume !false; {2317#false} is VALID [2022-04-15 11:18:39,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:18:39,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:18:39,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458287601] [2022-04-15 11:18:39,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458287601] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:39,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:39,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:39,510 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:18:39,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1144121178] [2022-04-15 11:18:39,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1144121178] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:39,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:39,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:39,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618172331] [2022-04-15 11:18:39,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:18:39,511 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 11:18:39,511 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:18:39,511 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 11:18:39,524 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 11:18:39,524 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:18:39,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:39,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:18:39,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:18:39,524 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 11:18:39,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:39,615 INFO L93 Difference]: Finished difference Result 155 states and 251 transitions. [2022-04-15 11:18:39,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:18:39,615 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 11:18:39,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:18:39,615 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 11:18:39,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2022-04-15 11:18:39,617 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 11:18:39,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2022-04-15 11:18:39,617 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 75 transitions. [2022-04-15 11:18:39,660 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 11:18:39,663 INFO L225 Difference]: With dead ends: 155 [2022-04-15 11:18:39,663 INFO L226 Difference]: Without dead ends: 153 [2022-04-15 11:18:39,663 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 11:18:39,664 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 11:18:39,664 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 11:18:39,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-04-15 11:18:39,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 119. [2022-04-15 11:18:39,683 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:18:39,684 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 11:18:39,684 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 11:18:39,684 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 11:18:39,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:39,688 INFO L93 Difference]: Finished difference Result 153 states and 246 transitions. [2022-04-15 11:18:39,688 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 246 transitions. [2022-04-15 11:18:39,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:39,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:39,689 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 11:18:39,689 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 11:18:39,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:39,692 INFO L93 Difference]: Finished difference Result 153 states and 246 transitions. [2022-04-15 11:18:39,692 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 246 transitions. [2022-04-15 11:18:39,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:39,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:39,693 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:18:39,693 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:18:39,693 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 11:18:39,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 189 transitions. [2022-04-15 11:18:39,695 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 189 transitions. Word has length 19 [2022-04-15 11:18:39,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:18:39,696 INFO L478 AbstractCegarLoop]: Abstraction has 119 states and 189 transitions. [2022-04-15 11:18:39,696 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 11:18:39,696 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 119 states and 189 transitions. [2022-04-15 11:18:39,859 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 11:18:39,860 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 189 transitions. [2022-04-15 11:18:39,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 11:18:39,860 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:18:39,860 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 11:18:39,861 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 11:18:39,861 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:18:39,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:18:39,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1453530010, now seen corresponding path program 1 times [2022-04-15 11:18:39,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:39,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2100059098] [2022-04-15 11:18:39,862 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:18:39,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1453530010, now seen corresponding path program 2 times [2022-04-15 11:18:39,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:18:39,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096620597] [2022-04-15 11:18:39,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:18:39,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:18:39,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:39,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:18:39,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:39,900 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 11:18:39,900 INFO L290 TraceCheckUtils]: 1: Hoare triple {3182#true} assume true; {3182#true} is VALID [2022-04-15 11:18:39,901 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3182#true} {3182#true} #132#return; {3182#true} is VALID [2022-04-15 11:18:39,901 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 11:18:39,901 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 11:18:39,901 INFO L290 TraceCheckUtils]: 2: Hoare triple {3182#true} assume true; {3182#true} is VALID [2022-04-15 11:18:39,901 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3182#true} {3182#true} #132#return; {3182#true} is VALID [2022-04-15 11:18:39,901 INFO L272 TraceCheckUtils]: 4: Hoare triple {3182#true} call #t~ret11 := main(); {3182#true} is VALID [2022-04-15 11:18:39,902 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 11:18:39,902 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 11:18:39,902 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 11:18:39,902 INFO L290 TraceCheckUtils]: 8: Hoare triple {3182#true} assume !(0 != ~p1~0); {3182#true} is VALID [2022-04-15 11:18:39,902 INFO L290 TraceCheckUtils]: 9: Hoare triple {3182#true} assume !(0 != ~p2~0); {3182#true} is VALID [2022-04-15 11:18:39,902 INFO L290 TraceCheckUtils]: 10: Hoare triple {3182#true} assume !(0 != ~p3~0); {3187#(= main_~p3~0 0)} is VALID [2022-04-15 11:18:39,902 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 11:18:39,903 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 11:18:39,903 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 11:18:39,903 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 11:18:39,904 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 11:18:39,904 INFO L290 TraceCheckUtils]: 16: Hoare triple {3187#(= main_~p3~0 0)} assume 0 != ~p3~0; {3183#false} is VALID [2022-04-15 11:18:39,904 INFO L290 TraceCheckUtils]: 17: Hoare triple {3183#false} assume 1 != ~lk3~0; {3183#false} is VALID [2022-04-15 11:18:39,904 INFO L290 TraceCheckUtils]: 18: Hoare triple {3183#false} assume !false; {3183#false} is VALID [2022-04-15 11:18:39,904 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 11:18:39,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:18:39,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096620597] [2022-04-15 11:18:39,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096620597] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:39,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:39,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:39,905 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:18:39,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2100059098] [2022-04-15 11:18:39,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2100059098] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:39,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:39,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:39,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126694855] [2022-04-15 11:18:39,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:18:39,905 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 11:18:39,906 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:18:39,906 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 11:18:39,916 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 11:18:39,917 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:18:39,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:39,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:18:39,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:18:39,917 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 11:18:40,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:40,028 INFO L93 Difference]: Finished difference Result 271 states and 435 transitions. [2022-04-15 11:18:40,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:18:40,028 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 11:18:40,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:18:40,029 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 11:18:40,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2022-04-15 11:18:40,030 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 11:18:40,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2022-04-15 11:18:40,031 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 114 transitions. [2022-04-15 11:18:40,096 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 11:18:40,098 INFO L225 Difference]: With dead ends: 271 [2022-04-15 11:18:40,098 INFO L226 Difference]: Without dead ends: 161 [2022-04-15 11:18:40,099 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 11:18:40,099 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 11:18:40,100 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 11:18:40,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-04-15 11:18:40,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 159. [2022-04-15 11:18:40,109 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:18:40,109 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 11:18:40,110 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 11:18:40,110 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 11:18:40,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:40,113 INFO L93 Difference]: Finished difference Result 161 states and 248 transitions. [2022-04-15 11:18:40,113 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 248 transitions. [2022-04-15 11:18:40,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:40,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:40,114 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 11:18:40,114 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 11:18:40,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:40,117 INFO L93 Difference]: Finished difference Result 161 states and 248 transitions. [2022-04-15 11:18:40,117 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 248 transitions. [2022-04-15 11:18:40,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:40,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:40,118 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:18:40,118 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:18:40,118 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 11:18:40,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 247 transitions. [2022-04-15 11:18:40,122 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 247 transitions. Word has length 19 [2022-04-15 11:18:40,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:18:40,122 INFO L478 AbstractCegarLoop]: Abstraction has 159 states and 247 transitions. [2022-04-15 11:18:40,122 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 11:18:40,122 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 159 states and 247 transitions. [2022-04-15 11:18:40,332 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 11:18:40,332 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 247 transitions. [2022-04-15 11:18:40,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 11:18:40,333 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:18:40,333 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 11:18:40,333 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-15 11:18:40,333 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:18:40,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:18:40,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1791967575, now seen corresponding path program 1 times [2022-04-15 11:18:40,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:40,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [676676893] [2022-04-15 11:18:40,334 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:18:40,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1791967575, now seen corresponding path program 2 times [2022-04-15 11:18:40,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:18:40,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273303147] [2022-04-15 11:18:40,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:18:40,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:18:40,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:40,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:18:40,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:40,364 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 11:18:40,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {4376#true} assume true; {4376#true} is VALID [2022-04-15 11:18:40,364 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4376#true} {4376#true} #132#return; {4376#true} is VALID [2022-04-15 11:18:40,365 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 11:18:40,365 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 11:18:40,365 INFO L290 TraceCheckUtils]: 2: Hoare triple {4376#true} assume true; {4376#true} is VALID [2022-04-15 11:18:40,365 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4376#true} {4376#true} #132#return; {4376#true} is VALID [2022-04-15 11:18:40,365 INFO L272 TraceCheckUtils]: 4: Hoare triple {4376#true} call #t~ret11 := main(); {4376#true} is VALID [2022-04-15 11:18:40,365 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 11:18:40,365 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 11:18:40,366 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 11:18:40,366 INFO L290 TraceCheckUtils]: 8: Hoare triple {4376#true} assume !(0 != ~p1~0); {4376#true} is VALID [2022-04-15 11:18:40,366 INFO L290 TraceCheckUtils]: 9: Hoare triple {4376#true} assume !(0 != ~p2~0); {4376#true} is VALID [2022-04-15 11:18:40,366 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 11:18:40,366 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 11:18:40,367 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 11:18:40,367 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 11:18:40,367 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 11:18:40,367 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 11:18:40,368 INFO L290 TraceCheckUtils]: 16: Hoare triple {4381#(not (= main_~p3~0 0))} assume !(0 != ~p3~0); {4377#false} is VALID [2022-04-15 11:18:40,368 INFO L290 TraceCheckUtils]: 17: Hoare triple {4377#false} assume 0 != ~p4~0; {4377#false} is VALID [2022-04-15 11:18:40,368 INFO L290 TraceCheckUtils]: 18: Hoare triple {4377#false} assume 1 != ~lk4~0; {4377#false} is VALID [2022-04-15 11:18:40,368 INFO L290 TraceCheckUtils]: 19: Hoare triple {4377#false} assume !false; {4377#false} is VALID [2022-04-15 11:18:40,368 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 11:18:40,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:18:40,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273303147] [2022-04-15 11:18:40,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273303147] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:40,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:40,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:40,369 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:18:40,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [676676893] [2022-04-15 11:18:40,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [676676893] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:40,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:40,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:40,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100168086] [2022-04-15 11:18:40,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:18:40,369 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 11:18:40,370 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:18:40,370 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 11:18:40,380 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 11:18:40,380 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:18:40,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:40,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:18:40,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:18:40,381 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 11:18:40,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:40,479 INFO L93 Difference]: Finished difference Result 241 states and 373 transitions. [2022-04-15 11:18:40,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:18:40,480 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 11:18:40,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:18:40,480 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 11:18:40,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2022-04-15 11:18:40,481 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 11:18:40,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2022-04-15 11:18:40,482 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 109 transitions. [2022-04-15 11:18:40,556 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 11:18:40,558 INFO L225 Difference]: With dead ends: 241 [2022-04-15 11:18:40,558 INFO L226 Difference]: Without dead ends: 167 [2022-04-15 11:18:40,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 11:18:40,559 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 11:18:40,559 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 11:18:40,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-04-15 11:18:40,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2022-04-15 11:18:40,569 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:18:40,570 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 11:18:40,570 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 11:18:40,570 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 11:18:40,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:40,575 INFO L93 Difference]: Finished difference Result 167 states and 252 transitions. [2022-04-15 11:18:40,575 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 252 transitions. [2022-04-15 11:18:40,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:40,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:40,576 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 11:18:40,576 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 11:18:40,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:40,582 INFO L93 Difference]: Finished difference Result 167 states and 252 transitions. [2022-04-15 11:18:40,582 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 252 transitions. [2022-04-15 11:18:40,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:40,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:40,582 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:18:40,582 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:18:40,582 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 11:18:40,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 251 transitions. [2022-04-15 11:18:40,588 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 251 transitions. Word has length 20 [2022-04-15 11:18:40,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:18:40,588 INFO L478 AbstractCegarLoop]: Abstraction has 165 states and 251 transitions. [2022-04-15 11:18:40,588 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 11:18:40,588 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 165 states and 251 transitions. [2022-04-15 11:18:40,811 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 11:18:40,811 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 251 transitions. [2022-04-15 11:18:40,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 11:18:40,811 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:18:40,811 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 11:18:40,811 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-15 11:18:40,812 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:18:40,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:18:40,812 INFO L85 PathProgramCache]: Analyzing trace with hash 2109972711, now seen corresponding path program 1 times [2022-04-15 11:18:40,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:40,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [951510788] [2022-04-15 11:18:40,812 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:18:40,812 INFO L85 PathProgramCache]: Analyzing trace with hash 2109972711, now seen corresponding path program 2 times [2022-04-15 11:18:40,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:18:40,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577255313] [2022-04-15 11:18:40,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:18:40,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:18:40,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:40,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:18:40,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:40,850 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 11:18:40,850 INFO L290 TraceCheckUtils]: 1: Hoare triple {5534#true} assume true; {5534#true} is VALID [2022-04-15 11:18:40,850 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5534#true} {5534#true} #132#return; {5534#true} is VALID [2022-04-15 11:18:40,851 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 11:18:40,851 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 11:18:40,851 INFO L290 TraceCheckUtils]: 2: Hoare triple {5534#true} assume true; {5534#true} is VALID [2022-04-15 11:18:40,851 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5534#true} {5534#true} #132#return; {5534#true} is VALID [2022-04-15 11:18:40,851 INFO L272 TraceCheckUtils]: 4: Hoare triple {5534#true} call #t~ret11 := main(); {5534#true} is VALID [2022-04-15 11:18:40,851 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 11:18:40,851 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 11:18:40,852 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 11:18:40,852 INFO L290 TraceCheckUtils]: 8: Hoare triple {5534#true} assume !(0 != ~p1~0); {5534#true} is VALID [2022-04-15 11:18:40,852 INFO L290 TraceCheckUtils]: 9: Hoare triple {5534#true} assume !(0 != ~p2~0); {5534#true} is VALID [2022-04-15 11:18:40,852 INFO L290 TraceCheckUtils]: 10: Hoare triple {5534#true} assume !(0 != ~p3~0); {5534#true} is VALID [2022-04-15 11:18:40,852 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 11:18:40,852 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 11:18:40,853 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 11:18:40,853 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 11:18:40,853 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 11:18:40,854 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 11:18:40,854 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 11:18:40,854 INFO L290 TraceCheckUtils]: 18: Hoare triple {5539#(= main_~lk4~0 1)} assume 1 != ~lk4~0; {5535#false} is VALID [2022-04-15 11:18:40,854 INFO L290 TraceCheckUtils]: 19: Hoare triple {5535#false} assume !false; {5535#false} is VALID [2022-04-15 11:18:40,855 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 11:18:40,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:18:40,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577255313] [2022-04-15 11:18:40,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577255313] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:40,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:40,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:40,855 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:18:40,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [951510788] [2022-04-15 11:18:40,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [951510788] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:40,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:40,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:40,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504017285] [2022-04-15 11:18:40,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:18:40,856 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 11:18:40,856 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:18:40,856 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 11:18:40,867 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 11:18:40,868 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:18:40,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:40,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:18:40,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:18:40,868 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 11:18:40,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:40,981 INFO L93 Difference]: Finished difference Result 285 states and 437 transitions. [2022-04-15 11:18:40,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:18:40,982 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 11:18:40,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:18:40,982 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 11:18:40,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2022-04-15 11:18:40,983 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 11:18:40,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2022-04-15 11:18:40,983 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 71 transitions. [2022-04-15 11:18:41,031 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 11:18:41,036 INFO L225 Difference]: With dead ends: 285 [2022-04-15 11:18:41,036 INFO L226 Difference]: Without dead ends: 283 [2022-04-15 11:18:41,036 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 11:18:41,037 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 11:18:41,037 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 11:18:41,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2022-04-15 11:18:41,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 233. [2022-04-15 11:18:41,050 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:18:41,051 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 11:18:41,051 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 11:18:41,051 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 11:18:41,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:41,056 INFO L93 Difference]: Finished difference Result 283 states and 428 transitions. [2022-04-15 11:18:41,056 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 428 transitions. [2022-04-15 11:18:41,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:41,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:41,057 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 11:18:41,057 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 11:18:41,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:41,062 INFO L93 Difference]: Finished difference Result 283 states and 428 transitions. [2022-04-15 11:18:41,062 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 428 transitions. [2022-04-15 11:18:41,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:41,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:41,062 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:18:41,062 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:18:41,063 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 11:18:41,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 347 transitions. [2022-04-15 11:18:41,066 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 347 transitions. Word has length 20 [2022-04-15 11:18:41,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:18:41,066 INFO L478 AbstractCegarLoop]: Abstraction has 233 states and 347 transitions. [2022-04-15 11:18:41,066 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 11:18:41,066 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 233 states and 347 transitions. [2022-04-15 11:18:41,392 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 11:18:41,392 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 347 transitions. [2022-04-15 11:18:41,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 11:18:41,393 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:18:41,393 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 11:18:41,393 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-15 11:18:41,393 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:18:41,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:18:41,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1504936215, now seen corresponding path program 1 times [2022-04-15 11:18:41,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:41,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [880957943] [2022-04-15 11:18:41,394 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:18:41,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1504936215, now seen corresponding path program 2 times [2022-04-15 11:18:41,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:18:41,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465059558] [2022-04-15 11:18:41,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:18:41,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:18:41,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:41,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:18:41,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:41,419 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 11:18:41,419 INFO L290 TraceCheckUtils]: 1: Hoare triple {7148#true} assume true; {7148#true} is VALID [2022-04-15 11:18:41,420 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7148#true} {7148#true} #132#return; {7148#true} is VALID [2022-04-15 11:18:41,420 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 11:18:41,420 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 11:18:41,420 INFO L290 TraceCheckUtils]: 2: Hoare triple {7148#true} assume true; {7148#true} is VALID [2022-04-15 11:18:41,420 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7148#true} {7148#true} #132#return; {7148#true} is VALID [2022-04-15 11:18:41,420 INFO L272 TraceCheckUtils]: 4: Hoare triple {7148#true} call #t~ret11 := main(); {7148#true} is VALID [2022-04-15 11:18:41,420 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 11:18:41,421 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 11:18:41,421 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 11:18:41,421 INFO L290 TraceCheckUtils]: 8: Hoare triple {7148#true} assume !(0 != ~p1~0); {7148#true} is VALID [2022-04-15 11:18:41,421 INFO L290 TraceCheckUtils]: 9: Hoare triple {7148#true} assume !(0 != ~p2~0); {7148#true} is VALID [2022-04-15 11:18:41,421 INFO L290 TraceCheckUtils]: 10: Hoare triple {7148#true} assume !(0 != ~p3~0); {7148#true} is VALID [2022-04-15 11:18:41,421 INFO L290 TraceCheckUtils]: 11: Hoare triple {7148#true} assume !(0 != ~p4~0); {7153#(= main_~p4~0 0)} is VALID [2022-04-15 11:18:41,421 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 11:18:41,422 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 11:18:41,422 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 11:18:41,422 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 11:18:41,423 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 11:18:41,423 INFO L290 TraceCheckUtils]: 17: Hoare triple {7153#(= main_~p4~0 0)} assume 0 != ~p4~0; {7149#false} is VALID [2022-04-15 11:18:41,423 INFO L290 TraceCheckUtils]: 18: Hoare triple {7149#false} assume 1 != ~lk4~0; {7149#false} is VALID [2022-04-15 11:18:41,423 INFO L290 TraceCheckUtils]: 19: Hoare triple {7149#false} assume !false; {7149#false} is VALID [2022-04-15 11:18:41,427 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 11:18:41,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:18:41,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465059558] [2022-04-15 11:18:41,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465059558] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:41,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:41,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:41,428 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:18:41,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [880957943] [2022-04-15 11:18:41,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [880957943] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:41,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:41,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:41,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14715040] [2022-04-15 11:18:41,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:18:41,428 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 11:18:41,429 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:18:41,429 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 11:18:41,439 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 11:18:41,439 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:18:41,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:41,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:18:41,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:18:41,440 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 11:18:41,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:41,562 INFO L93 Difference]: Finished difference Result 525 states and 781 transitions. [2022-04-15 11:18:41,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:18:41,562 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 11:18:41,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:18:41,563 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 11:18:41,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2022-04-15 11:18:41,564 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 11:18:41,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2022-04-15 11:18:41,564 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 111 transitions. [2022-04-15 11:18:41,636 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 11:18:41,640 INFO L225 Difference]: With dead ends: 525 [2022-04-15 11:18:41,640 INFO L226 Difference]: Without dead ends: 307 [2022-04-15 11:18:41,641 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 11:18:41,641 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 11:18:41,642 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 11:18:41,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2022-04-15 11:18:41,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 305. [2022-04-15 11:18:41,658 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:18:41,658 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 11:18:41,658 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 11:18:41,659 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 11:18:41,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:41,663 INFO L93 Difference]: Finished difference Result 307 states and 440 transitions. [2022-04-15 11:18:41,663 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 440 transitions. [2022-04-15 11:18:41,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:41,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:41,664 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 11:18:41,664 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 11:18:41,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:41,669 INFO L93 Difference]: Finished difference Result 307 states and 440 transitions. [2022-04-15 11:18:41,669 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 440 transitions. [2022-04-15 11:18:41,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:41,670 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:41,670 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:18:41,670 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:18:41,670 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 11:18:41,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 439 transitions. [2022-04-15 11:18:41,675 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 439 transitions. Word has length 20 [2022-04-15 11:18:41,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:18:41,675 INFO L478 AbstractCegarLoop]: Abstraction has 305 states and 439 transitions. [2022-04-15 11:18:41,675 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 11:18:41,675 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 305 states and 439 transitions. [2022-04-15 11:18:42,084 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 11:18:42,084 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 439 transitions. [2022-04-15 11:18:42,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 11:18:42,084 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:18:42,085 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 11:18:42,085 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-15 11:18:42,085 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:18:42,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:18:42,085 INFO L85 PathProgramCache]: Analyzing trace with hash 984860303, now seen corresponding path program 1 times [2022-04-15 11:18:42,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:42,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1159028516] [2022-04-15 11:18:42,086 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:18:42,086 INFO L85 PathProgramCache]: Analyzing trace with hash 984860303, now seen corresponding path program 2 times [2022-04-15 11:18:42,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:18:42,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507720307] [2022-04-15 11:18:42,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:18:42,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:18:42,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:42,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:18:42,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:42,120 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 11:18:42,120 INFO L290 TraceCheckUtils]: 1: Hoare triple {9434#true} assume true; {9434#true} is VALID [2022-04-15 11:18:42,120 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9434#true} {9434#true} #132#return; {9434#true} is VALID [2022-04-15 11:18:42,121 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 11:18:42,121 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 11:18:42,121 INFO L290 TraceCheckUtils]: 2: Hoare triple {9434#true} assume true; {9434#true} is VALID [2022-04-15 11:18:42,121 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9434#true} {9434#true} #132#return; {9434#true} is VALID [2022-04-15 11:18:42,121 INFO L272 TraceCheckUtils]: 4: Hoare triple {9434#true} call #t~ret11 := main(); {9434#true} is VALID [2022-04-15 11:18:42,121 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 11:18:42,122 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 11:18:42,122 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 11:18:42,122 INFO L290 TraceCheckUtils]: 8: Hoare triple {9434#true} assume !(0 != ~p1~0); {9434#true} is VALID [2022-04-15 11:18:42,122 INFO L290 TraceCheckUtils]: 9: Hoare triple {9434#true} assume !(0 != ~p2~0); {9434#true} is VALID [2022-04-15 11:18:42,122 INFO L290 TraceCheckUtils]: 10: Hoare triple {9434#true} assume !(0 != ~p3~0); {9434#true} is VALID [2022-04-15 11:18:42,123 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 11:18:42,123 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 11:18:42,124 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 11:18:42,124 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 11:18:42,124 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 11:18:42,125 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 11:18:42,125 INFO L290 TraceCheckUtils]: 17: Hoare triple {9439#(not (= main_~p4~0 0))} assume !(0 != ~p4~0); {9435#false} is VALID [2022-04-15 11:18:42,125 INFO L290 TraceCheckUtils]: 18: Hoare triple {9435#false} assume 0 != ~p5~0; {9435#false} is VALID [2022-04-15 11:18:42,125 INFO L290 TraceCheckUtils]: 19: Hoare triple {9435#false} assume 1 != ~lk5~0; {9435#false} is VALID [2022-04-15 11:18:42,125 INFO L290 TraceCheckUtils]: 20: Hoare triple {9435#false} assume !false; {9435#false} is VALID [2022-04-15 11:18:42,125 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 11:18:42,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:18:42,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507720307] [2022-04-15 11:18:42,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507720307] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:42,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:42,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:42,126 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:18:42,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1159028516] [2022-04-15 11:18:42,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1159028516] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:42,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:42,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:42,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499333601] [2022-04-15 11:18:42,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:18:42,127 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 11:18:42,127 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:18:42,127 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 11:18:42,139 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 11:18:42,139 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:18:42,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:42,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:18:42,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:18:42,140 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 11:18:42,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:42,245 INFO L93 Difference]: Finished difference Result 457 states and 653 transitions. [2022-04-15 11:18:42,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:18:42,245 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 11:18:42,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:18:42,245 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 11:18:42,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2022-04-15 11:18:42,247 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 11:18:42,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2022-04-15 11:18:42,247 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 106 transitions. [2022-04-15 11:18:42,308 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 11:18:42,313 INFO L225 Difference]: With dead ends: 457 [2022-04-15 11:18:42,313 INFO L226 Difference]: Without dead ends: 315 [2022-04-15 11:18:42,314 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 11:18:42,314 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 11:18:42,314 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 11:18:42,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2022-04-15 11:18:42,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 313. [2022-04-15 11:18:42,331 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:18:42,331 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 11:18:42,332 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 11:18:42,332 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 11:18:42,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:42,337 INFO L93 Difference]: Finished difference Result 315 states and 440 transitions. [2022-04-15 11:18:42,337 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 440 transitions. [2022-04-15 11:18:42,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:42,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:42,338 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 11:18:42,338 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 11:18:42,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:42,343 INFO L93 Difference]: Finished difference Result 315 states and 440 transitions. [2022-04-15 11:18:42,343 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 440 transitions. [2022-04-15 11:18:42,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:42,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:42,343 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:18:42,344 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:18:42,344 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 11:18:42,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 439 transitions. [2022-04-15 11:18:42,349 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 439 transitions. Word has length 21 [2022-04-15 11:18:42,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:18:42,349 INFO L478 AbstractCegarLoop]: Abstraction has 313 states and 439 transitions. [2022-04-15 11:18:42,349 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 11:18:42,349 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 313 states and 439 transitions. [2022-04-15 11:18:42,761 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 11:18:42,762 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 439 transitions. [2022-04-15 11:18:42,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 11:18:42,762 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:18:42,762 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 11:18:42,763 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-15 11:18:42,763 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:18:42,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:18:42,763 INFO L85 PathProgramCache]: Analyzing trace with hash 591833293, now seen corresponding path program 1 times [2022-04-15 11:18:42,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:42,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1759000805] [2022-04-15 11:18:42,764 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:18:42,764 INFO L85 PathProgramCache]: Analyzing trace with hash 591833293, now seen corresponding path program 2 times [2022-04-15 11:18:42,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:18:42,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599470109] [2022-04-15 11:18:42,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:18:42,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:18:42,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:42,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:18:42,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:42,791 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 11:18:42,791 INFO L290 TraceCheckUtils]: 1: Hoare triple {11616#true} assume true; {11616#true} is VALID [2022-04-15 11:18:42,791 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11616#true} {11616#true} #132#return; {11616#true} is VALID [2022-04-15 11:18:42,792 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 11:18:42,792 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 11:18:42,792 INFO L290 TraceCheckUtils]: 2: Hoare triple {11616#true} assume true; {11616#true} is VALID [2022-04-15 11:18:42,792 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11616#true} {11616#true} #132#return; {11616#true} is VALID [2022-04-15 11:18:42,793 INFO L272 TraceCheckUtils]: 4: Hoare triple {11616#true} call #t~ret11 := main(); {11616#true} is VALID [2022-04-15 11:18:42,793 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 11:18:42,793 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 11:18:42,793 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 11:18:42,793 INFO L290 TraceCheckUtils]: 8: Hoare triple {11616#true} assume !(0 != ~p1~0); {11616#true} is VALID [2022-04-15 11:18:42,793 INFO L290 TraceCheckUtils]: 9: Hoare triple {11616#true} assume !(0 != ~p2~0); {11616#true} is VALID [2022-04-15 11:18:42,793 INFO L290 TraceCheckUtils]: 10: Hoare triple {11616#true} assume !(0 != ~p3~0); {11616#true} is VALID [2022-04-15 11:18:42,794 INFO L290 TraceCheckUtils]: 11: Hoare triple {11616#true} assume !(0 != ~p4~0); {11616#true} is VALID [2022-04-15 11:18:42,794 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 11:18:42,794 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 11:18:42,795 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 11:18:42,795 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 11:18:42,795 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 11:18:42,796 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 11:18:42,796 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 11:18:42,796 INFO L290 TraceCheckUtils]: 19: Hoare triple {11621#(= main_~lk5~0 1)} assume 1 != ~lk5~0; {11617#false} is VALID [2022-04-15 11:18:42,796 INFO L290 TraceCheckUtils]: 20: Hoare triple {11617#false} assume !false; {11617#false} is VALID [2022-04-15 11:18:42,797 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 11:18:42,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:18:42,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599470109] [2022-04-15 11:18:42,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599470109] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:42,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:42,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:42,797 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:18:42,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1759000805] [2022-04-15 11:18:42,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1759000805] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:42,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:42,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:42,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098110799] [2022-04-15 11:18:42,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:18:42,798 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 11:18:42,798 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:18:42,798 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 11:18:42,810 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 11:18:42,810 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:18:42,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:42,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:18:42,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:18:42,810 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 11:18:42,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:42,916 INFO L93 Difference]: Finished difference Result 525 states and 737 transitions. [2022-04-15 11:18:42,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:18:42,916 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 11:18:42,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:18:42,916 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 11:18:42,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2022-04-15 11:18:42,917 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 11:18:42,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2022-04-15 11:18:42,918 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 67 transitions. [2022-04-15 11:18:42,956 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 11:18:42,968 INFO L225 Difference]: With dead ends: 525 [2022-04-15 11:18:42,968 INFO L226 Difference]: Without dead ends: 523 [2022-04-15 11:18:42,968 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 11:18:42,968 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 11:18:42,969 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 11:18:42,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2022-04-15 11:18:42,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 457. [2022-04-15 11:18:42,992 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:18:42,992 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 11:18:42,993 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 11:18:42,993 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 11:18:43,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:43,004 INFO L93 Difference]: Finished difference Result 523 states and 720 transitions. [2022-04-15 11:18:43,004 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 720 transitions. [2022-04-15 11:18:43,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:43,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:43,005 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 11:18:43,006 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 11:18:43,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:43,016 INFO L93 Difference]: Finished difference Result 523 states and 720 transitions. [2022-04-15 11:18:43,016 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 720 transitions. [2022-04-15 11:18:43,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:43,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:43,017 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:18:43,017 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:18:43,017 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 11:18:43,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 623 transitions. [2022-04-15 11:18:43,027 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 623 transitions. Word has length 21 [2022-04-15 11:18:43,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:18:43,027 INFO L478 AbstractCegarLoop]: Abstraction has 457 states and 623 transitions. [2022-04-15 11:18:43,028 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 11:18:43,028 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 457 states and 623 transitions. [2022-04-15 11:18:43,589 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 11:18:43,589 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 623 transitions. [2022-04-15 11:18:43,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 11:18:43,590 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:18:43,590 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 11:18:43,590 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-15 11:18:43,590 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:18:43,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:18:43,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1271891663, now seen corresponding path program 1 times [2022-04-15 11:18:43,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:43,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [538662709] [2022-04-15 11:18:43,591 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:18:43,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1271891663, now seen corresponding path program 2 times [2022-04-15 11:18:43,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:18:43,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539042060] [2022-04-15 11:18:43,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:18:43,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:18:43,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:43,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:18:43,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:43,650 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 11:18:43,650 INFO L290 TraceCheckUtils]: 1: Hoare triple {14638#true} assume true; {14638#true} is VALID [2022-04-15 11:18:43,650 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14638#true} {14638#true} #132#return; {14638#true} is VALID [2022-04-15 11:18:43,651 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 11:18:43,651 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 11:18:43,651 INFO L290 TraceCheckUtils]: 2: Hoare triple {14638#true} assume true; {14638#true} is VALID [2022-04-15 11:18:43,652 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14638#true} {14638#true} #132#return; {14638#true} is VALID [2022-04-15 11:18:43,652 INFO L272 TraceCheckUtils]: 4: Hoare triple {14638#true} call #t~ret11 := main(); {14638#true} is VALID [2022-04-15 11:18:43,652 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 11:18:43,652 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 11:18:43,652 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 11:18:43,652 INFO L290 TraceCheckUtils]: 8: Hoare triple {14638#true} assume !(0 != ~p1~0); {14638#true} is VALID [2022-04-15 11:18:43,652 INFO L290 TraceCheckUtils]: 9: Hoare triple {14638#true} assume !(0 != ~p2~0); {14638#true} is VALID [2022-04-15 11:18:43,653 INFO L290 TraceCheckUtils]: 10: Hoare triple {14638#true} assume !(0 != ~p3~0); {14638#true} is VALID [2022-04-15 11:18:43,653 INFO L290 TraceCheckUtils]: 11: Hoare triple {14638#true} assume !(0 != ~p4~0); {14638#true} is VALID [2022-04-15 11:18:43,653 INFO L290 TraceCheckUtils]: 12: Hoare triple {14638#true} assume !(0 != ~p5~0); {14643#(= main_~p5~0 0)} is VALID [2022-04-15 11:18:43,653 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 11:18:43,654 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 11:18:43,654 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 11:18:43,655 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 11:18:43,655 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 11:18:43,655 INFO L290 TraceCheckUtils]: 18: Hoare triple {14643#(= main_~p5~0 0)} assume 0 != ~p5~0; {14639#false} is VALID [2022-04-15 11:18:43,655 INFO L290 TraceCheckUtils]: 19: Hoare triple {14639#false} assume 1 != ~lk5~0; {14639#false} is VALID [2022-04-15 11:18:43,656 INFO L290 TraceCheckUtils]: 20: Hoare triple {14639#false} assume !false; {14639#false} is VALID [2022-04-15 11:18:43,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 11:18:43,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:18:43,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539042060] [2022-04-15 11:18:43,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539042060] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:43,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:43,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:43,658 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:18:43,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [538662709] [2022-04-15 11:18:43,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [538662709] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:43,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:43,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:43,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150231083] [2022-04-15 11:18:43,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:18:43,660 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 11:18:43,661 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:18:43,661 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 11:18:43,674 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 11:18:43,675 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:18:43,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:43,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:18:43,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:18:43,675 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 11:18:43,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:43,844 INFO L93 Difference]: Finished difference Result 1021 states and 1377 transitions. [2022-04-15 11:18:43,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:18:43,844 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 11:18:43,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:18:43,845 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 11:18:43,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2022-04-15 11:18:43,846 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 11:18:43,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2022-04-15 11:18:43,848 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 108 transitions. [2022-04-15 11:18:43,914 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 11:18:43,928 INFO L225 Difference]: With dead ends: 1021 [2022-04-15 11:18:43,929 INFO L226 Difference]: Without dead ends: 587 [2022-04-15 11:18:43,929 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 11:18:43,930 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 11:18:43,930 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 11:18:43,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2022-04-15 11:18:43,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 585. [2022-04-15 11:18:43,960 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:18:43,960 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 11:18:43,961 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 11:18:43,962 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 11:18:43,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:43,974 INFO L93 Difference]: Finished difference Result 587 states and 760 transitions. [2022-04-15 11:18:43,974 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 760 transitions. [2022-04-15 11:18:43,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:43,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:43,977 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 11:18:43,977 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 11:18:43,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:43,989 INFO L93 Difference]: Finished difference Result 587 states and 760 transitions. [2022-04-15 11:18:43,989 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 760 transitions. [2022-04-15 11:18:43,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:43,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:43,990 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:18:43,990 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:18:43,991 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 11:18:44,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 759 transitions. [2022-04-15 11:18:44,005 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 759 transitions. Word has length 21 [2022-04-15 11:18:44,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:18:44,005 INFO L478 AbstractCegarLoop]: Abstraction has 585 states and 759 transitions. [2022-04-15 11:18:44,005 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 11:18:44,005 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 585 states and 759 transitions. [2022-04-15 11:18:44,685 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 11:18:44,685 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 759 transitions. [2022-04-15 11:18:44,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 11:18:44,697 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:18:44,697 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 11:18:44,697 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-15 11:18:44,698 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:18:44,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:18:44,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1167178942, now seen corresponding path program 1 times [2022-04-15 11:18:44,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:44,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1668729979] [2022-04-15 11:18:44,698 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:18:44,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1167178942, now seen corresponding path program 2 times [2022-04-15 11:18:44,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:18:44,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989056255] [2022-04-15 11:18:44,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:18:44,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:18:44,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:44,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:18:44,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:44,730 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 11:18:44,730 INFO L290 TraceCheckUtils]: 1: Hoare triple {19036#true} assume true; {19036#true} is VALID [2022-04-15 11:18:44,730 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19036#true} {19036#true} #132#return; {19036#true} is VALID [2022-04-15 11:18:44,730 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 11:18:44,730 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 11:18:44,730 INFO L290 TraceCheckUtils]: 2: Hoare triple {19036#true} assume true; {19036#true} is VALID [2022-04-15 11:18:44,731 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19036#true} {19036#true} #132#return; {19036#true} is VALID [2022-04-15 11:18:44,731 INFO L272 TraceCheckUtils]: 4: Hoare triple {19036#true} call #t~ret11 := main(); {19036#true} is VALID [2022-04-15 11:18:44,731 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 11:18:44,731 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 11:18:44,731 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 11:18:44,731 INFO L290 TraceCheckUtils]: 8: Hoare triple {19036#true} assume !(0 != ~p1~0); {19036#true} is VALID [2022-04-15 11:18:44,731 INFO L290 TraceCheckUtils]: 9: Hoare triple {19036#true} assume !(0 != ~p2~0); {19036#true} is VALID [2022-04-15 11:18:44,731 INFO L290 TraceCheckUtils]: 10: Hoare triple {19036#true} assume !(0 != ~p3~0); {19036#true} is VALID [2022-04-15 11:18:44,731 INFO L290 TraceCheckUtils]: 11: Hoare triple {19036#true} assume !(0 != ~p4~0); {19036#true} is VALID [2022-04-15 11:18:44,732 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 11:18:44,732 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 11:18:44,732 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 11:18:44,732 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 11:18:44,733 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 11:18:44,733 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 11:18:44,733 INFO L290 TraceCheckUtils]: 18: Hoare triple {19041#(not (= main_~p5~0 0))} assume !(0 != ~p5~0); {19037#false} is VALID [2022-04-15 11:18:44,733 INFO L290 TraceCheckUtils]: 19: Hoare triple {19037#false} assume 0 != ~p6~0; {19037#false} is VALID [2022-04-15 11:18:44,733 INFO L290 TraceCheckUtils]: 20: Hoare triple {19037#false} assume 1 != ~lk6~0; {19037#false} is VALID [2022-04-15 11:18:44,734 INFO L290 TraceCheckUtils]: 21: Hoare triple {19037#false} assume !false; {19037#false} is VALID [2022-04-15 11:18:44,734 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 11:18:44,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:18:44,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989056255] [2022-04-15 11:18:44,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989056255] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:44,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:44,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:44,734 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:18:44,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1668729979] [2022-04-15 11:18:44,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1668729979] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:44,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:44,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:44,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187101189] [2022-04-15 11:18:44,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:18:44,735 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 11:18:44,735 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:18:44,735 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 11:18:44,746 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 11:18:44,746 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:18:44,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:44,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:18:44,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:18:44,747 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 11:18:44,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:44,901 INFO L93 Difference]: Finished difference Result 877 states and 1129 transitions. [2022-04-15 11:18:44,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:18:44,902 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 11:18:44,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:18:44,902 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 11:18:44,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2022-04-15 11:18:44,903 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 11:18:44,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2022-04-15 11:18:44,903 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 103 transitions. [2022-04-15 11:18:45,064 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 11:18:45,079 INFO L225 Difference]: With dead ends: 877 [2022-04-15 11:18:45,079 INFO L226 Difference]: Without dead ends: 603 [2022-04-15 11:18:45,079 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 11:18:45,080 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 11:18:45,080 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 11:18:45,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2022-04-15 11:18:45,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 601. [2022-04-15 11:18:45,111 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:18:45,112 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 11:18:45,113 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 11:18:45,113 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 11:18:45,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:45,135 INFO L93 Difference]: Finished difference Result 603 states and 760 transitions. [2022-04-15 11:18:45,136 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 760 transitions. [2022-04-15 11:18:45,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:45,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:45,138 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 11:18:45,138 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 11:18:45,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:45,151 INFO L93 Difference]: Finished difference Result 603 states and 760 transitions. [2022-04-15 11:18:45,151 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 760 transitions. [2022-04-15 11:18:45,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:45,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:45,152 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:18:45,152 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:18:45,153 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 11:18:45,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 759 transitions. [2022-04-15 11:18:45,167 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 759 transitions. Word has length 22 [2022-04-15 11:18:45,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:18:45,168 INFO L478 AbstractCegarLoop]: Abstraction has 601 states and 759 transitions. [2022-04-15 11:18:45,168 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 11:18:45,168 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 601 states and 759 transitions. [2022-04-15 11:18:45,827 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 11:18:45,827 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 759 transitions. [2022-04-15 11:18:45,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 11:18:45,828 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:18:45,828 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 11:18:45,828 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-15 11:18:45,828 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:18:45,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:18:45,829 INFO L85 PathProgramCache]: Analyzing trace with hash 774151932, now seen corresponding path program 1 times [2022-04-15 11:18:45,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:45,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2008286455] [2022-04-15 11:18:45,829 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:18:45,829 INFO L85 PathProgramCache]: Analyzing trace with hash 774151932, now seen corresponding path program 2 times [2022-04-15 11:18:45,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:18:45,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740337015] [2022-04-15 11:18:45,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:18:45,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:18:45,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:45,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:18:45,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:45,872 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 11:18:45,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {23210#true} assume true; {23210#true} is VALID [2022-04-15 11:18:45,873 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23210#true} {23210#true} #132#return; {23210#true} is VALID [2022-04-15 11:18:45,873 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 11:18:45,873 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 11:18:45,873 INFO L290 TraceCheckUtils]: 2: Hoare triple {23210#true} assume true; {23210#true} is VALID [2022-04-15 11:18:45,873 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23210#true} {23210#true} #132#return; {23210#true} is VALID [2022-04-15 11:18:45,873 INFO L272 TraceCheckUtils]: 4: Hoare triple {23210#true} call #t~ret11 := main(); {23210#true} is VALID [2022-04-15 11:18:45,873 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 11:18:45,874 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 11:18:45,874 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 11:18:45,874 INFO L290 TraceCheckUtils]: 8: Hoare triple {23210#true} assume !(0 != ~p1~0); {23210#true} is VALID [2022-04-15 11:18:45,874 INFO L290 TraceCheckUtils]: 9: Hoare triple {23210#true} assume !(0 != ~p2~0); {23210#true} is VALID [2022-04-15 11:18:45,874 INFO L290 TraceCheckUtils]: 10: Hoare triple {23210#true} assume !(0 != ~p3~0); {23210#true} is VALID [2022-04-15 11:18:45,874 INFO L290 TraceCheckUtils]: 11: Hoare triple {23210#true} assume !(0 != ~p4~0); {23210#true} is VALID [2022-04-15 11:18:45,874 INFO L290 TraceCheckUtils]: 12: Hoare triple {23210#true} assume !(0 != ~p5~0); {23210#true} is VALID [2022-04-15 11:18:45,874 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 11:18:45,883 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 11:18:45,884 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 11:18:45,884 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 11:18:45,884 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 11:18:45,886 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 11:18:45,887 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 11:18:45,887 INFO L290 TraceCheckUtils]: 20: Hoare triple {23215#(= main_~lk6~0 1)} assume 1 != ~lk6~0; {23211#false} is VALID [2022-04-15 11:18:45,887 INFO L290 TraceCheckUtils]: 21: Hoare triple {23211#false} assume !false; {23211#false} is VALID [2022-04-15 11:18:45,887 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 11:18:45,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:18:45,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740337015] [2022-04-15 11:18:45,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740337015] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:45,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:45,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:45,888 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:18:45,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2008286455] [2022-04-15 11:18:45,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2008286455] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:45,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:45,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:45,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111174665] [2022-04-15 11:18:45,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:18:45,888 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 11:18:45,889 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:18:45,889 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 11:18:45,903 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 11:18:45,903 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:18:45,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:45,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:18:45,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:18:45,904 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 11:18:46,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:46,102 INFO L93 Difference]: Finished difference Result 971 states and 1208 transitions. [2022-04-15 11:18:46,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:18:46,102 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 11:18:46,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:18:46,103 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 11:18:46,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2022-04-15 11:18:46,104 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 11:18:46,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2022-04-15 11:18:46,105 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 62 transitions. [2022-04-15 11:18:46,140 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 11:18:46,179 INFO L225 Difference]: With dead ends: 971 [2022-04-15 11:18:46,179 INFO L226 Difference]: Without dead ends: 969 [2022-04-15 11:18:46,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 11:18:46,180 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 11:18:46,180 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 11:18:46,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2022-04-15 11:18:46,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 905. [2022-04-15 11:18:46,230 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:18:46,231 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 11:18:46,232 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 11:18:46,233 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 11:18:46,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:46,260 INFO L93 Difference]: Finished difference Result 969 states and 1175 transitions. [2022-04-15 11:18:46,261 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1175 transitions. [2022-04-15 11:18:46,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:46,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:46,263 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 11:18:46,264 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 11:18:46,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:46,291 INFO L93 Difference]: Finished difference Result 969 states and 1175 transitions. [2022-04-15 11:18:46,292 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1175 transitions. [2022-04-15 11:18:46,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:46,292 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:46,293 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:18:46,293 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:18:46,294 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 11:18:46,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1111 transitions. [2022-04-15 11:18:46,339 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1111 transitions. Word has length 22 [2022-04-15 11:18:46,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:18:46,339 INFO L478 AbstractCegarLoop]: Abstraction has 905 states and 1111 transitions. [2022-04-15 11:18:46,339 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 11:18:46,339 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 905 states and 1111 transitions. [2022-04-15 11:18:47,340 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 11:18:47,341 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1111 transitions. [2022-04-15 11:18:47,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 11:18:47,342 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:18:47,342 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 11:18:47,342 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-15 11:18:47,342 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:18:47,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:18:47,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1454210302, now seen corresponding path program 1 times [2022-04-15 11:18:47,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:47,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [664703329] [2022-04-15 11:18:47,343 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:18:47,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1454210302, now seen corresponding path program 2 times [2022-04-15 11:18:47,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:18:47,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794127951] [2022-04-15 11:18:47,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:18:47,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:18:47,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:47,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:18:47,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:47,396 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 11:18:47,396 INFO L290 TraceCheckUtils]: 1: Hoare triple {28912#true} assume true; {28912#true} is VALID [2022-04-15 11:18:47,396 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28912#true} {28912#true} #132#return; {28912#true} is VALID [2022-04-15 11:18:47,397 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 11:18:47,397 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 11:18:47,397 INFO L290 TraceCheckUtils]: 2: Hoare triple {28912#true} assume true; {28912#true} is VALID [2022-04-15 11:18:47,397 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28912#true} {28912#true} #132#return; {28912#true} is VALID [2022-04-15 11:18:47,397 INFO L272 TraceCheckUtils]: 4: Hoare triple {28912#true} call #t~ret11 := main(); {28912#true} is VALID [2022-04-15 11:18:47,397 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 11:18:47,397 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 11:18:47,397 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 11:18:47,398 INFO L290 TraceCheckUtils]: 8: Hoare triple {28912#true} assume !(0 != ~p1~0); {28912#true} is VALID [2022-04-15 11:18:47,398 INFO L290 TraceCheckUtils]: 9: Hoare triple {28912#true} assume !(0 != ~p2~0); {28912#true} is VALID [2022-04-15 11:18:47,398 INFO L290 TraceCheckUtils]: 10: Hoare triple {28912#true} assume !(0 != ~p3~0); {28912#true} is VALID [2022-04-15 11:18:47,398 INFO L290 TraceCheckUtils]: 11: Hoare triple {28912#true} assume !(0 != ~p4~0); {28912#true} is VALID [2022-04-15 11:18:47,398 INFO L290 TraceCheckUtils]: 12: Hoare triple {28912#true} assume !(0 != ~p5~0); {28912#true} is VALID [2022-04-15 11:18:47,403 INFO L290 TraceCheckUtils]: 13: Hoare triple {28912#true} assume !(0 != ~p6~0); {28917#(= main_~p6~0 0)} is VALID [2022-04-15 11:18:47,403 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 11:18:47,404 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 11:18:47,404 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 11:18:47,404 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 11:18:47,405 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 11:18:47,405 INFO L290 TraceCheckUtils]: 19: Hoare triple {28917#(= main_~p6~0 0)} assume 0 != ~p6~0; {28913#false} is VALID [2022-04-15 11:18:47,405 INFO L290 TraceCheckUtils]: 20: Hoare triple {28913#false} assume 1 != ~lk6~0; {28913#false} is VALID [2022-04-15 11:18:47,405 INFO L290 TraceCheckUtils]: 21: Hoare triple {28913#false} assume !false; {28913#false} is VALID [2022-04-15 11:18:47,405 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 11:18:47,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:18:47,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794127951] [2022-04-15 11:18:47,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794127951] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:47,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:47,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:47,407 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:18:47,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [664703329] [2022-04-15 11:18:47,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [664703329] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:47,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:47,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:47,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850360222] [2022-04-15 11:18:47,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:18:47,408 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 11:18:47,408 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:18:47,408 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 11:18:47,422 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 11:18:47,422 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:18:47,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:47,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:18:47,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:18:47,422 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 11:18:47,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:47,745 INFO L93 Difference]: Finished difference Result 1993 states and 2391 transitions. [2022-04-15 11:18:47,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:18:47,745 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 11:18:47,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:18:47,745 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 11:18:47,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2022-04-15 11:18:47,746 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 11:18:47,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2022-04-15 11:18:47,747 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 103 transitions. [2022-04-15 11:18:47,804 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 11:18:47,804 INFO L225 Difference]: With dead ends: 1993 [2022-04-15 11:18:47,804 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 11:18:47,806 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 11:18:47,806 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 11:18:47,807 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 11:18:47,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 11:18:47,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 11:18:47,807 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:18:47,807 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 11:18:47,807 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 11:18:47,807 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 11:18:47,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:47,807 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 11:18:47,807 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 11:18:47,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:47,807 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:47,808 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 11:18:47,808 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 11:18:47,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:47,808 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 11:18:47,808 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 11:18:47,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:47,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:47,808 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:18:47,808 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:18:47,808 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 11:18:47,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 11:18:47,808 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2022-04-15 11:18:47,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:18:47,808 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 11:18:47,808 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 11:18:47,808 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-15 11:18:47,809 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 11:18:47,809 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 11:18:47,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:47,810 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 11:18:47,811 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-15 11:18:47,812 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 11:18:56,290 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-15 11:18:56,291 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-15 11:18:56,291 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-15 11:18:56,291 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-15 11:18:56,291 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 11:18:56,291 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-15 11:18:56,291 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-15 11:18:56,291 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 11:18:56,291 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 11:18:56,291 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-15 11:18:56,291 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 11:18:56,291 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 6 109) the Hoare annotation is: true [2022-04-15 11:18:56,291 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 11:18:56,292 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 11:18:56,292 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 11:18:56,292 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 11:18:56,292 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 11:18:56,292 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 6 109) the Hoare annotation is: true [2022-04-15 11:18:56,292 INFO L878 garLoopResultBuilder]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 107) the Hoare annotation is: false [2022-04-15 11:18:56,292 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 6 109) the Hoare annotation is: true [2022-04-15 11:18:56,292 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 11:18:56,292 INFO L885 garLoopResultBuilder]: At program point L105(lines 7 109) the Hoare annotation is: true [2022-04-15 11:18:56,292 INFO L885 garLoopResultBuilder]: At program point L31(lines 31 33) the Hoare annotation is: true [2022-04-15 11:18:56,292 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 11:18:56,292 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 11:18:56,293 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 11:18:56,293 INFO L885 garLoopResultBuilder]: At program point L48(lines 48 50) the Hoare annotation is: true [2022-04-15 11:18:56,293 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 11:18:56,293 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 11:18:56,293 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 11:18:56,293 INFO L885 garLoopResultBuilder]: At program point L99-1(lines 29 104) the Hoare annotation is: true [2022-04-15 11:18:56,294 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 11:18:56,294 INFO L878 garLoopResultBuilder]: At program point L100(line 100) the Hoare annotation is: (= main_~lk6~0 1) [2022-04-15 11:18:56,294 INFO L878 garLoopResultBuilder]: At program point L100-1(lines 7 109) the Hoare annotation is: false [2022-04-15 11:18:56,294 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 11:18:56,294 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 11:18:56,296 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 11:18:56,297 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 11:18:56,299 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 11:18:56,299 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-15 11:18:56,325 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 11:18:56,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 11:18:56 BoogieIcfgContainer [2022-04-15 11:18:56,329 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 11:18:56,330 INFO L158 Benchmark]: Toolchain (without parser) took 20078.44ms. Allocated memory was 185.6MB in the beginning and 478.2MB in the end (delta: 292.6MB). Free memory was 137.8MB in the beginning and 367.5MB in the end (delta: -229.7MB). Peak memory consumption was 267.3MB. Max. memory is 8.0GB. [2022-04-15 11:18:56,330 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 185.6MB. Free memory was 154.1MB in the beginning and 154.0MB in the end (delta: 75.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 11:18:56,330 INFO L158 Benchmark]: CACSL2BoogieTranslator took 232.13ms. Allocated memory is still 185.6MB. Free memory was 137.5MB in the beginning and 161.9MB in the end (delta: -24.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 11:18:56,330 INFO L158 Benchmark]: Boogie Preprocessor took 43.69ms. Allocated memory is still 185.6MB. Free memory was 161.9MB in the beginning and 160.2MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 11:18:56,330 INFO L158 Benchmark]: RCFGBuilder took 292.64ms. Allocated memory is still 185.6MB. Free memory was 160.2MB in the beginning and 148.1MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-15 11:18:56,331 INFO L158 Benchmark]: TraceAbstraction took 19506.32ms. Allocated memory was 185.6MB in the beginning and 478.2MB in the end (delta: 292.6MB). Free memory was 147.6MB in the beginning and 367.5MB in the end (delta: -219.9MB). Peak memory consumption was 278.2MB. Max. memory is 8.0GB. [2022-04-15 11:18:56,331 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 185.6MB. Free memory was 154.1MB in the beginning and 154.0MB in the end (delta: 75.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 232.13ms. Allocated memory is still 185.6MB. Free memory was 137.5MB in the beginning and 161.9MB in the end (delta: -24.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.69ms. Allocated memory is still 185.6MB. Free memory was 161.9MB in the beginning and 160.2MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 292.64ms. Allocated memory is still 185.6MB. Free memory was 160.2MB in the beginning and 148.1MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 19506.32ms. Allocated memory was 185.6MB in the beginning and 478.2MB in the end (delta: 292.6MB). Free memory was 147.6MB in the beginning and 367.5MB in the end (delta: -219.9MB). Peak memory consumption was 278.2MB. 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.4s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 8.5s, 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.1s 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.7s HoareSimplificationTime, 33 FomulaSimplificationsInter, 38507 FormulaSimplificationTreeSizeReductionInter, 5.7s 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 11:18:56,363 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...