/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/array-crafted/mapsum5.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 00:13:40,422 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 00:13:40,486 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-16 00:13:40,489 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 00:13:40,490 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 00:13:40,507 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 00:13:40,508 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 00:13:40,508 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 00:13:40,509 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 00:13:40,509 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 00:13:40,509 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 00:13:40,510 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 00:13:40,510 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 00:13:40,511 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 00:13:40,511 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 00:13:40,511 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 00:13:40,512 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 00:13:40,512 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 00:13:40,512 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 00:13:40,512 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 00:13:40,513 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 00:13:40,513 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 00:13:40,513 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 00:13:40,514 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 00:13:40,514 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 00:13:40,514 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 00:13:40,514 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 00:13:40,515 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 00:13:40,515 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 00:13:40,515 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 00:13:40,515 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 00:13:40,516 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 00:13:40,516 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 00:13:40,516 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 00:13:40,516 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 00:13:40,517 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 00:13:40,517 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 00:13:40,517 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 00:13:40,517 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 00:13:40,518 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 00:13:40,518 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 00:13:40,518 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 00:13:40,519 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 00:13:40,519 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-16 00:13:40,693 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 00:13:40,717 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 00:13:40,720 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 00:13:40,721 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 00:13:40,722 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 00:13:40,723 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-crafted/mapsum5.i [2023-12-16 00:13:41,943 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 00:13:42,134 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 00:13:42,135 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-crafted/mapsum5.i [2023-12-16 00:13:42,140 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f9c234a4/4d35039e1ac34cd5bccbf0fc897a18cf/FLAG54c5020cd [2023-12-16 00:13:42,151 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f9c234a4/4d35039e1ac34cd5bccbf0fc897a18cf [2023-12-16 00:13:42,153 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 00:13:42,154 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 00:13:42,155 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 00:13:42,155 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 00:13:42,159 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 00:13:42,159 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 12:13:42" (1/1) ... [2023-12-16 00:13:42,160 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@716b66a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:13:42, skipping insertion in model container [2023-12-16 00:13:42,160 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 12:13:42" (1/1) ... [2023-12-16 00:13:42,179 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 00:13:42,312 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-crafted/mapsum5.i[1380,1393] [2023-12-16 00:13:42,315 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 00:13:42,322 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 00:13:42,338 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-crafted/mapsum5.i[1380,1393] [2023-12-16 00:13:42,339 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 00:13:42,352 INFO L206 MainTranslator]: Completed translation [2023-12-16 00:13:42,352 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:13:42 WrapperNode [2023-12-16 00:13:42,353 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 00:13:42,354 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 00:13:42,356 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 00:13:42,356 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 00:13:42,362 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:13:42" (1/1) ... [2023-12-16 00:13:42,368 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:13:42" (1/1) ... [2023-12-16 00:13:42,383 INFO L138 Inliner]: procedures = 16, calls = 21, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 74 [2023-12-16 00:13:42,383 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 00:13:42,384 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 00:13:42,384 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 00:13:42,384 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 00:13:42,393 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:13:42" (1/1) ... [2023-12-16 00:13:42,393 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:13:42" (1/1) ... [2023-12-16 00:13:42,395 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:13:42" (1/1) ... [2023-12-16 00:13:42,412 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2023-12-16 00:13:42,412 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:13:42" (1/1) ... [2023-12-16 00:13:42,413 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:13:42" (1/1) ... [2023-12-16 00:13:42,424 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:13:42" (1/1) ... [2023-12-16 00:13:42,427 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:13:42" (1/1) ... [2023-12-16 00:13:42,428 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:13:42" (1/1) ... [2023-12-16 00:13:42,429 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:13:42" (1/1) ... [2023-12-16 00:13:42,431 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 00:13:42,432 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 00:13:42,432 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 00:13:42,432 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 00:13:42,436 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:13:42" (1/1) ... [2023-12-16 00:13:42,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 00:13:42,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 00:13:42,460 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-16 00:13:42,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-16 00:13:42,486 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 00:13:42,487 INFO L130 BoogieDeclarations]: Found specification of procedure mapsum [2023-12-16 00:13:42,487 INFO L138 BoogieDeclarations]: Found implementation of procedure mapsum [2023-12-16 00:13:42,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 00:13:42,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-16 00:13:42,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-16 00:13:42,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-16 00:13:42,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-16 00:13:42,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 00:13:42,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 00:13:42,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-16 00:13:42,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-16 00:13:42,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-16 00:13:42,544 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 00:13:42,545 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 00:13:42,667 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 00:13:42,699 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 00:13:42,699 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-12-16 00:13:42,700 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 12:13:42 BoogieIcfgContainer [2023-12-16 00:13:42,700 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 00:13:42,705 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 00:13:42,705 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 00:13:42,708 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 00:13:42,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 12:13:42" (1/3) ... [2023-12-16 00:13:42,709 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45bed723 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 12:13:42, skipping insertion in model container [2023-12-16 00:13:42,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:13:42" (2/3) ... [2023-12-16 00:13:42,709 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45bed723 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 12:13:42, skipping insertion in model container [2023-12-16 00:13:42,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 12:13:42" (3/3) ... [2023-12-16 00:13:42,710 INFO L112 eAbstractionObserver]: Analyzing ICFG mapsum5.i [2023-12-16 00:13:42,728 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 00:13:42,728 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 00:13:42,766 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 00:13:42,771 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6ecf5ea3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 00:13:42,771 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 00:13:42,775 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 00:13:42,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-16 00:13:42,781 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 00:13:42,781 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 00:13:42,782 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 00:13:42,785 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 00:13:42,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1255451845, now seen corresponding path program 1 times [2023-12-16 00:13:42,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 00:13:42,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692931144] [2023-12-16 00:13:42,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:13:42,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 00:13:42,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:13:42,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-16 00:13:42,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:13:42,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-16 00:13:43,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:13:43,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 00:13:43,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:13:43,020 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 00:13:43,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 00:13:43,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692931144] [2023-12-16 00:13:43,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692931144] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 00:13:43,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 00:13:43,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 00:13:43,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164203311] [2023-12-16 00:13:43,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 00:13:43,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 00:13:43,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 00:13:43,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 00:13:43,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 00:13:43,069 INFO L87 Difference]: Start difference. First operand has 22 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 00:13:43,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 00:13:43,130 INFO L93 Difference]: Finished difference Result 41 states and 59 transitions. [2023-12-16 00:13:43,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 00:13:43,133 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2023-12-16 00:13:43,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 00:13:43,137 INFO L225 Difference]: With dead ends: 41 [2023-12-16 00:13:43,137 INFO L226 Difference]: Without dead ends: 19 [2023-12-16 00:13:43,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 00:13:43,142 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 00:13:43,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 00:13:43,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-12-16 00:13:43,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2023-12-16 00:13:43,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 00:13:43,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2023-12-16 00:13:43,170 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 26 [2023-12-16 00:13:43,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 00:13:43,171 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2023-12-16 00:13:43,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 00:13:43,171 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2023-12-16 00:13:43,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-16 00:13:43,172 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 00:13:43,172 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 00:13:43,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 00:13:43,173 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 00:13:43,173 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 00:13:43,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1458393903, now seen corresponding path program 1 times [2023-12-16 00:13:43,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 00:13:43,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950873142] [2023-12-16 00:13:43,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:13:43,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 00:13:43,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:13:43,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-16 00:13:43,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:13:43,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-16 00:13:43,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:13:43,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 00:13:43,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:13:43,390 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 00:13:43,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 00:13:43,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950873142] [2023-12-16 00:13:43,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950873142] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 00:13:43,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 00:13:43,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 00:13:43,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297835511] [2023-12-16 00:13:43,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 00:13:43,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 00:13:43,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 00:13:43,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 00:13:43,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 00:13:43,394 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 00:13:43,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 00:13:43,415 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2023-12-16 00:13:43,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 00:13:43,418 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2023-12-16 00:13:43,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 00:13:43,419 INFO L225 Difference]: With dead ends: 36 [2023-12-16 00:13:43,419 INFO L226 Difference]: Without dead ends: 20 [2023-12-16 00:13:43,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 00:13:43,420 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 00:13:43,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 00:13:43,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-12-16 00:13:43,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2023-12-16 00:13:43,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 00:13:43,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2023-12-16 00:13:43,426 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 26 [2023-12-16 00:13:43,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 00:13:43,426 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2023-12-16 00:13:43,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 00:13:43,426 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2023-12-16 00:13:43,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-16 00:13:43,427 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 00:13:43,427 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 00:13:43,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 00:13:43,427 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 00:13:43,428 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 00:13:43,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1192443674, now seen corresponding path program 1 times [2023-12-16 00:13:43,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 00:13:43,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522876619] [2023-12-16 00:13:43,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:13:43,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 00:13:43,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:13:43,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-16 00:13:43,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:13:43,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-16 00:13:43,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:13:43,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-16 00:13:43,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:13:43,603 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-16 00:13:43,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 00:13:43,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522876619] [2023-12-16 00:13:43,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522876619] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 00:13:43,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [985293967] [2023-12-16 00:13:43,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:13:43,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 00:13:43,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 00:13:43,607 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 00:13:43,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-16 00:13:43,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:13:43,715 INFO L262 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 00:13:43,720 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 00:13:43,797 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 00:13:43,797 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 00:13:43,851 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 00:13:43,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [985293967] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 00:13:43,852 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 00:13:43,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2023-12-16 00:13:43,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016712892] [2023-12-16 00:13:43,853 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 00:13:43,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-16 00:13:43,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 00:13:43,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-16 00:13:43,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-12-16 00:13:43,859 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-16 00:13:43,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 00:13:43,956 INFO L93 Difference]: Finished difference Result 38 states and 50 transitions. [2023-12-16 00:13:43,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 00:13:43,957 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 27 [2023-12-16 00:13:43,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 00:13:43,958 INFO L225 Difference]: With dead ends: 38 [2023-12-16 00:13:43,958 INFO L226 Difference]: Without dead ends: 22 [2023-12-16 00:13:43,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-12-16 00:13:43,963 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 19 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 00:13:43,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 46 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 00:13:43,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-12-16 00:13:43,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-12-16 00:13:43,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 00:13:43,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2023-12-16 00:13:43,974 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 27 [2023-12-16 00:13:43,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 00:13:43,974 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2023-12-16 00:13:43,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-16 00:13:43,974 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2023-12-16 00:13:43,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-16 00:13:43,975 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 00:13:43,975 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 00:13:43,984 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-16 00:13:44,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 00:13:44,181 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 00:13:44,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 00:13:44,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1036689560, now seen corresponding path program 1 times [2023-12-16 00:13:44,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 00:13:44,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391776662] [2023-12-16 00:13:44,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:13:44,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 00:13:44,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:13:44,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-16 00:13:44,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:13:44,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 00:13:44,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:13:44,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-12-16 00:13:44,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:13:44,311 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-16 00:13:44,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 00:13:44,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391776662] [2023-12-16 00:13:44,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391776662] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 00:13:44,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 00:13:44,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 00:13:44,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15690984] [2023-12-16 00:13:44,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 00:13:44,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 00:13:44,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 00:13:44,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 00:13:44,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-16 00:13:44,321 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-16 00:13:44,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 00:13:44,359 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2023-12-16 00:13:44,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 00:13:44,360 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2023-12-16 00:13:44,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 00:13:44,361 INFO L225 Difference]: With dead ends: 34 [2023-12-16 00:13:44,361 INFO L226 Difference]: Without dead ends: 23 [2023-12-16 00:13:44,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-16 00:13:44,367 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 15 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 00:13:44,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 20 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 00:13:44,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-12-16 00:13:44,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-12-16 00:13:44,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 00:13:44,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2023-12-16 00:13:44,376 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 31 [2023-12-16 00:13:44,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 00:13:44,378 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2023-12-16 00:13:44,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-16 00:13:44,378 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2023-12-16 00:13:44,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-16 00:13:44,379 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 00:13:44,380 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 00:13:44,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-16 00:13:44,380 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 00:13:44,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 00:13:44,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1634663200, now seen corresponding path program 1 times [2023-12-16 00:13:44,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 00:13:44,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887197284] [2023-12-16 00:13:44,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:13:44,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 00:13:44,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:13:44,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-16 00:13:44,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:13:44,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 00:13:44,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:13:44,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-16 00:13:44,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:13:44,494 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-16 00:13:44,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 00:13:44,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887197284] [2023-12-16 00:13:44,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887197284] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 00:13:44,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298772024] [2023-12-16 00:13:44,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:13:44,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 00:13:44,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 00:13:44,496 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 00:13:44,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-16 00:13:44,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:13:44,579 INFO L262 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 00:13:44,582 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 00:13:44,635 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-16 00:13:44,635 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 00:13:44,718 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-16 00:13:44,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1298772024] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 00:13:44,721 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 00:13:44,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 10 [2023-12-16 00:13:44,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410224243] [2023-12-16 00:13:44,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 00:13:44,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-16 00:13:44,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 00:13:44,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-16 00:13:44,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-12-16 00:13:44,727 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 00:13:44,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 00:13:44,772 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2023-12-16 00:13:44,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 00:13:44,772 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 32 [2023-12-16 00:13:44,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 00:13:44,773 INFO L225 Difference]: With dead ends: 40 [2023-12-16 00:13:44,773 INFO L226 Difference]: Without dead ends: 24 [2023-12-16 00:13:44,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-12-16 00:13:44,774 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 17 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 00:13:44,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 40 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 00:13:44,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-12-16 00:13:44,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-12-16 00:13:44,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 00:13:44,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2023-12-16 00:13:44,778 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 32 [2023-12-16 00:13:44,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 00:13:44,778 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2023-12-16 00:13:44,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 00:13:44,779 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2023-12-16 00:13:44,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-16 00:13:44,779 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 00:13:44,779 INFO L195 NwaCegarLoop]: trace histogram [6, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 00:13:44,790 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-16 00:13:44,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 00:13:44,988 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 00:13:44,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 00:13:44,989 INFO L85 PathProgramCache]: Analyzing trace with hash 2138745633, now seen corresponding path program 2 times [2023-12-16 00:13:44,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 00:13:44,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169798914] [2023-12-16 00:13:44,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:13:44,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 00:13:45,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:13:48,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-16 00:13:48,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:13:49,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 00:13:49,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:13:49,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-16 00:13:49,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2023-12-16 00:14:56,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-16 00:14:56,757 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Termination requested (timeout or resource limit) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$IntegerInterpolator.interpolate(Interpolator.java:1451) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$MixedLAInterpolator.convert(Interpolator.java:1314) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:158) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:86) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:319) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.mixedPivotLA(Interpolator.java:1496) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.combine(Interpolator.java:450) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$CombineInterpolants.walk(Interpolator.java:175) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:260) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:237) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:869) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:793) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:352) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.getInterpolants(ManagedScript.java:201) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:283) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:164) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:327) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:229) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:97) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:379) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:229) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-16 00:14:56,760 INFO L158 Benchmark]: Toolchain (without parser) took 74606.36ms. Allocated memory was 198.2MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 152.8MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 845.0MB. Max. memory is 8.0GB. [2023-12-16 00:14:56,760 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 198.2MB. Free memory is still 155.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 00:14:56,761 INFO L158 Benchmark]: CACSL2BoogieTranslator took 198.20ms. Allocated memory is still 198.2MB. Free memory was 152.4MB in the beginning and 141.2MB in the end (delta: 11.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-16 00:14:56,761 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.88ms. Allocated memory is still 198.2MB. Free memory was 141.2MB in the beginning and 139.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-16 00:14:56,761 INFO L158 Benchmark]: Boogie Preprocessor took 47.03ms. Allocated memory is still 198.2MB. Free memory was 139.8MB in the beginning and 137.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 00:14:56,761 INFO L158 Benchmark]: RCFGBuilder took 268.30ms. Allocated memory is still 198.2MB. Free memory was 137.7MB in the beginning and 124.1MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-16 00:14:56,762 INFO L158 Benchmark]: TraceAbstraction took 74054.50ms. Allocated memory was 198.2MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 123.4MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 815.6MB. Max. memory is 8.0GB. [2023-12-16 00:14:56,763 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 198.2MB. Free memory is still 155.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 198.20ms. Allocated memory is still 198.2MB. Free memory was 152.4MB in the beginning and 141.2MB in the end (delta: 11.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.88ms. Allocated memory is still 198.2MB. Free memory was 141.2MB in the beginning and 139.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 47.03ms. Allocated memory is still 198.2MB. Free memory was 139.8MB in the beginning and 137.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 268.30ms. Allocated memory is still 198.2MB. Free memory was 137.7MB in the beginning and 124.1MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 74054.50ms. Allocated memory was 198.2MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 123.4MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 815.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Termination requested (timeout or resource limit) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Termination requested (timeout or resource limit): de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$IntegerInterpolator.interpolate(Interpolator.java:1451) RESULT: Ultimate could not prove your program: Toolchain returned no result. Completed graceful shutdown