/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_5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 11:18:22,162 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 11:18:22,163 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 11:18:22,208 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 11:18:22,208 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 11:18:22,209 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 11:18:22,211 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 11:18:22,213 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 11:18:22,214 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 11:18:22,217 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 11:18:22,217 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 11:18:22,218 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 11:18:22,218 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 11:18:22,220 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 11:18:22,221 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 11:18:22,223 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 11:18:22,223 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 11:18:22,223 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 11:18:22,225 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 11:18:22,227 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 11:18:22,228 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 11:18:22,229 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 11:18:22,229 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 11:18:22,230 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 11:18:22,231 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 11:18:22,235 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 11:18:22,235 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 11:18:22,235 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 11:18:22,236 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 11:18:22,236 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 11:18:22,237 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 11:18:22,237 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 11:18:22,238 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 11:18:22,239 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 11:18:22,239 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 11:18:22,239 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 11:18:22,239 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 11:18:22,240 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 11:18:22,240 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 11:18:22,240 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 11:18:22,241 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 11:18:22,242 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 11:18:22,242 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:22,250 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 11:18:22,250 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 11:18:22,251 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 11:18:22,251 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 11:18:22,251 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 11:18:22,251 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 11:18:22,251 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 11:18:22,251 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 11:18:22,251 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 11:18:22,252 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 11:18:22,252 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 11:18:22,252 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 11:18:22,252 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 11:18:22,252 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 11:18:22,252 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 11:18:22,252 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 11:18:22,253 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 11:18:22,253 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 11:18:22,253 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 11:18:22,253 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 11:18:22,253 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 11:18:22,253 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 11:18:22,253 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 11:18:22,253 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 11:18:22,253 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 11:18:22,253 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:22,464 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 11:18:22,482 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 11:18:22,483 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 11:18:22,484 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 11:18:22,484 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 11:18:22,485 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_5.c [2022-04-15 11:18:22,529 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fcd58a90/13a0704616f3450ea48888f986ae6363/FLAG8f3fdaeee [2022-04-15 11:18:22,894 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 11:18:22,894 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_5.c [2022-04-15 11:18:22,913 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fcd58a90/13a0704616f3450ea48888f986ae6363/FLAG8f3fdaeee [2022-04-15 11:18:22,927 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fcd58a90/13a0704616f3450ea48888f986ae6363 [2022-04-15 11:18:22,929 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 11:18:22,929 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 11:18:22,931 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 11:18:22,931 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 11:18:22,934 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 11:18:22,935 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 11:18:22" (1/1) ... [2022-04-15 11:18:22,935 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16b956ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:18:22, skipping insertion in model container [2022-04-15 11:18:22,936 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 11:18:22" (1/1) ... [2022-04-15 11:18:22,940 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 11:18:22,949 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 11:18:23,074 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_5.c[2207,2220] [2022-04-15 11:18:23,076 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 11:18:23,081 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 11:18:23,093 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_5.c[2207,2220] [2022-04-15 11:18:23,093 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 11:18:23,102 INFO L208 MainTranslator]: Completed translation [2022-04-15 11:18:23,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:18:23 WrapperNode [2022-04-15 11:18:23,102 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 11:18:23,103 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 11:18:23,103 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 11:18:23,103 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 11:18:23,109 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:23" (1/1) ... [2022-04-15 11:18:23,109 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:23" (1/1) ... [2022-04-15 11:18:23,113 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:23" (1/1) ... [2022-04-15 11:18:23,113 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:23" (1/1) ... [2022-04-15 11:18:23,120 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:23" (1/1) ... [2022-04-15 11:18:23,134 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:23" (1/1) ... [2022-04-15 11:18:23,135 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:23" (1/1) ... [2022-04-15 11:18:23,136 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 11:18:23,137 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 11:18:23,137 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 11:18:23,137 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 11:18:23,138 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:18:23" (1/1) ... [2022-04-15 11:18:23,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 11:18:23,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:18:23,161 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:23,162 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:23,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 11:18:23,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 11:18:23,183 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 11:18:23,183 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 11:18:23,183 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 11:18:23,183 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 11:18:23,183 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 11:18:23,183 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 11:18:23,183 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 11:18:23,183 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 11:18:23,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 11:18:23,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 11:18:23,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 11:18:23,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 11:18:23,184 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 11:18:23,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 11:18:23,222 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 11:18:23,223 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 11:18:23,393 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 11:18:23,398 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 11:18:23,398 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 11:18:23,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 11:18:23 BoogieIcfgContainer [2022-04-15 11:18:23,399 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 11:18:23,400 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 11:18:23,400 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 11:18:23,419 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 11:18:23,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 11:18:22" (1/3) ... [2022-04-15 11:18:23,420 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2985cebc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 11:18:23, skipping insertion in model container [2022-04-15 11:18:23,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:18:23" (2/3) ... [2022-04-15 11:18:23,420 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2985cebc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 11:18:23, skipping insertion in model container [2022-04-15 11:18:23,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 11:18:23" (3/3) ... [2022-04-15 11:18:23,421 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_5.c [2022-04-15 11:18:23,424 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 11:18:23,424 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 11:18:23,470 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 11:18:23,476 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:23,476 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 11:18:23,500 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 25 states have internal predecessors, (43), 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:23,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-15 11:18:23,505 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:18:23,505 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:18:23,506 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:18:23,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:18:23,509 INFO L85 PathProgramCache]: Analyzing trace with hash -663266717, now seen corresponding path program 1 times [2022-04-15 11:18:23,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:23,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1799121914] [2022-04-15 11:18:23,529 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:18:23,529 INFO L85 PathProgramCache]: Analyzing trace with hash -663266717, now seen corresponding path program 2 times [2022-04-15 11:18:23,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:18:23,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106810431] [2022-04-15 11:18:23,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:18:23,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:18:23,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:23,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:18:23,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:23,780 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#(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); {33#true} is VALID [2022-04-15 11:18:23,781 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-15 11:18:23,781 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33#true} {33#true} #115#return; {33#true} is VALID [2022-04-15 11:18:23,784 INFO L272 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {39#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:18:23,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#(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); {33#true} is VALID [2022-04-15 11:18:23,784 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-15 11:18:23,785 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #115#return; {33#true} is VALID [2022-04-15 11:18:23,785 INFO L272 TraceCheckUtils]: 4: Hoare triple {33#true} call #t~ret10 := main(); {33#true} is VALID [2022-04-15 11:18:23,785 INFO L290 TraceCheckUtils]: 5: Hoare triple {33#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;havoc ~cond~0; {33#true} is VALID [2022-04-15 11:18:23,786 INFO L290 TraceCheckUtils]: 6: Hoare triple {33#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {33#true} is VALID [2022-04-15 11:18:23,786 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {33#true} is VALID [2022-04-15 11:18:23,787 INFO L290 TraceCheckUtils]: 8: Hoare triple {33#true} assume 0 != ~p1~0;~lk1~0 := 1; {38#(= main_~lk1~0 1)} is VALID [2022-04-15 11:18:23,788 INFO L290 TraceCheckUtils]: 9: Hoare triple {38#(= main_~lk1~0 1)} assume !(0 != ~p2~0); {38#(= main_~lk1~0 1)} is VALID [2022-04-15 11:18:23,788 INFO L290 TraceCheckUtils]: 10: Hoare triple {38#(= main_~lk1~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {38#(= main_~lk1~0 1)} is VALID [2022-04-15 11:18:23,789 INFO L290 TraceCheckUtils]: 11: Hoare triple {38#(= main_~lk1~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {38#(= main_~lk1~0 1)} is VALID [2022-04-15 11:18:23,790 INFO L290 TraceCheckUtils]: 12: Hoare triple {38#(= main_~lk1~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {38#(= main_~lk1~0 1)} is VALID [2022-04-15 11:18:23,795 INFO L290 TraceCheckUtils]: 13: Hoare triple {38#(= main_~lk1~0 1)} assume 0 != ~p1~0; {38#(= main_~lk1~0 1)} is VALID [2022-04-15 11:18:23,795 INFO L290 TraceCheckUtils]: 14: Hoare triple {38#(= main_~lk1~0 1)} assume 1 != ~lk1~0; {34#false} is VALID [2022-04-15 11:18:23,797 INFO L290 TraceCheckUtils]: 15: Hoare triple {34#false} assume !false; {34#false} is VALID [2022-04-15 11:18:23,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:23,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:18:23,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106810431] [2022-04-15 11:18:23,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106810431] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:23,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:23,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:23,801 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:18:23,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1799121914] [2022-04-15 11:18:23,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1799121914] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:23,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:23,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:23,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025986109] [2022-04-15 11:18:23,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:18:23,808 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 11:18:23,810 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:18:23,813 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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:23,837 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:23,837 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:18:23,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:23,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:18:23,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:18:23,862 INFO L87 Difference]: Start difference. First operand has 30 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 25 states have internal predecessors, (43), 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.25) internal successors, (13), 3 states have internal predecessors, (13), 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:24,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:24,107 INFO L93 Difference]: Finished difference Result 58 states and 91 transitions. [2022-04-15 11:18:24,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:18:24,107 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 11:18:24,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:18:24,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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:24,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2022-04-15 11:18:24,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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:24,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2022-04-15 11:18:24,121 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 91 transitions. [2022-04-15 11:18:24,237 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:24,244 INFO L225 Difference]: With dead ends: 58 [2022-04-15 11:18:24,244 INFO L226 Difference]: Without dead ends: 43 [2022-04-15 11:18:24,246 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:24,248 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 89 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:18:24,248 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 59 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 11:18:24,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-15 11:18:24,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2022-04-15 11:18:24,281 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:18:24,282 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 31 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 27 states have internal predecessors, (47), 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:24,282 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 31 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 27 states have internal predecessors, (47), 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:24,283 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 31 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 27 states have internal predecessors, (47), 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:24,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:24,287 INFO L93 Difference]: Finished difference Result 43 states and 69 transitions. [2022-04-15 11:18:24,287 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 69 transitions. [2022-04-15 11:18:24,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:24,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:24,288 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 27 states have internal predecessors, (47), 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 43 states. [2022-04-15 11:18:24,288 INFO L87 Difference]: Start difference. First operand has 31 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 27 states have internal predecessors, (47), 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 43 states. [2022-04-15 11:18:24,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:24,292 INFO L93 Difference]: Finished difference Result 43 states and 69 transitions. [2022-04-15 11:18:24,292 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 69 transitions. [2022-04-15 11:18:24,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:24,293 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:24,293 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:18:24,293 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:18:24,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 27 states have internal predecessors, (47), 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:24,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 50 transitions. [2022-04-15 11:18:24,296 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 50 transitions. Word has length 16 [2022-04-15 11:18:24,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:18:24,296 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 50 transitions. [2022-04-15 11:18:24,297 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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:24,297 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 50 transitions. [2022-04-15 11:18:24,378 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:24,378 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 50 transitions. [2022-04-15 11:18:24,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-15 11:18:24,379 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:18:24,379 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:18:24,379 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 11:18:24,379 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:18:24,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:18:24,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1472613343, now seen corresponding path program 1 times [2022-04-15 11:18:24,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:24,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [429850661] [2022-04-15 11:18:24,381 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:18:24,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1472613343, now seen corresponding path program 2 times [2022-04-15 11:18:24,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:18:24,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417905439] [2022-04-15 11:18:24,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:18:24,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:18:24,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:24,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:18:24,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:24,468 INFO L290 TraceCheckUtils]: 0: Hoare triple {315#(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); {309#true} is VALID [2022-04-15 11:18:24,468 INFO L290 TraceCheckUtils]: 1: Hoare triple {309#true} assume true; {309#true} is VALID [2022-04-15 11:18:24,468 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {309#true} {309#true} #115#return; {309#true} is VALID [2022-04-15 11:18:24,470 INFO L272 TraceCheckUtils]: 0: Hoare triple {309#true} call ULTIMATE.init(); {315#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:18:24,470 INFO L290 TraceCheckUtils]: 1: Hoare triple {315#(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); {309#true} is VALID [2022-04-15 11:18:24,470 INFO L290 TraceCheckUtils]: 2: Hoare triple {309#true} assume true; {309#true} is VALID [2022-04-15 11:18:24,470 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {309#true} {309#true} #115#return; {309#true} is VALID [2022-04-15 11:18:24,471 INFO L272 TraceCheckUtils]: 4: Hoare triple {309#true} call #t~ret10 := main(); {309#true} is VALID [2022-04-15 11:18:24,471 INFO L290 TraceCheckUtils]: 5: Hoare triple {309#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;havoc ~cond~0; {309#true} is VALID [2022-04-15 11:18:24,471 INFO L290 TraceCheckUtils]: 6: Hoare triple {309#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {309#true} is VALID [2022-04-15 11:18:24,471 INFO L290 TraceCheckUtils]: 7: Hoare triple {309#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {309#true} is VALID [2022-04-15 11:18:24,472 INFO L290 TraceCheckUtils]: 8: Hoare triple {309#true} assume !(0 != ~p1~0); {314#(= main_~p1~0 0)} is VALID [2022-04-15 11:18:24,473 INFO L290 TraceCheckUtils]: 9: Hoare triple {314#(= main_~p1~0 0)} assume !(0 != ~p2~0); {314#(= main_~p1~0 0)} is VALID [2022-04-15 11:18:24,473 INFO L290 TraceCheckUtils]: 10: Hoare triple {314#(= main_~p1~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {314#(= main_~p1~0 0)} is VALID [2022-04-15 11:18:24,473 INFO L290 TraceCheckUtils]: 11: Hoare triple {314#(= main_~p1~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {314#(= main_~p1~0 0)} is VALID [2022-04-15 11:18:24,474 INFO L290 TraceCheckUtils]: 12: Hoare triple {314#(= main_~p1~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {314#(= main_~p1~0 0)} is VALID [2022-04-15 11:18:24,474 INFO L290 TraceCheckUtils]: 13: Hoare triple {314#(= main_~p1~0 0)} assume 0 != ~p1~0; {310#false} is VALID [2022-04-15 11:18:24,474 INFO L290 TraceCheckUtils]: 14: Hoare triple {310#false} assume 1 != ~lk1~0; {310#false} is VALID [2022-04-15 11:18:24,475 INFO L290 TraceCheckUtils]: 15: Hoare triple {310#false} assume !false; {310#false} is VALID [2022-04-15 11:18:24,475 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:24,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:18:24,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417905439] [2022-04-15 11:18:24,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417905439] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:24,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:24,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:24,479 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:18:24,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [429850661] [2022-04-15 11:18:24,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [429850661] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:24,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:24,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:24,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522166596] [2022-04-15 11:18:24,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:18:24,481 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 11:18:24,481 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:18:24,482 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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:24,492 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:24,492 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:18:24,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:24,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:18:24,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:18:24,493 INFO L87 Difference]: Start difference. First operand 31 states and 50 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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:24,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:24,623 INFO L93 Difference]: Finished difference Result 68 states and 113 transitions. [2022-04-15 11:18:24,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:18:24,624 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 11:18:24,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:18:24,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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:24,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions. [2022-04-15 11:18:24,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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:24,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions. [2022-04-15 11:18:24,628 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 102 transitions. [2022-04-15 11:18:24,705 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:24,707 INFO L225 Difference]: With dead ends: 68 [2022-04-15 11:18:24,707 INFO L226 Difference]: Without dead ends: 43 [2022-04-15 11:18:24,707 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:24,708 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 73 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 55 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:24,708 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 55 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:24,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-15 11:18:24,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2022-04-15 11:18:24,716 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:18:24,716 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 41 states, 37 states have (on average 1.7027027027027026) internal successors, (63), 37 states have internal predecessors, (63), 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:24,717 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 41 states, 37 states have (on average 1.7027027027027026) internal successors, (63), 37 states have internal predecessors, (63), 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:24,717 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 41 states, 37 states have (on average 1.7027027027027026) internal successors, (63), 37 states have internal predecessors, (63), 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:24,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:24,719 INFO L93 Difference]: Finished difference Result 43 states and 67 transitions. [2022-04-15 11:18:24,720 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 67 transitions. [2022-04-15 11:18:24,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:24,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:24,720 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 37 states have (on average 1.7027027027027026) internal successors, (63), 37 states have internal predecessors, (63), 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 43 states. [2022-04-15 11:18:24,721 INFO L87 Difference]: Start difference. First operand has 41 states, 37 states have (on average 1.7027027027027026) internal successors, (63), 37 states have internal predecessors, (63), 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 43 states. [2022-04-15 11:18:24,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:24,722 INFO L93 Difference]: Finished difference Result 43 states and 67 transitions. [2022-04-15 11:18:24,723 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 67 transitions. [2022-04-15 11:18:24,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:24,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:24,723 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:18:24,723 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:18:24,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 37 states have (on average 1.7027027027027026) internal successors, (63), 37 states have internal predecessors, (63), 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:24,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 66 transitions. [2022-04-15 11:18:24,725 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 66 transitions. Word has length 16 [2022-04-15 11:18:24,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:18:24,725 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 66 transitions. [2022-04-15 11:18:24,725 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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:24,725 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 66 transitions. [2022-04-15 11:18:24,792 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:24,793 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 66 transitions. [2022-04-15 11:18:24,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 11:18:24,793 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:18:24,793 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:24,794 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 11:18:24,794 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:18:24,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:18:24,794 INFO L85 PathProgramCache]: Analyzing trace with hash 913783256, now seen corresponding path program 1 times [2022-04-15 11:18:24,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:24,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1675084151] [2022-04-15 11:18:24,795 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:18:24,795 INFO L85 PathProgramCache]: Analyzing trace with hash 913783256, now seen corresponding path program 2 times [2022-04-15 11:18:24,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:18:24,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006558329] [2022-04-15 11:18:24,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:18:24,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:18:24,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:24,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:18:24,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:24,834 INFO L290 TraceCheckUtils]: 0: Hoare triple {631#(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); {625#true} is VALID [2022-04-15 11:18:24,835 INFO L290 TraceCheckUtils]: 1: Hoare triple {625#true} assume true; {625#true} is VALID [2022-04-15 11:18:24,835 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {625#true} {625#true} #115#return; {625#true} is VALID [2022-04-15 11:18:24,851 INFO L272 TraceCheckUtils]: 0: Hoare triple {625#true} call ULTIMATE.init(); {631#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:18:24,852 INFO L290 TraceCheckUtils]: 1: Hoare triple {631#(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); {625#true} is VALID [2022-04-15 11:18:24,852 INFO L290 TraceCheckUtils]: 2: Hoare triple {625#true} assume true; {625#true} is VALID [2022-04-15 11:18:24,852 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {625#true} {625#true} #115#return; {625#true} is VALID [2022-04-15 11:18:24,852 INFO L272 TraceCheckUtils]: 4: Hoare triple {625#true} call #t~ret10 := main(); {625#true} is VALID [2022-04-15 11:18:24,852 INFO L290 TraceCheckUtils]: 5: Hoare triple {625#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;havoc ~cond~0; {625#true} is VALID [2022-04-15 11:18:24,852 INFO L290 TraceCheckUtils]: 6: Hoare triple {625#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {625#true} is VALID [2022-04-15 11:18:24,853 INFO L290 TraceCheckUtils]: 7: Hoare triple {625#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {625#true} is VALID [2022-04-15 11:18:24,855 INFO L290 TraceCheckUtils]: 8: Hoare triple {625#true} assume 0 != ~p1~0;~lk1~0 := 1; {630#(not (= main_~p1~0 0))} is VALID [2022-04-15 11:18:24,857 INFO L290 TraceCheckUtils]: 9: Hoare triple {630#(not (= main_~p1~0 0))} assume !(0 != ~p2~0); {630#(not (= main_~p1~0 0))} is VALID [2022-04-15 11:18:24,858 INFO L290 TraceCheckUtils]: 10: Hoare triple {630#(not (= main_~p1~0 0))} assume 0 != ~p3~0;~lk3~0 := 1; {630#(not (= main_~p1~0 0))} is VALID [2022-04-15 11:18:24,858 INFO L290 TraceCheckUtils]: 11: Hoare triple {630#(not (= main_~p1~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {630#(not (= main_~p1~0 0))} is VALID [2022-04-15 11:18:24,858 INFO L290 TraceCheckUtils]: 12: Hoare triple {630#(not (= main_~p1~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {630#(not (= main_~p1~0 0))} is VALID [2022-04-15 11:18:24,859 INFO L290 TraceCheckUtils]: 13: Hoare triple {630#(not (= main_~p1~0 0))} assume !(0 != ~p1~0); {626#false} is VALID [2022-04-15 11:18:24,859 INFO L290 TraceCheckUtils]: 14: Hoare triple {626#false} assume 0 != ~p2~0; {626#false} is VALID [2022-04-15 11:18:24,859 INFO L290 TraceCheckUtils]: 15: Hoare triple {626#false} assume 1 != ~lk2~0; {626#false} is VALID [2022-04-15 11:18:24,859 INFO L290 TraceCheckUtils]: 16: Hoare triple {626#false} assume !false; {626#false} is VALID [2022-04-15 11:18:24,860 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:24,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:18:24,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006558329] [2022-04-15 11:18:24,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006558329] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:24,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:24,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:24,860 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:18:24,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1675084151] [2022-04-15 11:18:24,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1675084151] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:24,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:24,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:24,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673142372] [2022-04-15 11:18:24,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:18:24,861 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:24,861 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:18:24,861 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:24,872 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:24,873 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:18:24,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:24,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:18:24,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:18:24,873 INFO L87 Difference]: Start difference. First operand 41 states and 66 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:24,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:24,995 INFO L93 Difference]: Finished difference Result 64 states and 100 transitions. [2022-04-15 11:18:24,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:18:24,996 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:24,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:18:24,996 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:24,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2022-04-15 11:18:24,997 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:24,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2022-04-15 11:18:24,999 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 97 transitions. [2022-04-15 11:18:25,069 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:25,070 INFO L225 Difference]: With dead ends: 64 [2022-04-15 11:18:25,070 INFO L226 Difference]: Without dead ends: 46 [2022-04-15 11:18:25,071 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:25,072 INFO L913 BasicCegarLoop]: 56 mSDtfsCounter, 66 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:18:25,072 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 63 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:18:25,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-15 11:18:25,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2022-04-15 11:18:25,077 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:18:25,077 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 44 states, 40 states have (on average 1.625) internal successors, (65), 40 states have internal predecessors, (65), 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:25,077 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 44 states, 40 states have (on average 1.625) internal successors, (65), 40 states have internal predecessors, (65), 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:25,077 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 44 states, 40 states have (on average 1.625) internal successors, (65), 40 states have internal predecessors, (65), 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:25,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:25,079 INFO L93 Difference]: Finished difference Result 46 states and 69 transitions. [2022-04-15 11:18:25,079 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 69 transitions. [2022-04-15 11:18:25,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:25,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:25,079 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 40 states have (on average 1.625) internal successors, (65), 40 states have internal predecessors, (65), 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 46 states. [2022-04-15 11:18:25,080 INFO L87 Difference]: Start difference. First operand has 44 states, 40 states have (on average 1.625) internal successors, (65), 40 states have internal predecessors, (65), 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 46 states. [2022-04-15 11:18:25,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:25,081 INFO L93 Difference]: Finished difference Result 46 states and 69 transitions. [2022-04-15 11:18:25,081 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 69 transitions. [2022-04-15 11:18:25,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:25,082 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:25,082 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:18:25,082 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:18:25,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 40 states have (on average 1.625) internal successors, (65), 40 states have internal predecessors, (65), 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:25,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 68 transitions. [2022-04-15 11:18:25,083 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 68 transitions. Word has length 17 [2022-04-15 11:18:25,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:18:25,083 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 68 transitions. [2022-04-15 11:18:25,084 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:25,084 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 68 transitions. [2022-04-15 11:18:25,142 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:25,142 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 68 transitions. [2022-04-15 11:18:25,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 11:18:25,143 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:18:25,143 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:25,144 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 11:18:25,146 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:18:25,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:18:25,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1593841626, now seen corresponding path program 1 times [2022-04-15 11:18:25,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:25,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [482933399] [2022-04-15 11:18:25,150 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:18:25,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1593841626, now seen corresponding path program 2 times [2022-04-15 11:18:25,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:18:25,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970359611] [2022-04-15 11:18:25,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:18:25,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:18:25,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:25,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:18:25,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:25,200 INFO L290 TraceCheckUtils]: 0: Hoare triple {951#(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); {945#true} is VALID [2022-04-15 11:18:25,201 INFO L290 TraceCheckUtils]: 1: Hoare triple {945#true} assume true; {945#true} is VALID [2022-04-15 11:18:25,201 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {945#true} {945#true} #115#return; {945#true} is VALID [2022-04-15 11:18:25,201 INFO L272 TraceCheckUtils]: 0: Hoare triple {945#true} call ULTIMATE.init(); {951#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:18:25,201 INFO L290 TraceCheckUtils]: 1: Hoare triple {951#(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); {945#true} is VALID [2022-04-15 11:18:25,202 INFO L290 TraceCheckUtils]: 2: Hoare triple {945#true} assume true; {945#true} is VALID [2022-04-15 11:18:25,202 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {945#true} {945#true} #115#return; {945#true} is VALID [2022-04-15 11:18:25,202 INFO L272 TraceCheckUtils]: 4: Hoare triple {945#true} call #t~ret10 := main(); {945#true} is VALID [2022-04-15 11:18:25,202 INFO L290 TraceCheckUtils]: 5: Hoare triple {945#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;havoc ~cond~0; {945#true} is VALID [2022-04-15 11:18:25,202 INFO L290 TraceCheckUtils]: 6: Hoare triple {945#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {945#true} is VALID [2022-04-15 11:18:25,202 INFO L290 TraceCheckUtils]: 7: Hoare triple {945#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {945#true} is VALID [2022-04-15 11:18:25,202 INFO L290 TraceCheckUtils]: 8: Hoare triple {945#true} assume !(0 != ~p1~0); {945#true} is VALID [2022-04-15 11:18:25,203 INFO L290 TraceCheckUtils]: 9: Hoare triple {945#true} assume !(0 != ~p2~0); {950#(= main_~p2~0 0)} is VALID [2022-04-15 11:18:25,203 INFO L290 TraceCheckUtils]: 10: Hoare triple {950#(= main_~p2~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {950#(= main_~p2~0 0)} is VALID [2022-04-15 11:18:25,207 INFO L290 TraceCheckUtils]: 11: Hoare triple {950#(= main_~p2~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {950#(= main_~p2~0 0)} is VALID [2022-04-15 11:18:25,207 INFO L290 TraceCheckUtils]: 12: Hoare triple {950#(= main_~p2~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {950#(= main_~p2~0 0)} is VALID [2022-04-15 11:18:25,208 INFO L290 TraceCheckUtils]: 13: Hoare triple {950#(= main_~p2~0 0)} assume !(0 != ~p1~0); {950#(= main_~p2~0 0)} is VALID [2022-04-15 11:18:25,208 INFO L290 TraceCheckUtils]: 14: Hoare triple {950#(= main_~p2~0 0)} assume 0 != ~p2~0; {946#false} is VALID [2022-04-15 11:18:25,208 INFO L290 TraceCheckUtils]: 15: Hoare triple {946#false} assume 1 != ~lk2~0; {946#false} is VALID [2022-04-15 11:18:25,208 INFO L290 TraceCheckUtils]: 16: Hoare triple {946#false} assume !false; {946#false} is VALID [2022-04-15 11:18:25,208 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:25,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:18:25,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970359611] [2022-04-15 11:18:25,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970359611] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:25,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:25,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:25,209 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:18:25,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [482933399] [2022-04-15 11:18:25,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [482933399] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:25,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:25,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:25,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653858414] [2022-04-15 11:18:25,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:18:25,210 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:25,210 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:18:25,210 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:25,223 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:25,223 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:18:25,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:25,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:18:25,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:18:25,224 INFO L87 Difference]: Start difference. First operand 44 states and 68 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:25,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:25,312 INFO L93 Difference]: Finished difference Result 112 states and 180 transitions. [2022-04-15 11:18:25,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:18:25,312 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:25,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:18:25,313 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:25,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2022-04-15 11:18:25,314 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:25,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2022-04-15 11:18:25,315 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 100 transitions. [2022-04-15 11:18:25,369 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:25,371 INFO L225 Difference]: With dead ends: 112 [2022-04-15 11:18:25,371 INFO L226 Difference]: Without dead ends: 77 [2022-04-15 11:18:25,373 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:25,374 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 78 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 49 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:25,375 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 49 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:25,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-04-15 11:18:25,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2022-04-15 11:18:25,390 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:18:25,390 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 75 states, 71 states have (on average 1.6056338028169015) internal successors, (114), 71 states have internal predecessors, (114), 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:25,390 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 75 states, 71 states have (on average 1.6056338028169015) internal successors, (114), 71 states have internal predecessors, (114), 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:25,391 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 75 states, 71 states have (on average 1.6056338028169015) internal successors, (114), 71 states have internal predecessors, (114), 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:25,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:25,392 INFO L93 Difference]: Finished difference Result 77 states and 118 transitions. [2022-04-15 11:18:25,393 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 118 transitions. [2022-04-15 11:18:25,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:25,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:25,397 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 71 states have (on average 1.6056338028169015) internal successors, (114), 71 states have internal predecessors, (114), 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 77 states. [2022-04-15 11:18:25,398 INFO L87 Difference]: Start difference. First operand has 75 states, 71 states have (on average 1.6056338028169015) internal successors, (114), 71 states have internal predecessors, (114), 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 77 states. [2022-04-15 11:18:25,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:25,402 INFO L93 Difference]: Finished difference Result 77 states and 118 transitions. [2022-04-15 11:18:25,402 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 118 transitions. [2022-04-15 11:18:25,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:25,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:25,404 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:18:25,404 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:18:25,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 71 states have (on average 1.6056338028169015) internal successors, (114), 71 states have internal predecessors, (114), 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:25,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 117 transitions. [2022-04-15 11:18:25,406 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 117 transitions. Word has length 17 [2022-04-15 11:18:25,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:18:25,406 INFO L478 AbstractCegarLoop]: Abstraction has 75 states and 117 transitions. [2022-04-15 11:18:25,406 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:25,406 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 75 states and 117 transitions. [2022-04-15 11:18:25,505 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:25,505 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 117 transitions. [2022-04-15 11:18:25,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 11:18:25,505 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:18:25,505 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:25,505 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 11:18:25,506 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:18:25,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:18:25,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1891779044, now seen corresponding path program 1 times [2022-04-15 11:18:25,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:25,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [204870370] [2022-04-15 11:18:25,506 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:18:25,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1891779044, now seen corresponding path program 2 times [2022-04-15 11:18:25,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:18:25,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407979435] [2022-04-15 11:18:25,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:18:25,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:18:25,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:25,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:18:25,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:25,537 INFO L290 TraceCheckUtils]: 0: Hoare triple {1491#(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); {1485#true} is VALID [2022-04-15 11:18:25,537 INFO L290 TraceCheckUtils]: 1: Hoare triple {1485#true} assume true; {1485#true} is VALID [2022-04-15 11:18:25,538 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1485#true} {1485#true} #115#return; {1485#true} is VALID [2022-04-15 11:18:25,538 INFO L272 TraceCheckUtils]: 0: Hoare triple {1485#true} call ULTIMATE.init(); {1491#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:18:25,538 INFO L290 TraceCheckUtils]: 1: Hoare triple {1491#(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); {1485#true} is VALID [2022-04-15 11:18:25,538 INFO L290 TraceCheckUtils]: 2: Hoare triple {1485#true} assume true; {1485#true} is VALID [2022-04-15 11:18:25,538 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1485#true} {1485#true} #115#return; {1485#true} is VALID [2022-04-15 11:18:25,538 INFO L272 TraceCheckUtils]: 4: Hoare triple {1485#true} call #t~ret10 := main(); {1485#true} is VALID [2022-04-15 11:18:25,539 INFO L290 TraceCheckUtils]: 5: Hoare triple {1485#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;havoc ~cond~0; {1485#true} is VALID [2022-04-15 11:18:25,539 INFO L290 TraceCheckUtils]: 6: Hoare triple {1485#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {1485#true} is VALID [2022-04-15 11:18:25,539 INFO L290 TraceCheckUtils]: 7: Hoare triple {1485#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {1485#true} is VALID [2022-04-15 11:18:25,539 INFO L290 TraceCheckUtils]: 8: Hoare triple {1485#true} assume !(0 != ~p1~0); {1485#true} is VALID [2022-04-15 11:18:25,539 INFO L290 TraceCheckUtils]: 9: Hoare triple {1485#true} assume 0 != ~p2~0;~lk2~0 := 1; {1490#(= main_~lk2~0 1)} is VALID [2022-04-15 11:18:25,540 INFO L290 TraceCheckUtils]: 10: Hoare triple {1490#(= main_~lk2~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {1490#(= main_~lk2~0 1)} is VALID [2022-04-15 11:18:25,540 INFO L290 TraceCheckUtils]: 11: Hoare triple {1490#(= main_~lk2~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {1490#(= main_~lk2~0 1)} is VALID [2022-04-15 11:18:25,540 INFO L290 TraceCheckUtils]: 12: Hoare triple {1490#(= main_~lk2~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {1490#(= main_~lk2~0 1)} is VALID [2022-04-15 11:18:25,541 INFO L290 TraceCheckUtils]: 13: Hoare triple {1490#(= main_~lk2~0 1)} assume !(0 != ~p1~0); {1490#(= main_~lk2~0 1)} is VALID [2022-04-15 11:18:25,541 INFO L290 TraceCheckUtils]: 14: Hoare triple {1490#(= main_~lk2~0 1)} assume 0 != ~p2~0; {1490#(= main_~lk2~0 1)} is VALID [2022-04-15 11:18:25,541 INFO L290 TraceCheckUtils]: 15: Hoare triple {1490#(= main_~lk2~0 1)} assume 1 != ~lk2~0; {1486#false} is VALID [2022-04-15 11:18:25,541 INFO L290 TraceCheckUtils]: 16: Hoare triple {1486#false} assume !false; {1486#false} is VALID [2022-04-15 11:18:25,541 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:25,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:18:25,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407979435] [2022-04-15 11:18:25,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407979435] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:25,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:25,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:25,542 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:18:25,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [204870370] [2022-04-15 11:18:25,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [204870370] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:25,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:25,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:25,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890347666] [2022-04-15 11:18:25,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:18:25,543 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:25,543 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:18:25,543 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:25,552 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:25,552 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:18:25,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:25,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:18:25,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:18:25,552 INFO L87 Difference]: Start difference. First operand 75 states and 117 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:25,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:25,636 INFO L93 Difference]: Finished difference Result 95 states and 147 transitions. [2022-04-15 11:18:25,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:18:25,637 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:25,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:18:25,637 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:25,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2022-04-15 11:18:25,638 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:25,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2022-04-15 11:18:25,639 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 64 transitions. [2022-04-15 11:18:25,684 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:25,686 INFO L225 Difference]: With dead ends: 95 [2022-04-15 11:18:25,686 INFO L226 Difference]: Without dead ends: 93 [2022-04-15 11:18:25,686 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:25,687 INFO L913 BasicCegarLoop]: 61 mSDtfsCounter, 51 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:18:25,687 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 68 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:18:25,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-15 11:18:25,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 75. [2022-04-15 11:18:25,694 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:18:25,695 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 75 states, 71 states have (on average 1.5774647887323943) internal successors, (112), 71 states have internal predecessors, (112), 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:25,695 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 75 states, 71 states have (on average 1.5774647887323943) internal successors, (112), 71 states have internal predecessors, (112), 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:25,695 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 75 states, 71 states have (on average 1.5774647887323943) internal successors, (112), 71 states have internal predecessors, (112), 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:25,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:25,697 INFO L93 Difference]: Finished difference Result 93 states and 144 transitions. [2022-04-15 11:18:25,697 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 144 transitions. [2022-04-15 11:18:25,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:25,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:25,698 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 71 states have (on average 1.5774647887323943) internal successors, (112), 71 states have internal predecessors, (112), 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 93 states. [2022-04-15 11:18:25,698 INFO L87 Difference]: Start difference. First operand has 75 states, 71 states have (on average 1.5774647887323943) internal successors, (112), 71 states have internal predecessors, (112), 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 93 states. [2022-04-15 11:18:25,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:25,700 INFO L93 Difference]: Finished difference Result 93 states and 144 transitions. [2022-04-15 11:18:25,700 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 144 transitions. [2022-04-15 11:18:25,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:25,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:25,700 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:18:25,700 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:18:25,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 71 states have (on average 1.5774647887323943) internal successors, (112), 71 states have internal predecessors, (112), 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:25,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 115 transitions. [2022-04-15 11:18:25,702 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 115 transitions. Word has length 17 [2022-04-15 11:18:25,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:18:25,703 INFO L478 AbstractCegarLoop]: Abstraction has 75 states and 115 transitions. [2022-04-15 11:18:25,703 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:25,703 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 75 states and 115 transitions. [2022-04-15 11:18:25,798 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:25,798 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 115 transitions. [2022-04-15 11:18:25,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 11:18:25,799 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:18:25,799 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:25,799 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 11:18:25,799 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:18:25,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:18:25,799 INFO L85 PathProgramCache]: Analyzing trace with hash -2130301802, now seen corresponding path program 1 times [2022-04-15 11:18:25,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:25,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [900397843] [2022-04-15 11:18:25,800 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:18:25,800 INFO L85 PathProgramCache]: Analyzing trace with hash -2130301802, now seen corresponding path program 2 times [2022-04-15 11:18:25,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:18:25,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475723619] [2022-04-15 11:18:25,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:18:25,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:18:25,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:25,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:18:25,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:25,834 INFO L290 TraceCheckUtils]: 0: Hoare triple {2029#(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); {2023#true} is VALID [2022-04-15 11:18:25,834 INFO L290 TraceCheckUtils]: 1: Hoare triple {2023#true} assume true; {2023#true} is VALID [2022-04-15 11:18:25,834 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2023#true} {2023#true} #115#return; {2023#true} is VALID [2022-04-15 11:18:25,834 INFO L272 TraceCheckUtils]: 0: Hoare triple {2023#true} call ULTIMATE.init(); {2029#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:18:25,834 INFO L290 TraceCheckUtils]: 1: Hoare triple {2029#(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); {2023#true} is VALID [2022-04-15 11:18:25,834 INFO L290 TraceCheckUtils]: 2: Hoare triple {2023#true} assume true; {2023#true} is VALID [2022-04-15 11:18:25,835 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2023#true} {2023#true} #115#return; {2023#true} is VALID [2022-04-15 11:18:25,835 INFO L272 TraceCheckUtils]: 4: Hoare triple {2023#true} call #t~ret10 := main(); {2023#true} is VALID [2022-04-15 11:18:25,835 INFO L290 TraceCheckUtils]: 5: Hoare triple {2023#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;havoc ~cond~0; {2023#true} is VALID [2022-04-15 11:18:25,835 INFO L290 TraceCheckUtils]: 6: Hoare triple {2023#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {2023#true} is VALID [2022-04-15 11:18:25,835 INFO L290 TraceCheckUtils]: 7: Hoare triple {2023#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {2023#true} is VALID [2022-04-15 11:18:25,835 INFO L290 TraceCheckUtils]: 8: Hoare triple {2023#true} assume !(0 != ~p1~0); {2023#true} is VALID [2022-04-15 11:18:25,835 INFO L290 TraceCheckUtils]: 9: Hoare triple {2023#true} assume !(0 != ~p2~0); {2023#true} is VALID [2022-04-15 11:18:25,835 INFO L290 TraceCheckUtils]: 10: Hoare triple {2023#true} assume 0 != ~p3~0;~lk3~0 := 1; {2028#(= main_~lk3~0 1)} is VALID [2022-04-15 11:18:25,836 INFO L290 TraceCheckUtils]: 11: Hoare triple {2028#(= main_~lk3~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {2028#(= main_~lk3~0 1)} is VALID [2022-04-15 11:18:25,836 INFO L290 TraceCheckUtils]: 12: Hoare triple {2028#(= main_~lk3~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {2028#(= main_~lk3~0 1)} is VALID [2022-04-15 11:18:25,836 INFO L290 TraceCheckUtils]: 13: Hoare triple {2028#(= main_~lk3~0 1)} assume !(0 != ~p1~0); {2028#(= main_~lk3~0 1)} is VALID [2022-04-15 11:18:25,837 INFO L290 TraceCheckUtils]: 14: Hoare triple {2028#(= main_~lk3~0 1)} assume !(0 != ~p2~0); {2028#(= main_~lk3~0 1)} is VALID [2022-04-15 11:18:25,837 INFO L290 TraceCheckUtils]: 15: Hoare triple {2028#(= main_~lk3~0 1)} assume 0 != ~p3~0; {2028#(= main_~lk3~0 1)} is VALID [2022-04-15 11:18:25,837 INFO L290 TraceCheckUtils]: 16: Hoare triple {2028#(= main_~lk3~0 1)} assume 1 != ~lk3~0; {2024#false} is VALID [2022-04-15 11:18:25,837 INFO L290 TraceCheckUtils]: 17: Hoare triple {2024#false} assume !false; {2024#false} is VALID [2022-04-15 11:18:25,837 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:25,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:18:25,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475723619] [2022-04-15 11:18:25,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475723619] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:25,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:25,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:25,838 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:18:25,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [900397843] [2022-04-15 11:18:25,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [900397843] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:25,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:25,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:25,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288732670] [2022-04-15 11:18:25,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:18:25,839 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:25,839 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:18:25,839 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:25,848 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:25,848 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:18:25,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:25,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:18:25,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:18:25,849 INFO L87 Difference]: Start difference. First operand 75 states and 115 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:25,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:25,926 INFO L93 Difference]: Finished difference Result 131 states and 203 transitions. [2022-04-15 11:18:25,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:18:25,927 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:25,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:18:25,927 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:25,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2022-04-15 11:18:25,928 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:25,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2022-04-15 11:18:25,928 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 63 transitions. [2022-04-15 11:18:25,965 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:25,967 INFO L225 Difference]: With dead ends: 131 [2022-04-15 11:18:25,967 INFO L226 Difference]: Without dead ends: 129 [2022-04-15 11:18:25,967 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:25,968 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 69 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:18:25,968 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 46 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:18:25,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-04-15 11:18:25,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 103. [2022-04-15 11:18:25,977 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:18:25,977 INFO L82 GeneralOperation]: Start isEquivalent. First operand 129 states. Second operand has 103 states, 99 states have (on average 1.5555555555555556) internal successors, (154), 99 states have internal predecessors, (154), 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:25,978 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand has 103 states, 99 states have (on average 1.5555555555555556) internal successors, (154), 99 states have internal predecessors, (154), 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:25,978 INFO L87 Difference]: Start difference. First operand 129 states. Second operand has 103 states, 99 states have (on average 1.5555555555555556) internal successors, (154), 99 states have internal predecessors, (154), 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:25,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:25,981 INFO L93 Difference]: Finished difference Result 129 states and 198 transitions. [2022-04-15 11:18:25,981 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 198 transitions. [2022-04-15 11:18:25,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:25,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:25,981 INFO L74 IsIncluded]: Start isIncluded. First operand has 103 states, 99 states have (on average 1.5555555555555556) internal successors, (154), 99 states have internal predecessors, (154), 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 129 states. [2022-04-15 11:18:25,981 INFO L87 Difference]: Start difference. First operand has 103 states, 99 states have (on average 1.5555555555555556) internal successors, (154), 99 states have internal predecessors, (154), 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 129 states. [2022-04-15 11:18:25,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:25,984 INFO L93 Difference]: Finished difference Result 129 states and 198 transitions. [2022-04-15 11:18:25,984 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 198 transitions. [2022-04-15 11:18:25,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:25,984 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:25,984 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:18:25,984 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:18:25,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 99 states have (on average 1.5555555555555556) internal successors, (154), 99 states have internal predecessors, (154), 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:25,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 157 transitions. [2022-04-15 11:18:25,987 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 157 transitions. Word has length 18 [2022-04-15 11:18:25,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:18:25,987 INFO L478 AbstractCegarLoop]: Abstraction has 103 states and 157 transitions. [2022-04-15 11:18:25,987 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:25,987 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 103 states and 157 transitions. [2022-04-15 11:18:26,110 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:26,110 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 157 transitions. [2022-04-15 11:18:26,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 11:18:26,111 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:18:26,111 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:26,111 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 11:18:26,111 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:18:26,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:18:26,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1355318868, now seen corresponding path program 1 times [2022-04-15 11:18:26,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:26,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1026575817] [2022-04-15 11:18:26,112 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:18:26,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1355318868, now seen corresponding path program 2 times [2022-04-15 11:18:26,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:18:26,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729405175] [2022-04-15 11:18:26,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:18:26,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:18:26,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:26,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:18:26,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:26,152 INFO L290 TraceCheckUtils]: 0: Hoare triple {2767#(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); {2761#true} is VALID [2022-04-15 11:18:26,152 INFO L290 TraceCheckUtils]: 1: Hoare triple {2761#true} assume true; {2761#true} is VALID [2022-04-15 11:18:26,152 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2761#true} {2761#true} #115#return; {2761#true} is VALID [2022-04-15 11:18:26,152 INFO L272 TraceCheckUtils]: 0: Hoare triple {2761#true} call ULTIMATE.init(); {2767#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:18:26,152 INFO L290 TraceCheckUtils]: 1: Hoare triple {2767#(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); {2761#true} is VALID [2022-04-15 11:18:26,153 INFO L290 TraceCheckUtils]: 2: Hoare triple {2761#true} assume true; {2761#true} is VALID [2022-04-15 11:18:26,153 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2761#true} {2761#true} #115#return; {2761#true} is VALID [2022-04-15 11:18:26,153 INFO L272 TraceCheckUtils]: 4: Hoare triple {2761#true} call #t~ret10 := main(); {2761#true} is VALID [2022-04-15 11:18:26,153 INFO L290 TraceCheckUtils]: 5: Hoare triple {2761#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;havoc ~cond~0; {2761#true} is VALID [2022-04-15 11:18:26,153 INFO L290 TraceCheckUtils]: 6: Hoare triple {2761#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {2761#true} is VALID [2022-04-15 11:18:26,153 INFO L290 TraceCheckUtils]: 7: Hoare triple {2761#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {2761#true} is VALID [2022-04-15 11:18:26,153 INFO L290 TraceCheckUtils]: 8: Hoare triple {2761#true} assume !(0 != ~p1~0); {2761#true} is VALID [2022-04-15 11:18:26,153 INFO L290 TraceCheckUtils]: 9: Hoare triple {2761#true} assume !(0 != ~p2~0); {2761#true} is VALID [2022-04-15 11:18:26,153 INFO L290 TraceCheckUtils]: 10: Hoare triple {2761#true} assume !(0 != ~p3~0); {2766#(= main_~p3~0 0)} is VALID [2022-04-15 11:18:26,154 INFO L290 TraceCheckUtils]: 11: Hoare triple {2766#(= main_~p3~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {2766#(= main_~p3~0 0)} is VALID [2022-04-15 11:18:26,154 INFO L290 TraceCheckUtils]: 12: Hoare triple {2766#(= main_~p3~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {2766#(= main_~p3~0 0)} is VALID [2022-04-15 11:18:26,154 INFO L290 TraceCheckUtils]: 13: Hoare triple {2766#(= main_~p3~0 0)} assume !(0 != ~p1~0); {2766#(= main_~p3~0 0)} is VALID [2022-04-15 11:18:26,154 INFO L290 TraceCheckUtils]: 14: Hoare triple {2766#(= main_~p3~0 0)} assume !(0 != ~p2~0); {2766#(= main_~p3~0 0)} is VALID [2022-04-15 11:18:26,155 INFO L290 TraceCheckUtils]: 15: Hoare triple {2766#(= main_~p3~0 0)} assume 0 != ~p3~0; {2762#false} is VALID [2022-04-15 11:18:26,155 INFO L290 TraceCheckUtils]: 16: Hoare triple {2762#false} assume 1 != ~lk3~0; {2762#false} is VALID [2022-04-15 11:18:26,155 INFO L290 TraceCheckUtils]: 17: Hoare triple {2762#false} assume !false; {2762#false} is VALID [2022-04-15 11:18:26,155 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:26,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:18:26,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729405175] [2022-04-15 11:18:26,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729405175] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:26,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:26,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:26,155 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:18:26,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1026575817] [2022-04-15 11:18:26,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1026575817] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:26,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:26,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:26,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850814012] [2022-04-15 11:18:26,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:18:26,156 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:26,156 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:18:26,156 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:26,165 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:26,165 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:18:26,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:26,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:18:26,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:18:26,166 INFO L87 Difference]: Start difference. First operand 103 states and 157 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:26,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:26,248 INFO L93 Difference]: Finished difference Result 231 states and 355 transitions. [2022-04-15 11:18:26,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:18:26,250 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:26,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:18:26,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:26,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2022-04-15 11:18:26,252 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:26,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2022-04-15 11:18:26,253 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 96 transitions. [2022-04-15 11:18:26,311 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:26,313 INFO L225 Difference]: With dead ends: 231 [2022-04-15 11:18:26,313 INFO L226 Difference]: Without dead ends: 137 [2022-04-15 11:18:26,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:26,315 INFO L913 BasicCegarLoop]: 52 mSDtfsCounter, 61 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:18:26,315 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 59 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:18:26,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-04-15 11:18:26,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2022-04-15 11:18:26,332 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:18:26,332 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states. Second operand has 135 states, 131 states have (on average 1.4961832061068703) internal successors, (196), 131 states have internal predecessors, (196), 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:26,332 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand has 135 states, 131 states have (on average 1.4961832061068703) internal successors, (196), 131 states have internal predecessors, (196), 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:26,332 INFO L87 Difference]: Start difference. First operand 137 states. Second operand has 135 states, 131 states have (on average 1.4961832061068703) internal successors, (196), 131 states have internal predecessors, (196), 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:26,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:26,335 INFO L93 Difference]: Finished difference Result 137 states and 200 transitions. [2022-04-15 11:18:26,335 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 200 transitions. [2022-04-15 11:18:26,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:26,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:26,336 INFO L74 IsIncluded]: Start isIncluded. First operand has 135 states, 131 states have (on average 1.4961832061068703) internal successors, (196), 131 states have internal predecessors, (196), 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 137 states. [2022-04-15 11:18:26,336 INFO L87 Difference]: Start difference. First operand has 135 states, 131 states have (on average 1.4961832061068703) internal successors, (196), 131 states have internal predecessors, (196), 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 137 states. [2022-04-15 11:18:26,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:26,339 INFO L93 Difference]: Finished difference Result 137 states and 200 transitions. [2022-04-15 11:18:26,339 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 200 transitions. [2022-04-15 11:18:26,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:26,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:26,339 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:18:26,339 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:18:26,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 131 states have (on average 1.4961832061068703) internal successors, (196), 131 states have internal predecessors, (196), 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:26,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 199 transitions. [2022-04-15 11:18:26,343 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 199 transitions. Word has length 18 [2022-04-15 11:18:26,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:18:26,343 INFO L478 AbstractCegarLoop]: Abstraction has 135 states and 199 transitions. [2022-04-15 11:18:26,343 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:26,343 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 135 states and 199 transitions. [2022-04-15 11:18:26,498 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 199 edges. 199 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:26,498 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 199 transitions. [2022-04-15 11:18:26,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 11:18:26,499 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:18:26,499 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:26,499 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-15 11:18:26,499 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:18:26,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:18:26,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1614630737, now seen corresponding path program 1 times [2022-04-15 11:18:26,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:26,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1914971642] [2022-04-15 11:18:26,501 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:18:26,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1614630737, now seen corresponding path program 2 times [2022-04-15 11:18:26,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:18:26,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184422720] [2022-04-15 11:18:26,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:18:26,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:18:26,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:26,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:18:26,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:26,558 INFO L290 TraceCheckUtils]: 0: Hoare triple {3785#(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); {3779#true} is VALID [2022-04-15 11:18:26,558 INFO L290 TraceCheckUtils]: 1: Hoare triple {3779#true} assume true; {3779#true} is VALID [2022-04-15 11:18:26,559 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3779#true} {3779#true} #115#return; {3779#true} is VALID [2022-04-15 11:18:26,559 INFO L272 TraceCheckUtils]: 0: Hoare triple {3779#true} call ULTIMATE.init(); {3785#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:18:26,559 INFO L290 TraceCheckUtils]: 1: Hoare triple {3785#(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); {3779#true} is VALID [2022-04-15 11:18:26,559 INFO L290 TraceCheckUtils]: 2: Hoare triple {3779#true} assume true; {3779#true} is VALID [2022-04-15 11:18:26,559 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3779#true} {3779#true} #115#return; {3779#true} is VALID [2022-04-15 11:18:26,559 INFO L272 TraceCheckUtils]: 4: Hoare triple {3779#true} call #t~ret10 := main(); {3779#true} is VALID [2022-04-15 11:18:26,559 INFO L290 TraceCheckUtils]: 5: Hoare triple {3779#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;havoc ~cond~0; {3779#true} is VALID [2022-04-15 11:18:26,559 INFO L290 TraceCheckUtils]: 6: Hoare triple {3779#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {3779#true} is VALID [2022-04-15 11:18:26,560 INFO L290 TraceCheckUtils]: 7: Hoare triple {3779#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {3779#true} is VALID [2022-04-15 11:18:26,560 INFO L290 TraceCheckUtils]: 8: Hoare triple {3779#true} assume !(0 != ~p1~0); {3779#true} is VALID [2022-04-15 11:18:26,560 INFO L290 TraceCheckUtils]: 9: Hoare triple {3779#true} assume !(0 != ~p2~0); {3779#true} is VALID [2022-04-15 11:18:26,560 INFO L290 TraceCheckUtils]: 10: Hoare triple {3779#true} assume 0 != ~p3~0;~lk3~0 := 1; {3784#(not (= main_~p3~0 0))} is VALID [2022-04-15 11:18:26,560 INFO L290 TraceCheckUtils]: 11: Hoare triple {3784#(not (= main_~p3~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {3784#(not (= main_~p3~0 0))} is VALID [2022-04-15 11:18:26,561 INFO L290 TraceCheckUtils]: 12: Hoare triple {3784#(not (= main_~p3~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {3784#(not (= main_~p3~0 0))} is VALID [2022-04-15 11:18:26,561 INFO L290 TraceCheckUtils]: 13: Hoare triple {3784#(not (= main_~p3~0 0))} assume !(0 != ~p1~0); {3784#(not (= main_~p3~0 0))} is VALID [2022-04-15 11:18:26,561 INFO L290 TraceCheckUtils]: 14: Hoare triple {3784#(not (= main_~p3~0 0))} assume !(0 != ~p2~0); {3784#(not (= main_~p3~0 0))} is VALID [2022-04-15 11:18:26,561 INFO L290 TraceCheckUtils]: 15: Hoare triple {3784#(not (= main_~p3~0 0))} assume !(0 != ~p3~0); {3780#false} is VALID [2022-04-15 11:18:26,562 INFO L290 TraceCheckUtils]: 16: Hoare triple {3780#false} assume 0 != ~p4~0; {3780#false} is VALID [2022-04-15 11:18:26,562 INFO L290 TraceCheckUtils]: 17: Hoare triple {3780#false} assume 1 != ~lk4~0; {3780#false} is VALID [2022-04-15 11:18:26,562 INFO L290 TraceCheckUtils]: 18: Hoare triple {3780#false} assume !false; {3780#false} is VALID [2022-04-15 11:18:26,562 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:26,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:18:26,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184422720] [2022-04-15 11:18:26,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184422720] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:26,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:26,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:26,562 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:18:26,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1914971642] [2022-04-15 11:18:26,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1914971642] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:26,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:26,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:26,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603500115] [2022-04-15 11:18:26,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:18:26,563 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:26,563 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:18:26,563 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:26,573 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:26,573 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:18:26,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:26,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:18:26,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:18:26,574 INFO L87 Difference]: Start difference. First operand 135 states and 199 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:26,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:26,655 INFO L93 Difference]: Finished difference Result 205 states and 301 transitions. [2022-04-15 11:18:26,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:18:26,655 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:26,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:18:26,655 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:26,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2022-04-15 11:18:26,656 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:26,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2022-04-15 11:18:26,657 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 91 transitions. [2022-04-15 11:18:26,708 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:26,709 INFO L225 Difference]: With dead ends: 205 [2022-04-15 11:18:26,709 INFO L226 Difference]: Without dead ends: 143 [2022-04-15 11:18:26,710 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:26,710 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 64 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:18:26,711 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 57 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:18:26,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-04-15 11:18:26,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2022-04-15 11:18:26,720 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:18:26,720 INFO L82 GeneralOperation]: Start isEquivalent. First operand 143 states. Second operand has 141 states, 137 states have (on average 1.4598540145985401) internal successors, (200), 137 states have internal predecessors, (200), 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:26,721 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand has 141 states, 137 states have (on average 1.4598540145985401) internal successors, (200), 137 states have internal predecessors, (200), 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:26,721 INFO L87 Difference]: Start difference. First operand 143 states. Second operand has 141 states, 137 states have (on average 1.4598540145985401) internal successors, (200), 137 states have internal predecessors, (200), 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:26,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:26,724 INFO L93 Difference]: Finished difference Result 143 states and 204 transitions. [2022-04-15 11:18:26,724 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 204 transitions. [2022-04-15 11:18:26,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:26,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:26,725 INFO L74 IsIncluded]: Start isIncluded. First operand has 141 states, 137 states have (on average 1.4598540145985401) internal successors, (200), 137 states have internal predecessors, (200), 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 143 states. [2022-04-15 11:18:26,725 INFO L87 Difference]: Start difference. First operand has 141 states, 137 states have (on average 1.4598540145985401) internal successors, (200), 137 states have internal predecessors, (200), 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 143 states. [2022-04-15 11:18:26,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:26,728 INFO L93 Difference]: Finished difference Result 143 states and 204 transitions. [2022-04-15 11:18:26,728 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 204 transitions. [2022-04-15 11:18:26,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:26,728 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:26,728 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:18:26,728 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:18:26,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 137 states have (on average 1.4598540145985401) internal successors, (200), 137 states have internal predecessors, (200), 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:26,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 203 transitions. [2022-04-15 11:18:26,731 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 203 transitions. Word has length 19 [2022-04-15 11:18:26,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:18:26,731 INFO L478 AbstractCegarLoop]: Abstraction has 141 states and 203 transitions. [2022-04-15 11:18:26,731 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:26,731 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 141 states and 203 transitions. [2022-04-15 11:18:26,902 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 203 edges. 203 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:26,902 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 203 transitions. [2022-04-15 11:18:26,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 11:18:26,903 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:18:26,903 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:26,903 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-15 11:18:26,903 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:18:26,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:18:26,903 INFO L85 PathProgramCache]: Analyzing trace with hash -934572367, now seen corresponding path program 1 times [2022-04-15 11:18:26,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:26,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2121023794] [2022-04-15 11:18:26,904 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:18:26,904 INFO L85 PathProgramCache]: Analyzing trace with hash -934572367, now seen corresponding path program 2 times [2022-04-15 11:18:26,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:18:26,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752653132] [2022-04-15 11:18:26,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:18:26,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:18:26,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:26,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:18:26,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:26,929 INFO L290 TraceCheckUtils]: 0: Hoare triple {4775#(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); {4769#true} is VALID [2022-04-15 11:18:26,930 INFO L290 TraceCheckUtils]: 1: Hoare triple {4769#true} assume true; {4769#true} is VALID [2022-04-15 11:18:26,930 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4769#true} {4769#true} #115#return; {4769#true} is VALID [2022-04-15 11:18:26,930 INFO L272 TraceCheckUtils]: 0: Hoare triple {4769#true} call ULTIMATE.init(); {4775#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:18:26,930 INFO L290 TraceCheckUtils]: 1: Hoare triple {4775#(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); {4769#true} is VALID [2022-04-15 11:18:26,930 INFO L290 TraceCheckUtils]: 2: Hoare triple {4769#true} assume true; {4769#true} is VALID [2022-04-15 11:18:26,930 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4769#true} {4769#true} #115#return; {4769#true} is VALID [2022-04-15 11:18:26,931 INFO L272 TraceCheckUtils]: 4: Hoare triple {4769#true} call #t~ret10 := main(); {4769#true} is VALID [2022-04-15 11:18:26,931 INFO L290 TraceCheckUtils]: 5: Hoare triple {4769#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;havoc ~cond~0; {4769#true} is VALID [2022-04-15 11:18:26,931 INFO L290 TraceCheckUtils]: 6: Hoare triple {4769#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {4769#true} is VALID [2022-04-15 11:18:26,931 INFO L290 TraceCheckUtils]: 7: Hoare triple {4769#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {4769#true} is VALID [2022-04-15 11:18:26,931 INFO L290 TraceCheckUtils]: 8: Hoare triple {4769#true} assume !(0 != ~p1~0); {4769#true} is VALID [2022-04-15 11:18:26,931 INFO L290 TraceCheckUtils]: 9: Hoare triple {4769#true} assume !(0 != ~p2~0); {4769#true} is VALID [2022-04-15 11:18:26,931 INFO L290 TraceCheckUtils]: 10: Hoare triple {4769#true} assume !(0 != ~p3~0); {4769#true} is VALID [2022-04-15 11:18:26,931 INFO L290 TraceCheckUtils]: 11: Hoare triple {4769#true} assume 0 != ~p4~0;~lk4~0 := 1; {4774#(= main_~lk4~0 1)} is VALID [2022-04-15 11:18:26,932 INFO L290 TraceCheckUtils]: 12: Hoare triple {4774#(= main_~lk4~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {4774#(= main_~lk4~0 1)} is VALID [2022-04-15 11:18:26,932 INFO L290 TraceCheckUtils]: 13: Hoare triple {4774#(= main_~lk4~0 1)} assume !(0 != ~p1~0); {4774#(= main_~lk4~0 1)} is VALID [2022-04-15 11:18:26,932 INFO L290 TraceCheckUtils]: 14: Hoare triple {4774#(= main_~lk4~0 1)} assume !(0 != ~p2~0); {4774#(= main_~lk4~0 1)} is VALID [2022-04-15 11:18:26,932 INFO L290 TraceCheckUtils]: 15: Hoare triple {4774#(= main_~lk4~0 1)} assume !(0 != ~p3~0); {4774#(= main_~lk4~0 1)} is VALID [2022-04-15 11:18:26,933 INFO L290 TraceCheckUtils]: 16: Hoare triple {4774#(= main_~lk4~0 1)} assume 0 != ~p4~0; {4774#(= main_~lk4~0 1)} is VALID [2022-04-15 11:18:26,933 INFO L290 TraceCheckUtils]: 17: Hoare triple {4774#(= main_~lk4~0 1)} assume 1 != ~lk4~0; {4770#false} is VALID [2022-04-15 11:18:26,933 INFO L290 TraceCheckUtils]: 18: Hoare triple {4770#false} assume !false; {4770#false} is VALID [2022-04-15 11:18:26,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:18:26,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:18:26,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752653132] [2022-04-15 11:18:26,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752653132] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:26,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:26,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:26,934 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:18:26,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2121023794] [2022-04-15 11:18:26,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2121023794] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:26,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:26,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:26,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354698138] [2022-04-15 11:18:26,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:18:26,934 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:26,934 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:18:26,934 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:26,944 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:26,944 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:18:26,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:26,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:18:26,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:18:26,944 INFO L87 Difference]: Start difference. First operand 141 states and 203 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:27,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:27,038 INFO L93 Difference]: Finished difference Result 237 states and 341 transitions. [2022-04-15 11:18:27,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:18:27,038 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:27,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:18:27,040 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:27,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2022-04-15 11:18:27,040 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:27,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2022-04-15 11:18:27,044 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 59 transitions. [2022-04-15 11:18:27,080 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:27,083 INFO L225 Difference]: With dead ends: 237 [2022-04-15 11:18:27,083 INFO L226 Difference]: Without dead ends: 235 [2022-04-15 11:18:27,083 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:27,084 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 62 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:18:27,084 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 45 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:18:27,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2022-04-15 11:18:27,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 201. [2022-04-15 11:18:27,100 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:18:27,101 INFO L82 GeneralOperation]: Start isEquivalent. First operand 235 states. Second operand has 201 states, 197 states have (on average 1.4213197969543148) internal successors, (280), 197 states have internal predecessors, (280), 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:27,101 INFO L74 IsIncluded]: Start isIncluded. First operand 235 states. Second operand has 201 states, 197 states have (on average 1.4213197969543148) internal successors, (280), 197 states have internal predecessors, (280), 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:27,101 INFO L87 Difference]: Start difference. First operand 235 states. Second operand has 201 states, 197 states have (on average 1.4213197969543148) internal successors, (280), 197 states have internal predecessors, (280), 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:27,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:27,105 INFO L93 Difference]: Finished difference Result 235 states and 332 transitions. [2022-04-15 11:18:27,105 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 332 transitions. [2022-04-15 11:18:27,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:27,106 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:27,106 INFO L74 IsIncluded]: Start isIncluded. First operand has 201 states, 197 states have (on average 1.4213197969543148) internal successors, (280), 197 states have internal predecessors, (280), 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 235 states. [2022-04-15 11:18:27,106 INFO L87 Difference]: Start difference. First operand has 201 states, 197 states have (on average 1.4213197969543148) internal successors, (280), 197 states have internal predecessors, (280), 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 235 states. [2022-04-15 11:18:27,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:27,109 INFO L93 Difference]: Finished difference Result 235 states and 332 transitions. [2022-04-15 11:18:27,109 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 332 transitions. [2022-04-15 11:18:27,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:27,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:27,110 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:18:27,110 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:18:27,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 197 states have (on average 1.4213197969543148) internal successors, (280), 197 states have internal predecessors, (280), 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:27,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 283 transitions. [2022-04-15 11:18:27,113 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 283 transitions. Word has length 19 [2022-04-15 11:18:27,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:18:27,113 INFO L478 AbstractCegarLoop]: Abstraction has 201 states and 283 transitions. [2022-04-15 11:18:27,113 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:27,113 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 201 states and 283 transitions. [2022-04-15 11:18:27,362 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 283 edges. 283 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:27,362 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 283 transitions. [2022-04-15 11:18:27,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 11:18:27,363 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:18:27,363 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:27,363 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-15 11:18:27,363 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:18:27,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:18:27,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1743918993, now seen corresponding path program 1 times [2022-04-15 11:18:27,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:27,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [241991543] [2022-04-15 11:18:27,364 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:18:27,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1743918993, now seen corresponding path program 2 times [2022-04-15 11:18:27,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:18:27,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672806224] [2022-04-15 11:18:27,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:18:27,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:18:27,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:27,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:18:27,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:27,411 INFO L290 TraceCheckUtils]: 0: Hoare triple {6133#(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); {6127#true} is VALID [2022-04-15 11:18:27,411 INFO L290 TraceCheckUtils]: 1: Hoare triple {6127#true} assume true; {6127#true} is VALID [2022-04-15 11:18:27,411 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6127#true} {6127#true} #115#return; {6127#true} is VALID [2022-04-15 11:18:27,412 INFO L272 TraceCheckUtils]: 0: Hoare triple {6127#true} call ULTIMATE.init(); {6133#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:18:27,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {6133#(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); {6127#true} is VALID [2022-04-15 11:18:27,412 INFO L290 TraceCheckUtils]: 2: Hoare triple {6127#true} assume true; {6127#true} is VALID [2022-04-15 11:18:27,412 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6127#true} {6127#true} #115#return; {6127#true} is VALID [2022-04-15 11:18:27,413 INFO L272 TraceCheckUtils]: 4: Hoare triple {6127#true} call #t~ret10 := main(); {6127#true} is VALID [2022-04-15 11:18:27,413 INFO L290 TraceCheckUtils]: 5: Hoare triple {6127#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;havoc ~cond~0; {6127#true} is VALID [2022-04-15 11:18:27,413 INFO L290 TraceCheckUtils]: 6: Hoare triple {6127#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {6127#true} is VALID [2022-04-15 11:18:27,413 INFO L290 TraceCheckUtils]: 7: Hoare triple {6127#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {6127#true} is VALID [2022-04-15 11:18:27,413 INFO L290 TraceCheckUtils]: 8: Hoare triple {6127#true} assume !(0 != ~p1~0); {6127#true} is VALID [2022-04-15 11:18:27,413 INFO L290 TraceCheckUtils]: 9: Hoare triple {6127#true} assume !(0 != ~p2~0); {6127#true} is VALID [2022-04-15 11:18:27,413 INFO L290 TraceCheckUtils]: 10: Hoare triple {6127#true} assume !(0 != ~p3~0); {6127#true} is VALID [2022-04-15 11:18:27,413 INFO L290 TraceCheckUtils]: 11: Hoare triple {6127#true} assume !(0 != ~p4~0); {6132#(= main_~p4~0 0)} is VALID [2022-04-15 11:18:27,414 INFO L290 TraceCheckUtils]: 12: Hoare triple {6132#(= main_~p4~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {6132#(= main_~p4~0 0)} is VALID [2022-04-15 11:18:27,417 INFO L290 TraceCheckUtils]: 13: Hoare triple {6132#(= main_~p4~0 0)} assume !(0 != ~p1~0); {6132#(= main_~p4~0 0)} is VALID [2022-04-15 11:18:27,417 INFO L290 TraceCheckUtils]: 14: Hoare triple {6132#(= main_~p4~0 0)} assume !(0 != ~p2~0); {6132#(= main_~p4~0 0)} is VALID [2022-04-15 11:18:27,417 INFO L290 TraceCheckUtils]: 15: Hoare triple {6132#(= main_~p4~0 0)} assume !(0 != ~p3~0); {6132#(= main_~p4~0 0)} is VALID [2022-04-15 11:18:27,418 INFO L290 TraceCheckUtils]: 16: Hoare triple {6132#(= main_~p4~0 0)} assume 0 != ~p4~0; {6128#false} is VALID [2022-04-15 11:18:27,418 INFO L290 TraceCheckUtils]: 17: Hoare triple {6128#false} assume 1 != ~lk4~0; {6128#false} is VALID [2022-04-15 11:18:27,418 INFO L290 TraceCheckUtils]: 18: Hoare triple {6128#false} assume !false; {6128#false} is VALID [2022-04-15 11:18:27,418 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:27,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:18:27,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672806224] [2022-04-15 11:18:27,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672806224] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:27,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:27,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:27,419 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:18:27,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [241991543] [2022-04-15 11:18:27,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [241991543] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:27,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:27,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:27,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238524304] [2022-04-15 11:18:27,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:18:27,419 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:27,419 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:18:27,419 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:27,429 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:27,429 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:18:27,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:27,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:18:27,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:18:27,429 INFO L87 Difference]: Start difference. First operand 201 states and 283 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:27,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:27,520 INFO L93 Difference]: Finished difference Result 445 states and 621 transitions. [2022-04-15 11:18:27,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:18:27,520 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:27,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:18:27,520 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:27,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2022-04-15 11:18:27,521 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:27,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2022-04-15 11:18:27,522 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 93 transitions. [2022-04-15 11:18:27,584 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:27,587 INFO L225 Difference]: With dead ends: 445 [2022-04-15 11:18:27,587 INFO L226 Difference]: Without dead ends: 259 [2022-04-15 11:18:27,590 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:27,590 INFO L913 BasicCegarLoop]: 54 mSDtfsCounter, 55 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:18:27,591 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 61 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:18:27,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-04-15 11:18:27,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 257. [2022-04-15 11:18:27,604 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:18:27,605 INFO L82 GeneralOperation]: Start isEquivalent. First operand 259 states. Second operand has 257 states, 253 states have (on average 1.3438735177865613) internal successors, (340), 253 states have internal predecessors, (340), 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:27,605 INFO L74 IsIncluded]: Start isIncluded. First operand 259 states. Second operand has 257 states, 253 states have (on average 1.3438735177865613) internal successors, (340), 253 states have internal predecessors, (340), 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:27,606 INFO L87 Difference]: Start difference. First operand 259 states. Second operand has 257 states, 253 states have (on average 1.3438735177865613) internal successors, (340), 253 states have internal predecessors, (340), 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:27,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:27,610 INFO L93 Difference]: Finished difference Result 259 states and 344 transitions. [2022-04-15 11:18:27,610 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 344 transitions. [2022-04-15 11:18:27,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:27,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:27,611 INFO L74 IsIncluded]: Start isIncluded. First operand has 257 states, 253 states have (on average 1.3438735177865613) internal successors, (340), 253 states have internal predecessors, (340), 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 259 states. [2022-04-15 11:18:27,611 INFO L87 Difference]: Start difference. First operand has 257 states, 253 states have (on average 1.3438735177865613) internal successors, (340), 253 states have internal predecessors, (340), 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 259 states. [2022-04-15 11:18:27,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:27,615 INFO L93 Difference]: Finished difference Result 259 states and 344 transitions. [2022-04-15 11:18:27,615 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 344 transitions. [2022-04-15 11:18:27,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:27,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:27,615 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:18:27,615 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:18:27,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 253 states have (on average 1.3438735177865613) internal successors, (340), 253 states have internal predecessors, (340), 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:27,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 343 transitions. [2022-04-15 11:18:27,630 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 343 transitions. Word has length 19 [2022-04-15 11:18:27,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:18:27,630 INFO L478 AbstractCegarLoop]: Abstraction has 257 states and 343 transitions. [2022-04-15 11:18:27,631 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:27,631 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 257 states and 343 transitions. [2022-04-15 11:18:27,948 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 343 edges. 343 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:27,948 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 343 transitions. [2022-04-15 11:18:27,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 11:18:27,948 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:18:27,949 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:27,949 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-15 11:18:27,949 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:18:27,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:18:27,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1093243721, now seen corresponding path program 1 times [2022-04-15 11:18:27,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:27,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1512221623] [2022-04-15 11:18:27,950 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:18:27,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1093243721, now seen corresponding path program 2 times [2022-04-15 11:18:27,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:18:27,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395731758] [2022-04-15 11:18:27,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:18:27,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:18:27,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:27,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:18:27,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:27,994 INFO L290 TraceCheckUtils]: 0: Hoare triple {8067#(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); {8061#true} is VALID [2022-04-15 11:18:27,994 INFO L290 TraceCheckUtils]: 1: Hoare triple {8061#true} assume true; {8061#true} is VALID [2022-04-15 11:18:27,994 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8061#true} {8061#true} #115#return; {8061#true} is VALID [2022-04-15 11:18:27,995 INFO L272 TraceCheckUtils]: 0: Hoare triple {8061#true} call ULTIMATE.init(); {8067#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:18:27,995 INFO L290 TraceCheckUtils]: 1: Hoare triple {8067#(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); {8061#true} is VALID [2022-04-15 11:18:27,995 INFO L290 TraceCheckUtils]: 2: Hoare triple {8061#true} assume true; {8061#true} is VALID [2022-04-15 11:18:27,995 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8061#true} {8061#true} #115#return; {8061#true} is VALID [2022-04-15 11:18:27,995 INFO L272 TraceCheckUtils]: 4: Hoare triple {8061#true} call #t~ret10 := main(); {8061#true} is VALID [2022-04-15 11:18:27,995 INFO L290 TraceCheckUtils]: 5: Hoare triple {8061#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;havoc ~cond~0; {8061#true} is VALID [2022-04-15 11:18:27,995 INFO L290 TraceCheckUtils]: 6: Hoare triple {8061#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {8061#true} is VALID [2022-04-15 11:18:27,995 INFO L290 TraceCheckUtils]: 7: Hoare triple {8061#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {8061#true} is VALID [2022-04-15 11:18:27,995 INFO L290 TraceCheckUtils]: 8: Hoare triple {8061#true} assume !(0 != ~p1~0); {8061#true} is VALID [2022-04-15 11:18:27,995 INFO L290 TraceCheckUtils]: 9: Hoare triple {8061#true} assume !(0 != ~p2~0); {8061#true} is VALID [2022-04-15 11:18:27,995 INFO L290 TraceCheckUtils]: 10: Hoare triple {8061#true} assume !(0 != ~p3~0); {8061#true} is VALID [2022-04-15 11:18:27,996 INFO L290 TraceCheckUtils]: 11: Hoare triple {8061#true} assume 0 != ~p4~0;~lk4~0 := 1; {8066#(not (= main_~p4~0 0))} is VALID [2022-04-15 11:18:27,996 INFO L290 TraceCheckUtils]: 12: Hoare triple {8066#(not (= main_~p4~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {8066#(not (= main_~p4~0 0))} is VALID [2022-04-15 11:18:27,996 INFO L290 TraceCheckUtils]: 13: Hoare triple {8066#(not (= main_~p4~0 0))} assume !(0 != ~p1~0); {8066#(not (= main_~p4~0 0))} is VALID [2022-04-15 11:18:27,996 INFO L290 TraceCheckUtils]: 14: Hoare triple {8066#(not (= main_~p4~0 0))} assume !(0 != ~p2~0); {8066#(not (= main_~p4~0 0))} is VALID [2022-04-15 11:18:27,997 INFO L290 TraceCheckUtils]: 15: Hoare triple {8066#(not (= main_~p4~0 0))} assume !(0 != ~p3~0); {8066#(not (= main_~p4~0 0))} is VALID [2022-04-15 11:18:27,997 INFO L290 TraceCheckUtils]: 16: Hoare triple {8066#(not (= main_~p4~0 0))} assume !(0 != ~p4~0); {8062#false} is VALID [2022-04-15 11:18:27,997 INFO L290 TraceCheckUtils]: 17: Hoare triple {8062#false} assume 0 != ~p5~0; {8062#false} is VALID [2022-04-15 11:18:27,997 INFO L290 TraceCheckUtils]: 18: Hoare triple {8062#false} assume 1 != ~lk5~0; {8062#false} is VALID [2022-04-15 11:18:27,997 INFO L290 TraceCheckUtils]: 19: Hoare triple {8062#false} assume !false; {8062#false} is VALID [2022-04-15 11:18:27,997 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:27,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:18:27,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395731758] [2022-04-15 11:18:27,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395731758] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:27,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:27,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:27,998 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:18:27,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1512221623] [2022-04-15 11:18:27,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1512221623] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:27,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:27,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:27,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753490277] [2022-04-15 11:18:27,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:18:27,998 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:27,999 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:18:27,999 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:28,008 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:28,008 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:18:28,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:28,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:18:28,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:18:28,009 INFO L87 Difference]: Start difference. First operand 257 states and 343 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:28,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:28,089 INFO L93 Difference]: Finished difference Result 385 states and 509 transitions. [2022-04-15 11:18:28,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:18:28,089 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:28,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:18:28,090 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:28,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2022-04-15 11:18:28,091 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:28,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2022-04-15 11:18:28,091 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 88 transitions. [2022-04-15 11:18:28,136 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:28,140 INFO L225 Difference]: With dead ends: 385 [2022-04-15 11:18:28,140 INFO L226 Difference]: Without dead ends: 267 [2022-04-15 11:18:28,141 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:28,141 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 63 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:18:28,141 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 54 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:18:28,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-04-15 11:18:28,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 265. [2022-04-15 11:18:28,156 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:18:28,157 INFO L82 GeneralOperation]: Start isEquivalent. First operand 267 states. Second operand has 265 states, 261 states have (on average 1.3026819923371646) internal successors, (340), 261 states have internal predecessors, (340), 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:28,157 INFO L74 IsIncluded]: Start isIncluded. First operand 267 states. Second operand has 265 states, 261 states have (on average 1.3026819923371646) internal successors, (340), 261 states have internal predecessors, (340), 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:28,157 INFO L87 Difference]: Start difference. First operand 267 states. Second operand has 265 states, 261 states have (on average 1.3026819923371646) internal successors, (340), 261 states have internal predecessors, (340), 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:28,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:28,163 INFO L93 Difference]: Finished difference Result 267 states and 344 transitions. [2022-04-15 11:18:28,163 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 344 transitions. [2022-04-15 11:18:28,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:28,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:28,164 INFO L74 IsIncluded]: Start isIncluded. First operand has 265 states, 261 states have (on average 1.3026819923371646) internal successors, (340), 261 states have internal predecessors, (340), 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 267 states. [2022-04-15 11:18:28,164 INFO L87 Difference]: Start difference. First operand has 265 states, 261 states have (on average 1.3026819923371646) internal successors, (340), 261 states have internal predecessors, (340), 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 267 states. [2022-04-15 11:18:28,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:28,168 INFO L93 Difference]: Finished difference Result 267 states and 344 transitions. [2022-04-15 11:18:28,168 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 344 transitions. [2022-04-15 11:18:28,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:28,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:28,168 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:18:28,168 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:18:28,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 261 states have (on average 1.3026819923371646) internal successors, (340), 261 states have internal predecessors, (340), 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:28,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 343 transitions. [2022-04-15 11:18:28,183 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 343 transitions. Word has length 20 [2022-04-15 11:18:28,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:18:28,183 INFO L478 AbstractCegarLoop]: Abstraction has 265 states and 343 transitions. [2022-04-15 11:18:28,183 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:28,184 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 265 states and 343 transitions. [2022-04-15 11:18:28,492 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 343 edges. 343 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:28,492 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 343 transitions. [2022-04-15 11:18:28,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 11:18:28,493 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:18:28,493 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:28,493 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-15 11:18:28,493 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:18:28,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:18:28,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1773302091, now seen corresponding path program 1 times [2022-04-15 11:18:28,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:28,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [812704844] [2022-04-15 11:18:28,494 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:18:28,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1773302091, now seen corresponding path program 2 times [2022-04-15 11:18:28,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:18:28,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270939343] [2022-04-15 11:18:28,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:18:28,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:18:28,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:28,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:18:28,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:28,532 INFO L290 TraceCheckUtils]: 0: Hoare triple {9913#(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); {9907#true} is VALID [2022-04-15 11:18:28,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {9907#true} assume true; {9907#true} is VALID [2022-04-15 11:18:28,532 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9907#true} {9907#true} #115#return; {9907#true} is VALID [2022-04-15 11:18:28,532 INFO L272 TraceCheckUtils]: 0: Hoare triple {9907#true} call ULTIMATE.init(); {9913#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:18:28,533 INFO L290 TraceCheckUtils]: 1: Hoare triple {9913#(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); {9907#true} is VALID [2022-04-15 11:18:28,533 INFO L290 TraceCheckUtils]: 2: Hoare triple {9907#true} assume true; {9907#true} is VALID [2022-04-15 11:18:28,533 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9907#true} {9907#true} #115#return; {9907#true} is VALID [2022-04-15 11:18:28,533 INFO L272 TraceCheckUtils]: 4: Hoare triple {9907#true} call #t~ret10 := main(); {9907#true} is VALID [2022-04-15 11:18:28,533 INFO L290 TraceCheckUtils]: 5: Hoare triple {9907#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;havoc ~cond~0; {9907#true} is VALID [2022-04-15 11:18:28,533 INFO L290 TraceCheckUtils]: 6: Hoare triple {9907#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {9907#true} is VALID [2022-04-15 11:18:28,533 INFO L290 TraceCheckUtils]: 7: Hoare triple {9907#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {9907#true} is VALID [2022-04-15 11:18:28,533 INFO L290 TraceCheckUtils]: 8: Hoare triple {9907#true} assume !(0 != ~p1~0); {9907#true} is VALID [2022-04-15 11:18:28,533 INFO L290 TraceCheckUtils]: 9: Hoare triple {9907#true} assume !(0 != ~p2~0); {9907#true} is VALID [2022-04-15 11:18:28,538 INFO L290 TraceCheckUtils]: 10: Hoare triple {9907#true} assume !(0 != ~p3~0); {9907#true} is VALID [2022-04-15 11:18:28,538 INFO L290 TraceCheckUtils]: 11: Hoare triple {9907#true} assume !(0 != ~p4~0); {9907#true} is VALID [2022-04-15 11:18:28,540 INFO L290 TraceCheckUtils]: 12: Hoare triple {9907#true} assume 0 != ~p5~0;~lk5~0 := 1; {9912#(= main_~lk5~0 1)} is VALID [2022-04-15 11:18:28,541 INFO L290 TraceCheckUtils]: 13: Hoare triple {9912#(= main_~lk5~0 1)} assume !(0 != ~p1~0); {9912#(= main_~lk5~0 1)} is VALID [2022-04-15 11:18:28,543 INFO L290 TraceCheckUtils]: 14: Hoare triple {9912#(= main_~lk5~0 1)} assume !(0 != ~p2~0); {9912#(= main_~lk5~0 1)} is VALID [2022-04-15 11:18:28,544 INFO L290 TraceCheckUtils]: 15: Hoare triple {9912#(= main_~lk5~0 1)} assume !(0 != ~p3~0); {9912#(= main_~lk5~0 1)} is VALID [2022-04-15 11:18:28,545 INFO L290 TraceCheckUtils]: 16: Hoare triple {9912#(= main_~lk5~0 1)} assume !(0 != ~p4~0); {9912#(= main_~lk5~0 1)} is VALID [2022-04-15 11:18:28,545 INFO L290 TraceCheckUtils]: 17: Hoare triple {9912#(= main_~lk5~0 1)} assume 0 != ~p5~0; {9912#(= main_~lk5~0 1)} is VALID [2022-04-15 11:18:28,546 INFO L290 TraceCheckUtils]: 18: Hoare triple {9912#(= main_~lk5~0 1)} assume 1 != ~lk5~0; {9908#false} is VALID [2022-04-15 11:18:28,546 INFO L290 TraceCheckUtils]: 19: Hoare triple {9908#false} assume !false; {9908#false} is VALID [2022-04-15 11:18:28,546 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:28,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:18:28,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270939343] [2022-04-15 11:18:28,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270939343] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:28,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:28,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:28,547 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:18:28,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [812704844] [2022-04-15 11:18:28,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [812704844] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:28,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:28,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:28,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441820979] [2022-04-15 11:18:28,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:18:28,547 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:28,547 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:18:28,548 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:28,559 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:28,559 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:18:28,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:28,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:18:28,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:18:28,560 INFO L87 Difference]: Start difference. First operand 265 states and 343 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:28,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:28,663 INFO L93 Difference]: Finished difference Result 427 states and 544 transitions. [2022-04-15 11:18:28,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:18:28,664 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:28,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:18:28,664 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:28,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2022-04-15 11:18:28,664 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:28,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2022-04-15 11:18:28,665 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 54 transitions. [2022-04-15 11:18:28,701 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:28,710 INFO L225 Difference]: With dead ends: 427 [2022-04-15 11:18:28,711 INFO L226 Difference]: Without dead ends: 425 [2022-04-15 11:18:28,711 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:28,712 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 54 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:18:28,712 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 43 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:18:28,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2022-04-15 11:18:28,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 393. [2022-04-15 11:18:28,735 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:18:28,736 INFO L82 GeneralOperation]: Start isEquivalent. First operand 425 states. Second operand has 393 states, 389 states have (on average 1.2647814910025708) internal successors, (492), 389 states have internal predecessors, (492), 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:28,737 INFO L74 IsIncluded]: Start isIncluded. First operand 425 states. Second operand has 393 states, 389 states have (on average 1.2647814910025708) internal successors, (492), 389 states have internal predecessors, (492), 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:28,737 INFO L87 Difference]: Start difference. First operand 425 states. Second operand has 393 states, 389 states have (on average 1.2647814910025708) internal successors, (492), 389 states have internal predecessors, (492), 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:28,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:28,745 INFO L93 Difference]: Finished difference Result 425 states and 527 transitions. [2022-04-15 11:18:28,745 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 527 transitions. [2022-04-15 11:18:28,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:28,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:28,747 INFO L74 IsIncluded]: Start isIncluded. First operand has 393 states, 389 states have (on average 1.2647814910025708) internal successors, (492), 389 states have internal predecessors, (492), 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 425 states. [2022-04-15 11:18:28,747 INFO L87 Difference]: Start difference. First operand has 393 states, 389 states have (on average 1.2647814910025708) internal successors, (492), 389 states have internal predecessors, (492), 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 425 states. [2022-04-15 11:18:28,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:28,755 INFO L93 Difference]: Finished difference Result 425 states and 527 transitions. [2022-04-15 11:18:28,755 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 527 transitions. [2022-04-15 11:18:28,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:28,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:28,756 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:18:28,756 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:18:28,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 389 states have (on average 1.2647814910025708) internal successors, (492), 389 states have internal predecessors, (492), 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:28,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 495 transitions. [2022-04-15 11:18:28,765 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 495 transitions. Word has length 20 [2022-04-15 11:18:28,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:18:28,765 INFO L478 AbstractCegarLoop]: Abstraction has 393 states and 495 transitions. [2022-04-15 11:18:28,765 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:28,765 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 393 states and 495 transitions. [2022-04-15 11:18:29,194 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 495 edges. 495 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:29,194 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 495 transitions. [2022-04-15 11:18:29,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 11:18:29,195 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:18:29,195 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:29,195 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-15 11:18:29,195 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:18:29,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:18:29,196 INFO L85 PathProgramCache]: Analyzing trace with hash 963955465, now seen corresponding path program 1 times [2022-04-15 11:18:29,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:29,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1582273956] [2022-04-15 11:18:29,196 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:18:29,196 INFO L85 PathProgramCache]: Analyzing trace with hash 963955465, now seen corresponding path program 2 times [2022-04-15 11:18:29,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:18:29,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848299937] [2022-04-15 11:18:29,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:18:29,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:18:29,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:29,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:18:29,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:18:29,239 INFO L290 TraceCheckUtils]: 0: Hoare triple {12415#(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); {12409#true} is VALID [2022-04-15 11:18:29,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {12409#true} assume true; {12409#true} is VALID [2022-04-15 11:18:29,239 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12409#true} {12409#true} #115#return; {12409#true} is VALID [2022-04-15 11:18:29,241 INFO L272 TraceCheckUtils]: 0: Hoare triple {12409#true} call ULTIMATE.init(); {12415#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:18:29,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {12415#(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); {12409#true} is VALID [2022-04-15 11:18:29,241 INFO L290 TraceCheckUtils]: 2: Hoare triple {12409#true} assume true; {12409#true} is VALID [2022-04-15 11:18:29,241 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12409#true} {12409#true} #115#return; {12409#true} is VALID [2022-04-15 11:18:29,241 INFO L272 TraceCheckUtils]: 4: Hoare triple {12409#true} call #t~ret10 := main(); {12409#true} is VALID [2022-04-15 11:18:29,241 INFO L290 TraceCheckUtils]: 5: Hoare triple {12409#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;havoc ~cond~0; {12409#true} is VALID [2022-04-15 11:18:29,241 INFO L290 TraceCheckUtils]: 6: Hoare triple {12409#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {12409#true} is VALID [2022-04-15 11:18:29,241 INFO L290 TraceCheckUtils]: 7: Hoare triple {12409#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0; {12409#true} is VALID [2022-04-15 11:18:29,241 INFO L290 TraceCheckUtils]: 8: Hoare triple {12409#true} assume !(0 != ~p1~0); {12409#true} is VALID [2022-04-15 11:18:29,241 INFO L290 TraceCheckUtils]: 9: Hoare triple {12409#true} assume !(0 != ~p2~0); {12409#true} is VALID [2022-04-15 11:18:29,241 INFO L290 TraceCheckUtils]: 10: Hoare triple {12409#true} assume !(0 != ~p3~0); {12409#true} is VALID [2022-04-15 11:18:29,241 INFO L290 TraceCheckUtils]: 11: Hoare triple {12409#true} assume !(0 != ~p4~0); {12409#true} is VALID [2022-04-15 11:18:29,242 INFO L290 TraceCheckUtils]: 12: Hoare triple {12409#true} assume !(0 != ~p5~0); {12414#(= main_~p5~0 0)} is VALID [2022-04-15 11:18:29,242 INFO L290 TraceCheckUtils]: 13: Hoare triple {12414#(= main_~p5~0 0)} assume !(0 != ~p1~0); {12414#(= main_~p5~0 0)} is VALID [2022-04-15 11:18:29,242 INFO L290 TraceCheckUtils]: 14: Hoare triple {12414#(= main_~p5~0 0)} assume !(0 != ~p2~0); {12414#(= main_~p5~0 0)} is VALID [2022-04-15 11:18:29,243 INFO L290 TraceCheckUtils]: 15: Hoare triple {12414#(= main_~p5~0 0)} assume !(0 != ~p3~0); {12414#(= main_~p5~0 0)} is VALID [2022-04-15 11:18:29,243 INFO L290 TraceCheckUtils]: 16: Hoare triple {12414#(= main_~p5~0 0)} assume !(0 != ~p4~0); {12414#(= main_~p5~0 0)} is VALID [2022-04-15 11:18:29,243 INFO L290 TraceCheckUtils]: 17: Hoare triple {12414#(= main_~p5~0 0)} assume 0 != ~p5~0; {12410#false} is VALID [2022-04-15 11:18:29,243 INFO L290 TraceCheckUtils]: 18: Hoare triple {12410#false} assume 1 != ~lk5~0; {12410#false} is VALID [2022-04-15 11:18:29,243 INFO L290 TraceCheckUtils]: 19: Hoare triple {12410#false} assume !false; {12410#false} is VALID [2022-04-15 11:18:29,244 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:29,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:18:29,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848299937] [2022-04-15 11:18:29,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848299937] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:29,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:29,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:29,244 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:18:29,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1582273956] [2022-04-15 11:18:29,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1582273956] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:18:29,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:18:29,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:18:29,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494559107] [2022-04-15 11:18:29,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:18:29,245 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:29,245 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:18:29,245 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:29,254 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:29,255 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:18:29,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:18:29,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:18:29,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:18:29,255 INFO L87 Difference]: Start difference. First operand 393 states and 495 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:29,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:29,370 INFO L93 Difference]: Finished difference Result 857 states and 1055 transitions. [2022-04-15 11:18:29,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:18:29,371 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:29,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:18:29,371 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:29,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2022-04-15 11:18:29,372 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:29,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2022-04-15 11:18:29,372 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 88 transitions. [2022-04-15 11:18:29,421 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:18:29,421 INFO L225 Difference]: With dead ends: 857 [2022-04-15 11:18:29,421 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 11:18:29,422 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:29,423 INFO L913 BasicCegarLoop]: 55 mSDtfsCounter, 46 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:18:29,423 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 62 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 11:18:29,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 11:18:29,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 11:18:29,423 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:18:29,423 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:29,423 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:29,423 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:29,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:29,424 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 11:18:29,424 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 11:18:29,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:29,424 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:29,424 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:29,424 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:29,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:18:29,424 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 11:18:29,424 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 11:18:29,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:29,424 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:18:29,424 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:18:29,424 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:18:29,424 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:29,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 11:18:29,424 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2022-04-15 11:18:29,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:18:29,424 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 11:18:29,424 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:29,425 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-15 11:18:29,425 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:29,425 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 11:18:29,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:18:29,426 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 11:18:29,427 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-15 11:18:29,428 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 11:18:32,478 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-15 11:18:32,478 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-15 11:18:32,478 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-15 11:18:32,478 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-15 11:18:32,478 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:32,478 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-15 11:18:32,479 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-15 11:18:32,479 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 11:18:32,479 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 11:18:32,479 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-15 11:18:32,479 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 6 95) the Hoare annotation is: true [2022-04-15 11:18:32,479 INFO L885 garLoopResultBuilder]: At program point L85-1(lines 26 90) the Hoare annotation is: true [2022-04-15 11:18:32,479 INFO L878 garLoopResultBuilder]: At program point L81(line 81) the Hoare annotation is: (let ((.cse0 (not (= main_~p4~0 0))) (.cse1 (= main_~lk4~0 1))) (or (and .cse0 .cse1 (= main_~p5~0 0)) (and (= main_~lk5~0 1) .cse0 .cse1))) [2022-04-15 11:18:32,479 INFO L878 garLoopResultBuilder]: At program point L65-1(lines 26 90) the Hoare annotation is: (let ((.cse4 (= main_~p4~0 0)) (.cse0 (= main_~lk5~0 1)) (.cse6 (= main_~p3~0 0)) (.cse5 (= main_~lk2~0 1)) (.cse1 (= main_~lk4~0 1)) (.cse2 (= main_~lk3~0 1)) (.cse7 (= main_~p5~0 0)) (.cse3 (= main_~p2~0 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse2 .cse3) (and .cse4 .cse0 .cse2 .cse5) (and .cse0 .cse1 .cse3 .cse6) (and .cse4 .cse7 .cse3 .cse6) (and .cse4 .cse2 .cse7 .cse3) (and .cse1 .cse2 .cse7 .cse5) (and .cse4 .cse2 .cse7 .cse5) (and .cse4 .cse7 .cse6 .cse5) (and .cse1 .cse7 .cse3 .cse6) (and .cse0 .cse1 .cse6 .cse5) (and .cse0 .cse1 .cse2 .cse5) (and .cse1 .cse7 .cse6 .cse5) (and .cse4 .cse0 .cse3 .cse6) (and .cse4 .cse0 .cse6 .cse5) (and .cse1 .cse2 .cse7 .cse3))) [2022-04-15 11:18:32,479 INFO L885 garLoopResultBuilder]: At program point L28(lines 28 30) the Hoare annotation is: true [2022-04-15 11:18:32,479 INFO L878 garLoopResultBuilder]: At program point L86(line 86) the Hoare annotation is: (= main_~lk5~0 1) [2022-04-15 11:18:32,480 INFO L878 garLoopResultBuilder]: At program point L86-1(lines 7 95) the Hoare annotation is: false [2022-04-15 11:18:32,480 INFO L878 garLoopResultBuilder]: At program point L70-1(lines 26 90) the Hoare annotation is: (let ((.cse5 (= main_~p3~0 0)) (.cse3 (= main_~p4~0 0)) (.cse2 (= main_~p5~0 0)) (.cse4 (= main_~lk5~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse1 (= main_~lk3~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5) (and .cse4 .cse0 .cse5) (and .cse3 .cse2 .cse5) (and .cse0 .cse2 .cse5) (and .cse3 .cse4 .cse1) (and .cse3 .cse1 .cse2) (and .cse4 .cse0 .cse1))) [2022-04-15 11:18:32,480 INFO L878 garLoopResultBuilder]: At program point L66(line 66) the Hoare annotation is: (let ((.cse6 (= main_~p4~0 0)) (.cse7 (= main_~lk5~0 1)) (.cse4 (= main_~p2~0 0)) (.cse5 (= main_~p3~0 0)) (.cse0 (not (= main_~p1~0 0))) (.cse1 (= main_~lk1~0 1)) (.cse2 (= main_~lk4~0 1)) (.cse9 (= main_~lk3~0 1)) (.cse3 (= main_~p5~0 0)) (.cse8 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse0 .cse1 .cse5 .cse8) (and .cse6 .cse0 .cse1 .cse9 .cse3 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse8) (and .cse7 .cse0 .cse1 .cse2 .cse4 .cse5) (and .cse6 .cse7 .cse0 .cse1 .cse9 .cse8) (and .cse6 .cse7 .cse0 .cse1 .cse9 .cse4) (and .cse6 .cse0 .cse1 .cse3 .cse4 .cse5) (and .cse6 .cse0 .cse1 .cse9 .cse3 .cse4) (and .cse7 .cse0 .cse1 .cse2 .cse9 .cse8) (and .cse7 .cse0 .cse1 .cse2 .cse5 .cse8) (and .cse0 .cse1 .cse2 .cse9 .cse3 .cse4) (and .cse7 .cse0 .cse1 .cse2 .cse9 .cse4) (and .cse6 .cse0 .cse1 .cse3 .cse5 .cse8) (and .cse6 .cse7 .cse0 .cse1 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse9 .cse3 .cse8))) [2022-04-15 11:18:32,480 INFO L885 garLoopResultBuilder]: At program point L91(lines 7 95) the Hoare annotation is: true [2022-04-15 11:18:32,480 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 6 95) the Hoare annotation is: true [2022-04-15 11:18:32,480 INFO L878 garLoopResultBuilder]: At program point L75-1(lines 26 90) the Hoare annotation is: (let ((.cse1 (= main_~p5~0 0)) (.cse2 (= main_~lk4~0 1)) (.cse0 (= main_~p4~0 0)) (.cse3 (= main_~lk5~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and .cse3 .cse2) (and .cse0 .cse3))) [2022-04-15 11:18:32,480 INFO L878 garLoopResultBuilder]: At program point L71(line 71) the Hoare annotation is: (let ((.cse2 (= main_~lk3~0 1)) (.cse4 (= main_~lk4~0 1)) (.cse5 (= main_~p5~0 0)) (.cse0 (= main_~p4~0 0)) (.cse1 (= main_~lk5~0 1)) (.cse6 (= main_~p3~0 0)) (.cse3 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2 .cse5 .cse3) (and .cse0 .cse2 .cse5 .cse3) (and .cse0 .cse5 .cse6 .cse3) (and .cse1 .cse4 .cse6 .cse3) (and .cse1 .cse4 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse3) (and .cse0 .cse1 .cse6 .cse3))) [2022-04-15 11:18:32,480 INFO L878 garLoopResultBuilder]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 93) the Hoare annotation is: false [2022-04-15 11:18:32,481 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 6 95) the Hoare annotation is: true [2022-04-15 11:18:32,481 INFO L878 garLoopResultBuilder]: At program point L59-1(lines 26 90) 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:32,481 INFO L878 garLoopResultBuilder]: At program point L55-1(lines 26 90) 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:32,481 INFO L878 garLoopResultBuilder]: At program point L51-1(lines 26 90) 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:32,481 INFO L878 garLoopResultBuilder]: At program point L80-1(lines 26 90) the Hoare annotation is: (or (= main_~lk5~0 1) (= main_~p5~0 0)) [2022-04-15 11:18:32,481 INFO L878 garLoopResultBuilder]: At program point L47-1(lines 26 90) 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:32,481 INFO L878 garLoopResultBuilder]: At program point L76(line 76) the Hoare annotation is: (let ((.cse1 (= main_~p4~0 0)) (.cse2 (= main_~lk5~0 1)) (.cse0 (not (= main_~p3~0 0))) (.cse5 (= main_~lk4~0 1)) (.cse3 (= main_~lk3~0 1)) (.cse4 (= main_~p5~0 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse3 .cse4) (and .cse0 .cse2 .cse5 .cse3) (and .cse0 .cse5 .cse3 .cse4))) [2022-04-15 11:18:32,482 INFO L885 garLoopResultBuilder]: At program point L43(lines 43 45) the Hoare annotation is: true [2022-04-15 11:18:32,482 INFO L878 garLoopResultBuilder]: At program point L43-2(lines 26 90) the Hoare annotation is: (or (= main_~lk1~0 1) (= main_~p1~0 0)) [2022-04-15 11:18:32,484 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] [2022-04-15 11:18:32,485 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 11:18:32,488 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 11:18:32,502 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-15 11:18:32,527 INFO L163 areAnnotationChecker]: CFG has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 11:18:32,533 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 11:18:32 BoogieIcfgContainer [2022-04-15 11:18:32,533 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 11:18:32,534 INFO L158 Benchmark]: Toolchain (without parser) took 9604.51ms. Allocated memory was 191.9MB in the beginning and 332.4MB in the end (delta: 140.5MB). Free memory was 142.5MB in the beginning and 276.8MB in the end (delta: -134.3MB). Peak memory consumption was 134.0MB. Max. memory is 8.0GB. [2022-04-15 11:18:32,534 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 191.9MB. Free memory was 159.2MB in the beginning and 159.1MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 11:18:32,534 INFO L158 Benchmark]: CACSL2BoogieTranslator took 171.21ms. Allocated memory is still 191.9MB. Free memory was 142.3MB in the beginning and 167.1MB in the end (delta: -24.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 11:18:32,535 INFO L158 Benchmark]: Boogie Preprocessor took 33.59ms. Allocated memory is still 191.9MB. Free memory was 167.1MB in the beginning and 165.6MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 11:18:32,535 INFO L158 Benchmark]: RCFGBuilder took 261.93ms. Allocated memory is still 191.9MB. Free memory was 165.6MB in the beginning and 153.8MB in the end (delta: 11.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 11:18:32,535 INFO L158 Benchmark]: TraceAbstraction took 9133.19ms. Allocated memory was 191.9MB in the beginning and 332.4MB in the end (delta: 140.5MB). Free memory was 153.4MB in the beginning and 276.8MB in the end (delta: -123.4MB). Peak memory consumption was 146.0MB. Max. memory is 8.0GB. [2022-04-15 11:18:32,536 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 191.9MB. Free memory was 159.2MB in the beginning and 159.1MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 171.21ms. Allocated memory is still 191.9MB. Free memory was 142.3MB in the beginning and 167.1MB in the end (delta: -24.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.59ms. Allocated memory is still 191.9MB. Free memory was 167.1MB in the beginning and 165.6MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 261.93ms. Allocated memory is still 191.9MB. Free memory was 165.6MB in the beginning and 153.8MB in the end (delta: 11.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 9133.19ms. Allocated memory was 191.9MB in the beginning and 332.4MB in the end (delta: 140.5MB). Free memory was 153.4MB in the beginning and 276.8MB in the end (delta: -123.4MB). Peak memory consumption was 146.0MB. 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: 93]: 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, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.0s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 831 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 831 mSDsluCounter, 721 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 93 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 429 IncrementalHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 628 mSDtfsCounter, 429 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 91 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=393occurred in iteration=12, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 136 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 30 LocationsWithAnnotation, 30 PreInvPairs, 519 NumberOfFragments, 1696 HoareAnnotationTreeSize, 30 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.9s HoareSimplificationTime, 30 FomulaSimplificationsInter, 9655 FormulaSimplificationTreeSizeReductionInter, 2.2s 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: 26]: 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:32,577 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...