/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 true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-11.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 20:13:26,918 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 20:13:27,001 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-15 20:13:27,005 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 20:13:27,006 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 20:13:27,038 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 20:13:27,039 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 20:13:27,039 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 20:13:27,040 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 20:13:27,043 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 20:13:27,044 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 20:13:27,044 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 20:13:27,044 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 20:13:27,046 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 20:13:27,046 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 20:13:27,046 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 20:13:27,046 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 20:13:27,047 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 20:13:27,047 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 20:13:27,047 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 20:13:27,048 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 20:13:27,049 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 20:13:27,049 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 20:13:27,049 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 20:13:27,049 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 20:13:27,050 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 20:13:27,050 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 20:13:27,050 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 20:13:27,051 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 20:13:27,051 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 20:13:27,052 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 20:13:27,052 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 20:13:27,052 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 20:13:27,052 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 20:13:27,052 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 20:13:27,053 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 20:13:27,053 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 20:13:27,053 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 20:13:27,053 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 20:13:27,053 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 20:13:27,054 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 20:13:27,054 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 20:13:27,054 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 20:13:27,054 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 -> true [2023-12-15 20:13:27,298 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 20:13:27,328 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 20:13:27,331 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 20:13:27,332 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 20:13:27,332 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 20:13:27,333 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-11.i [2023-12-15 20:13:28,601 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 20:13:28,866 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 20:13:28,866 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-11.i [2023-12-15 20:13:28,878 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63d8d8bbd/23a501624e33421bb76860c7c3b3210e/FLAG50918c230 [2023-12-15 20:13:28,894 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63d8d8bbd/23a501624e33421bb76860c7c3b3210e [2023-12-15 20:13:28,896 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 20:13:28,898 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 20:13:28,900 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 20:13:28,901 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 20:13:28,905 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 20:13:28,905 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 08:13:28" (1/1) ... [2023-12-15 20:13:28,906 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3605e1b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:13:28, skipping insertion in model container [2023-12-15 20:13:28,906 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 08:13:28" (1/1) ... [2023-12-15 20:13:28,946 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 20:13:29,116 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-11.i[919,932] [2023-12-15 20:13:29,198 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 20:13:29,208 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 20:13:29,219 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-11.i[919,932] [2023-12-15 20:13:29,246 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 20:13:29,261 INFO L206 MainTranslator]: Completed translation [2023-12-15 20:13:29,262 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:13:29 WrapperNode [2023-12-15 20:13:29,262 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 20:13:29,263 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 20:13:29,263 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 20:13:29,263 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 20:13:29,269 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:13:29" (1/1) ... [2023-12-15 20:13:29,285 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:13:29" (1/1) ... [2023-12-15 20:13:29,319 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 216 [2023-12-15 20:13:29,320 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 20:13:29,320 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 20:13:29,321 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 20:13:29,321 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 20:13:29,330 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:13:29" (1/1) ... [2023-12-15 20:13:29,331 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:13:29" (1/1) ... [2023-12-15 20:13:29,333 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:13:29" (1/1) ... [2023-12-15 20:13:29,348 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-15 20:13:29,348 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:13:29" (1/1) ... [2023-12-15 20:13:29,348 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:13:29" (1/1) ... [2023-12-15 20:13:29,356 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:13:29" (1/1) ... [2023-12-15 20:13:29,360 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:13:29" (1/1) ... [2023-12-15 20:13:29,362 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:13:29" (1/1) ... [2023-12-15 20:13:29,364 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:13:29" (1/1) ... [2023-12-15 20:13:29,368 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 20:13:29,368 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 20:13:29,369 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 20:13:29,369 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 20:13:29,370 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:13:29" (1/1) ... [2023-12-15 20:13:29,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 20:13:29,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 20:13:29,422 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-15 20:13:29,453 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-15 20:13:29,460 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 20:13:29,460 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-15 20:13:29,461 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-15 20:13:29,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 20:13:29,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 20:13:29,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 20:13:29,562 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 20:13:29,564 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 20:13:29,878 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 20:13:29,976 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 20:13:29,977 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-15 20:13:29,977 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 08:13:29 BoogieIcfgContainer [2023-12-15 20:13:29,977 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 20:13:29,979 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 20:13:29,979 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 20:13:29,982 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 20:13:29,982 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 08:13:28" (1/3) ... [2023-12-15 20:13:29,982 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38fb1cfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 08:13:29, skipping insertion in model container [2023-12-15 20:13:29,983 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:13:29" (2/3) ... [2023-12-15 20:13:29,983 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38fb1cfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 08:13:29, skipping insertion in model container [2023-12-15 20:13:29,983 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 08:13:29" (3/3) ... [2023-12-15 20:13:29,999 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-11.i [2023-12-15 20:13:30,015 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 20:13:30,015 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 20:13:30,052 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 20:13:30,057 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;@2a2afd32, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 20:13:30,058 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 20:13:30,065 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 55 states have (on average 1.5636363636363637) internal successors, (86), 56 states have internal predecessors, (86), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-12-15 20:13:30,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2023-12-15 20:13:30,080 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:13:30,082 INFO L195 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:13:30,082 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:13:30,088 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:13:30,088 INFO L85 PathProgramCache]: Analyzing trace with hash -789277552, now seen corresponding path program 1 times [2023-12-15 20:13:30,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:13:30,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400440725] [2023-12-15 20:13:30,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:13:30,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:13:30,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:30,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:13:30,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:30,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:13:30,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:30,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:13:30,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:30,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:13:30,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:30,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:13:30,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:30,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:13:30,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:30,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:13:30,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:30,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:13:30,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:30,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:13:30,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:30,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:13:30,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:30,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:13:30,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:30,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:13:30,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:30,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 20:13:30,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:30,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 20:13:30,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:30,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 20:13:30,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:30,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 20:13:30,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:30,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-15 20:13:30,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:30,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-15 20:13:30,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:30,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-15 20:13:30,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:30,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-15 20:13:30,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:30,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-12-15 20:13:30,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:30,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-15 20:13:30,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:30,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-12-15 20:13:30,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:30,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-12-15 20:13:30,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:30,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-12-15 20:13:30,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:30,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-12-15 20:13:30,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:30,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-12-15 20:13:30,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:30,586 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2023-12-15 20:13:30,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:13:30,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400440725] [2023-12-15 20:13:30,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400440725] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:13:30,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:13:30,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 20:13:30,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249650546] [2023-12-15 20:13:30,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:13:30,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-15 20:13:30,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:13:30,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-15 20:13:30,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 20:13:30,630 INFO L87 Difference]: Start difference. First operand has 85 states, 55 states have (on average 1.5636363636363637) internal successors, (86), 56 states have internal predecessors, (86), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2023-12-15 20:13:30,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:13:30,691 INFO L93 Difference]: Finished difference Result 167 states and 305 transitions. [2023-12-15 20:13:30,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-15 20:13:30,694 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) Word has length 170 [2023-12-15 20:13:30,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:13:30,702 INFO L225 Difference]: With dead ends: 167 [2023-12-15 20:13:30,702 INFO L226 Difference]: Without dead ends: 83 [2023-12-15 20:13:30,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 83 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-15 20:13:30,710 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 20:13:30,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 131 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 20:13:30,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-12-15 20:13:30,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2023-12-15 20:13:30,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 54 states have (on average 1.4814814814814814) internal successors, (80), 54 states have internal predecessors, (80), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-12-15 20:13:30,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 134 transitions. [2023-12-15 20:13:30,760 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 134 transitions. Word has length 170 [2023-12-15 20:13:30,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:13:30,761 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 134 transitions. [2023-12-15 20:13:30,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2023-12-15 20:13:30,762 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 134 transitions. [2023-12-15 20:13:30,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2023-12-15 20:13:30,770 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:13:30,770 INFO L195 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:13:30,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 20:13:30,771 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:13:30,772 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:13:30,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1705986760, now seen corresponding path program 1 times [2023-12-15 20:13:30,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:13:30,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919979437] [2023-12-15 20:13:30,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:13:30,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:13:30,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:30,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:13:30,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:31,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:13:31,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:31,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:13:31,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:31,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:13:31,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:31,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:13:31,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:31,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:13:31,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:31,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:13:31,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:31,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:13:31,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:31,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:13:31,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:31,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:13:31,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:31,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:13:31,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:31,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:13:31,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:31,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 20:13:31,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:31,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 20:13:31,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:31,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 20:13:31,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:31,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 20:13:31,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:31,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-15 20:13:31,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:31,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-15 20:13:31,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:31,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-15 20:13:31,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:31,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-15 20:13:31,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:31,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-12-15 20:13:31,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:31,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-15 20:13:31,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:31,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-12-15 20:13:31,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:31,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-12-15 20:13:31,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:31,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-12-15 20:13:31,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:31,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-12-15 20:13:31,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:31,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-12-15 20:13:31,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:31,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2023-12-15 20:13:31,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:13:31,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919979437] [2023-12-15 20:13:31,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919979437] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:13:31,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:13:31,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 20:13:31,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38315865] [2023-12-15 20:13:31,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:13:31,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 20:13:31,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:13:31,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 20:13:31,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 20:13:31,138 INFO L87 Difference]: Start difference. First operand 83 states and 134 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2023-12-15 20:13:31,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:13:31,265 INFO L93 Difference]: Finished difference Result 244 states and 394 transitions. [2023-12-15 20:13:31,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 20:13:31,266 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 170 [2023-12-15 20:13:31,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:13:31,273 INFO L225 Difference]: With dead ends: 244 [2023-12-15 20:13:31,273 INFO L226 Difference]: Without dead ends: 162 [2023-12-15 20:13:31,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 56 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-15 20:13:31,275 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 116 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 20:13:31,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 331 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 20:13:31,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2023-12-15 20:13:31,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 97. [2023-12-15 20:13:31,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 68 states have (on average 1.5147058823529411) internal successors, (103), 68 states have internal predecessors, (103), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-12-15 20:13:31,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 157 transitions. [2023-12-15 20:13:31,295 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 157 transitions. Word has length 170 [2023-12-15 20:13:31,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:13:31,297 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 157 transitions. [2023-12-15 20:13:31,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2023-12-15 20:13:31,298 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 157 transitions. [2023-12-15 20:13:31,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2023-12-15 20:13:31,299 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:13:31,300 INFO L195 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:13:31,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 20:13:31,300 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:13:31,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:13:31,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1763245062, now seen corresponding path program 1 times [2023-12-15 20:13:31,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:13:31,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901042460] [2023-12-15 20:13:31,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:13:31,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:13:31,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:32,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:13:32,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:32,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:13:32,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:32,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:13:32,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:32,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:13:32,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:32,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:13:32,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:32,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:13:32,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:32,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:13:32,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:32,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:13:32,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:32,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:13:32,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:32,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:13:32,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:32,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:13:32,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:32,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:13:32,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:32,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 20:13:32,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:32,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 20:13:32,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:32,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 20:13:32,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:32,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 20:13:32,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:32,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-15 20:13:32,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:32,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-15 20:13:32,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:32,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-15 20:13:32,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:32,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-15 20:13:32,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:32,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-12-15 20:13:32,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:32,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-15 20:13:32,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:32,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-12-15 20:13:32,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:32,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-12-15 20:13:32,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:32,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-12-15 20:13:32,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:32,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-12-15 20:13:32,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:32,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-12-15 20:13:32,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:32,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2023-12-15 20:13:32,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:13:32,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901042460] [2023-12-15 20:13:32,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901042460] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:13:32,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:13:32,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 20:13:32,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686494105] [2023-12-15 20:13:32,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:13:32,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 20:13:32,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:13:32,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 20:13:32,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-15 20:13:32,238 INFO L87 Difference]: Start difference. First operand 97 states and 157 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2023-12-15 20:13:32,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:13:32,319 INFO L93 Difference]: Finished difference Result 217 states and 353 transitions. [2023-12-15 20:13:32,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 20:13:32,321 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 170 [2023-12-15 20:13:32,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:13:32,326 INFO L225 Difference]: With dead ends: 217 [2023-12-15 20:13:32,326 INFO L226 Difference]: Without dead ends: 121 [2023-12-15 20:13:32,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-15 20:13:32,332 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 140 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 20:13:32,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 339 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 20:13:32,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-12-15 20:13:32,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 97. [2023-12-15 20:13:32,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 68 states have (on average 1.5) internal successors, (102), 68 states have internal predecessors, (102), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-12-15 20:13:32,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 156 transitions. [2023-12-15 20:13:32,352 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 156 transitions. Word has length 170 [2023-12-15 20:13:32,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:13:32,352 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 156 transitions. [2023-12-15 20:13:32,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2023-12-15 20:13:32,353 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 156 transitions. [2023-12-15 20:13:32,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2023-12-15 20:13:32,354 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:13:32,355 INFO L195 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:13:32,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-15 20:13:32,355 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:13:32,355 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:13:32,355 INFO L85 PathProgramCache]: Analyzing trace with hash 2021410500, now seen corresponding path program 1 times [2023-12-15 20:13:32,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:13:32,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580771410] [2023-12-15 20:13:32,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:13:32,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:13:32,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:32,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:13:32,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:32,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:13:32,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:32,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:13:32,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:32,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:13:32,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:32,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:13:32,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:32,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:13:32,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:32,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:13:32,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:32,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:13:32,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:32,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:13:32,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:32,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:13:32,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:32,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:13:32,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:32,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:13:32,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:32,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 20:13:32,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:32,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 20:13:32,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:32,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 20:13:32,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:32,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 20:13:32,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:32,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-15 20:13:32,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:32,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-15 20:13:32,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:32,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-15 20:13:32,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:32,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-15 20:13:32,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:32,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-12-15 20:13:32,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:32,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-15 20:13:32,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:32,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-12-15 20:13:32,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:32,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-12-15 20:13:32,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:32,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-12-15 20:13:32,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:32,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-12-15 20:13:32,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:32,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-12-15 20:13:32,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:32,754 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2023-12-15 20:13:32,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:13:32,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580771410] [2023-12-15 20:13:32,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580771410] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:13:32,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:13:32,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 20:13:32,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37843210] [2023-12-15 20:13:32,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:13:32,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 20:13:32,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:13:32,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 20:13:32,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 20:13:32,762 INFO L87 Difference]: Start difference. First operand 97 states and 156 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2023-12-15 20:13:32,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:13:32,975 INFO L93 Difference]: Finished difference Result 290 states and 467 transitions. [2023-12-15 20:13:32,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 20:13:32,976 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 170 [2023-12-15 20:13:32,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:13:32,977 INFO L225 Difference]: With dead ends: 290 [2023-12-15 20:13:32,977 INFO L226 Difference]: Without dead ends: 194 [2023-12-15 20:13:32,978 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-15 20:13:32,979 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 142 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 20:13:32,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 448 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 20:13:32,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2023-12-15 20:13:33,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 145. [2023-12-15 20:13:33,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 88 states have (on average 1.3863636363636365) internal successors, (122), 88 states have internal predecessors, (122), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2023-12-15 20:13:33,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 230 transitions. [2023-12-15 20:13:33,004 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 230 transitions. Word has length 170 [2023-12-15 20:13:33,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:13:33,005 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 230 transitions. [2023-12-15 20:13:33,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2023-12-15 20:13:33,006 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 230 transitions. [2023-12-15 20:13:33,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2023-12-15 20:13:33,008 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:13:33,008 INFO L195 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:13:33,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-15 20:13:33,009 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:13:33,009 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:13:33,009 INFO L85 PathProgramCache]: Analyzing trace with hash -817953876, now seen corresponding path program 1 times [2023-12-15 20:13:33,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:13:33,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578454483] [2023-12-15 20:13:33,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:13:33,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:13:33,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:35,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:13:35,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:35,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:13:35,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:35,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:13:35,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:35,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:13:35,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:35,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:13:35,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:35,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:13:35,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:35,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:13:35,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:35,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:13:35,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:35,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:13:35,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:35,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:13:35,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:35,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:13:35,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:35,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:13:35,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:35,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 20:13:35,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:35,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 20:13:35,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:35,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 20:13:35,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:35,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 20:13:35,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:35,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-15 20:13:35,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:35,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-15 20:13:35,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:35,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-15 20:13:35,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:35,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-15 20:13:35,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:35,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-12-15 20:13:35,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:35,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-15 20:13:35,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:35,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-12-15 20:13:35,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:35,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-12-15 20:13:35,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:35,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-12-15 20:13:35,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:35,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-12-15 20:13:35,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:35,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-12-15 20:13:35,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:35,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2023-12-15 20:13:35,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:13:35,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578454483] [2023-12-15 20:13:35,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578454483] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:13:35,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:13:35,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 20:13:35,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348732149] [2023-12-15 20:13:35,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:13:35,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 20:13:35,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:13:35,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 20:13:35,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-15 20:13:35,598 INFO L87 Difference]: Start difference. First operand 145 states and 230 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2023-12-15 20:13:35,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:13:35,930 INFO L93 Difference]: Finished difference Result 299 states and 467 transitions. [2023-12-15 20:13:35,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 20:13:35,931 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 171 [2023-12-15 20:13:35,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:13:35,932 INFO L225 Difference]: With dead ends: 299 [2023-12-15 20:13:35,932 INFO L226 Difference]: Without dead ends: 203 [2023-12-15 20:13:35,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-15 20:13:35,933 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 162 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-15 20:13:35,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 341 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-15 20:13:35,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2023-12-15 20:13:35,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 155. [2023-12-15 20:13:35,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 97 states have (on average 1.3608247422680413) internal successors, (132), 97 states have internal predecessors, (132), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2023-12-15 20:13:35,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 240 transitions. [2023-12-15 20:13:35,963 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 240 transitions. Word has length 171 [2023-12-15 20:13:35,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:13:35,963 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 240 transitions. [2023-12-15 20:13:35,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2023-12-15 20:13:35,964 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 240 transitions. [2023-12-15 20:13:35,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2023-12-15 20:13:35,965 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:13:35,965 INFO L195 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:13:35,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-15 20:13:35,965 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:13:35,966 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:13:35,966 INFO L85 PathProgramCache]: Analyzing trace with hash -137895506, now seen corresponding path program 1 times [2023-12-15 20:13:35,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:13:35,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584345847] [2023-12-15 20:13:35,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:13:35,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:13:36,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:36,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:13:36,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:36,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:13:36,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:36,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:13:36,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:36,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:13:36,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:36,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:13:36,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:36,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:13:36,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:36,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:13:36,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:36,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:13:36,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:36,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:13:36,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:36,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:13:36,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:36,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:13:36,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:36,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:13:36,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:36,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 20:13:36,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:36,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 20:13:36,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:36,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 20:13:36,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:36,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 20:13:36,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:36,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-15 20:13:36,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:36,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-15 20:13:36,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:36,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-15 20:13:36,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:36,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-15 20:13:36,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:36,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-12-15 20:13:36,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:36,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-15 20:13:36,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:36,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-12-15 20:13:36,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:36,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-12-15 20:13:36,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:36,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-12-15 20:13:36,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:36,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-12-15 20:13:36,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:36,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-12-15 20:13:36,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:36,515 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 9 proven. 69 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2023-12-15 20:13:36,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:13:36,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584345847] [2023-12-15 20:13:36,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584345847] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 20:13:36,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898978997] [2023-12-15 20:13:36,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:13:36,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 20:13:36,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 20:13:36,524 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-15 20:13:36,533 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-15 20:13:36,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:13:36,670 INFO L262 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-15 20:13:36,682 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 20:13:36,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 308 proven. 69 refuted. 0 times theorem prover too weak. 1027 trivial. 0 not checked. [2023-12-15 20:13:36,959 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 20:13:37,204 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 9 proven. 69 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2023-12-15 20:13:37,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [898978997] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 20:13:37,204 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 20:13:37,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2023-12-15 20:13:37,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264760391] [2023-12-15 20:13:37,205 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 20:13:37,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-15 20:13:37,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:13:37,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-15 20:13:37,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-12-15 20:13:37,207 INFO L87 Difference]: Start difference. First operand 155 states and 240 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 2 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) [2023-12-15 20:13:37,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:13:37,506 INFO L93 Difference]: Finished difference Result 259 states and 392 transitions. [2023-12-15 20:13:37,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-15 20:13:37,507 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 2 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) Word has length 171 [2023-12-15 20:13:37,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:13:37,510 INFO L225 Difference]: With dead ends: 259 [2023-12-15 20:13:37,510 INFO L226 Difference]: Without dead ends: 153 [2023-12-15 20:13:37,511 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 391 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2023-12-15 20:13:37,513 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 220 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 20:13:37,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 222 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 20:13:37,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2023-12-15 20:13:37,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 143. [2023-12-15 20:13:37,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 83 states have (on average 1.2650602409638554) internal successors, (105), 83 states have internal predecessors, (105), 54 states have call successors, (54), 5 states have call predecessors, (54), 5 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2023-12-15 20:13:37,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 213 transitions. [2023-12-15 20:13:37,561 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 213 transitions. Word has length 171 [2023-12-15 20:13:37,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:13:37,564 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 213 transitions. [2023-12-15 20:13:37,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 2 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) [2023-12-15 20:13:37,565 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 213 transitions. [2023-12-15 20:13:37,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2023-12-15 20:13:37,566 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:13:37,566 INFO L195 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:13:37,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-15 20:13:37,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-12-15 20:13:37,776 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:13:37,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:13:37,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1222622707, now seen corresponding path program 1 times [2023-12-15 20:13:37,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:13:37,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959356873] [2023-12-15 20:13:37,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:13:37,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:13:37,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:14:03,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:14:03,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:14:03,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:14:03,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:14:03,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:14:03,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:14:03,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:14:03,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:14:03,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:14:03,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:14:03,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:14:03,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:14:03,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:14:03,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:14:03,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:14:03,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:14:03,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:14:03,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:14:03,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:14:03,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:14:03,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:14:03,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:14:03,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:14:03,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:14:03,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 20:14:03,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:14:03,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 20:14:03,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:14:03,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 20:14:03,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:14:03,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 20:14:03,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:14:03,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-15 20:14:03,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:14:03,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-15 20:14:03,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:14:03,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-15 20:14:03,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:14:03,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-15 20:14:03,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:14:03,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-12-15 20:14:03,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:14:03,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-15 20:14:03,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:14:03,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-12-15 20:14:03,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:14:03,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-12-15 20:14:03,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:14:03,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-12-15 20:14:03,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:14:03,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-12-15 20:14:03,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:14:03,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-12-15 20:14:03,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:14:03,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2023-12-15 20:14:03,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:14:03,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959356873] [2023-12-15 20:14:04,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959356873] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:14:04,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:14:04,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-12-15 20:14:04,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465882814] [2023-12-15 20:14:04,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:14:04,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-15 20:14:04,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:14:04,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-15 20:14:04,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2023-12-15 20:14:04,003 INFO L87 Difference]: Start difference. First operand 143 states and 213 transitions. Second operand has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 3 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) [2023-12-15 20:14:09,700 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-15 20:14:22,908 WARN L293 SmtUtils]: Spent 7.24s on a formula simplification. DAG size of input: 224 DAG size of output: 186 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-15 20:14:27,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] Received shutdown request... [2023-12-15 20:14:29,022 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-15 20:14:30,222 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-12-15 20:14:30,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-15 20:14:30,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 20.5s TimeCoverageRelationStatistics Valid=72, Invalid=269, Unknown=1, NotChecked=0, Total=342 [2023-12-15 20:14:30,236 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 167 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 133 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.9s IncrementalHoareTripleChecker+Time [2023-12-15 20:14:30,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 281 Invalid, 793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 658 Invalid, 2 Unknown, 0 Unchecked, 9.9s Time] [2023-12-15 20:14:30,237 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-15 20:14:30,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-15 20:14:30,240 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (143states) and FLOYD_HOARE automaton (currently 8 states, 14 states before enhancement),while PredicateUnifier was unifying predicates,while executing Executor. [2023-12-15 20:14:30,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 [2023-12-15 20:14:30,244 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:14:30,249 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 20:14:30,250 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 08:14:30 BoogieIcfgContainer [2023-12-15 20:14:30,250 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 20:14:30,251 INFO L158 Benchmark]: Toolchain (without parser) took 61353.28ms. Allocated memory was 274.7MB in the beginning and 725.6MB in the end (delta: 450.9MB). Free memory was 223.4MB in the beginning and 498.3MB in the end (delta: -274.9MB). Peak memory consumption was 178.2MB. Max. memory is 8.0GB. [2023-12-15 20:14:30,251 INFO L158 Benchmark]: CDTParser took 0.67ms. Allocated memory is still 194.0MB. Free memory is still 144.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 20:14:30,252 INFO L158 Benchmark]: CACSL2BoogieTranslator took 361.66ms. Allocated memory is still 274.7MB. Free memory was 223.4MB in the beginning and 208.4MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-15 20:14:30,252 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.07ms. Allocated memory is still 274.7MB. Free memory was 208.4MB in the beginning and 205.3MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-15 20:14:30,252 INFO L158 Benchmark]: Boogie Preprocessor took 47.29ms. Allocated memory is still 274.7MB. Free memory was 205.3MB in the beginning and 202.1MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-15 20:14:30,252 INFO L158 Benchmark]: RCFGBuilder took 608.81ms. Allocated memory is still 274.7MB. Free memory was 202.1MB in the beginning and 239.6MB in the end (delta: -37.4MB). Peak memory consumption was 31.8MB. Max. memory is 8.0GB. [2023-12-15 20:14:30,253 INFO L158 Benchmark]: TraceAbstraction took 60271.23ms. Allocated memory was 274.7MB in the beginning and 725.6MB in the end (delta: 450.9MB). Free memory was 238.5MB in the beginning and 498.3MB in the end (delta: -259.8MB). Peak memory consumption was 191.5MB. Max. memory is 8.0GB. [2023-12-15 20:14:30,255 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.67ms. Allocated memory is still 194.0MB. Free memory is still 144.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 361.66ms. Allocated memory is still 274.7MB. Free memory was 223.4MB in the beginning and 208.4MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 57.07ms. Allocated memory is still 274.7MB. Free memory was 208.4MB in the beginning and 205.3MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 47.29ms. Allocated memory is still 274.7MB. Free memory was 205.3MB in the beginning and 202.1MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 608.81ms. Allocated memory is still 274.7MB. Free memory was 202.1MB in the beginning and 239.6MB in the end (delta: -37.4MB). Peak memory consumption was 31.8MB. Max. memory is 8.0GB. * TraceAbstraction took 60271.23ms. Allocated memory was 274.7MB in the beginning and 725.6MB in the end (delta: 450.9MB). Free memory was 238.5MB in the beginning and 498.3MB in the end (delta: -259.8MB). Peak memory consumption was 191.5MB. 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 - TimeoutResultAtElement [Line: 19]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 19). Cancelled while NwaCegarLoop was constructing difference of abstraction (143states) and FLOYD_HOARE automaton (currently 8 states, 14 states before enhancement),while PredicateUnifier was unifying predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 85 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 60.2s, OverallIterations: 7, TraceHistogramMax: 27, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 27.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 949 SdHoareTripleChecker+Valid, 10.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 947 mSDsluCounter, 2093 SdHoareTripleChecker+Invalid, 10.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1191 mSDsCounter, 338 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1093 IncrementalHoareTripleChecker+Invalid, 1433 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 338 mSolverCounterUnsat, 902 mSDtfsCounter, 1093 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 811 GetRequests, 763 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 20.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=155occurred in iteration=5, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 196 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 31.3s InterpolantComputationTime, 1365 NumberOfCodeBlocks, 1365 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1527 ConstructedInterpolants, 0 QuantifiedInterpolants, 15614 SizeOfPredicates, 5 NumberOfNonLiveVariables, 410 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 12429/12636 InterpolantCoveringCapability, 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 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown