./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-52.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-52.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b4834357d23aac5c2a51d001b1c25f4722c265308db77262bd19157b1e0789ed --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 09:30:07,532 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 09:30:07,614 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 09:30:07,621 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 09:30:07,622 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 09:30:07,654 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 09:30:07,655 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 09:30:07,655 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 09:30:07,656 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 09:30:07,658 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 09:30:07,658 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 09:30:07,659 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 09:30:07,659 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 09:30:07,661 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 09:30:07,662 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 09:30:07,662 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 09:30:07,662 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 09:30:07,662 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 09:30:07,663 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 09:30:07,663 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 09:30:07,663 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 09:30:07,667 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 09:30:07,668 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 09:30:07,668 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 09:30:07,668 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 09:30:07,668 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 09:30:07,668 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 09:30:07,669 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 09:30:07,669 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 09:30:07,669 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 09:30:07,669 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 09:30:07,669 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 09:30:07,670 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:30:07,670 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 09:30:07,670 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 09:30:07,670 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 09:30:07,670 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 09:30:07,670 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 09:30:07,671 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 09:30:07,671 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 09:30:07,673 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 09:30:07,673 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 09:30:07,674 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-clean/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: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b4834357d23aac5c2a51d001b1c25f4722c265308db77262bd19157b1e0789ed [2024-10-11 09:30:07,956 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 09:30:07,984 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 09:30:07,987 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 09:30:07,989 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 09:30:07,989 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 09:30:07,991 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-52.i [2024-10-11 09:30:09,557 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 09:30:09,780 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 09:30:09,781 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-52.i [2024-10-11 09:30:09,790 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/fc8f58f34/11ccaba442544c3e9a811522446acdb3/FLAG717106a2d [2024-10-11 09:30:10,131 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/fc8f58f34/11ccaba442544c3e9a811522446acdb3 [2024-10-11 09:30:10,133 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 09:30:10,135 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 09:30:10,136 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 09:30:10,136 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 09:30:10,140 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 09:30:10,141 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:30:10" (1/1) ... [2024-10-11 09:30:10,142 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@867aa0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:30:10, skipping insertion in model container [2024-10-11 09:30:10,142 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:30:10" (1/1) ... [2024-10-11 09:30:10,178 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 09:30:10,356 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-52.i[919,932] [2024-10-11 09:30:10,467 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:30:10,486 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 09:30:10,498 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-52.i[919,932] [2024-10-11 09:30:10,544 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:30:10,563 INFO L204 MainTranslator]: Completed translation [2024-10-11 09:30:10,564 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:30:10 WrapperNode [2024-10-11 09:30:10,564 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 09:30:10,565 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 09:30:10,565 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 09:30:10,565 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 09:30:10,571 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:30:10" (1/1) ... [2024-10-11 09:30:10,618 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:30:10" (1/1) ... [2024-10-11 09:30:10,681 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 193 [2024-10-11 09:30:10,681 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 09:30:10,682 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 09:30:10,682 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 09:30:10,682 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 09:30:10,693 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:30:10" (1/1) ... [2024-10-11 09:30:10,694 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:30:10" (1/1) ... [2024-10-11 09:30:10,702 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:30:10" (1/1) ... [2024-10-11 09:30:10,721 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]. [2024-10-11 09:30:10,722 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:30:10" (1/1) ... [2024-10-11 09:30:10,722 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:30:10" (1/1) ... [2024-10-11 09:30:10,737 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:30:10" (1/1) ... [2024-10-11 09:30:10,743 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:30:10" (1/1) ... [2024-10-11 09:30:10,752 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:30:10" (1/1) ... [2024-10-11 09:30:10,754 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:30:10" (1/1) ... [2024-10-11 09:30:10,762 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 09:30:10,763 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 09:30:10,764 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 09:30:10,764 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 09:30:10,765 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:30:10" (1/1) ... [2024-10-11 09:30:10,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:30:10,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:30:10,797 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 09:30:10,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 09:30:10,837 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 09:30:10,837 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 09:30:10,837 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 09:30:10,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 09:30:10,838 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 09:30:10,838 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 09:30:10,910 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 09:30:10,912 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 09:30:11,272 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-10-11 09:30:11,272 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 09:30:11,328 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 09:30:11,329 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 09:30:11,329 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:30:11 BoogieIcfgContainer [2024-10-11 09:30:11,329 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 09:30:11,332 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 09:30:11,332 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 09:30:11,336 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 09:30:11,336 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 09:30:10" (1/3) ... [2024-10-11 09:30:11,338 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a52b4a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:30:11, skipping insertion in model container [2024-10-11 09:30:11,338 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:30:10" (2/3) ... [2024-10-11 09:30:11,339 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a52b4a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:30:11, skipping insertion in model container [2024-10-11 09:30:11,339 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:30:11" (3/3) ... [2024-10-11 09:30:11,342 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-52.i [2024-10-11 09:30:11,361 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 09:30:11,361 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 09:30:11,425 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 09:30:11,435 INFO L333 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, 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;@155287f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 09:30:11,435 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 09:30:11,440 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 53 states have (on average 1.5471698113207548) internal successors, (82), 54 states have internal predecessors, (82), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 09:30:11,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-11 09:30:11,452 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:30:11,453 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:30:11,454 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:30:11,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:30:11,461 INFO L85 PathProgramCache]: Analyzing trace with hash 758583800, now seen corresponding path program 1 times [2024-10-11 09:30:11,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:30:11,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494108] [2024-10-11 09:30:11,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:30:11,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:30:11,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:11,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:30:11,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:11,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:30:11,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:11,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:30:11,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:11,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:30:11,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:11,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:30:11,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:11,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:30:11,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:11,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:30:11,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:11,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:30:11,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:11,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:30:11,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:11,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:30:11,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:11,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:30:11,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:11,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 09:30:11,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:11,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:30:11,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:11,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 09:30:11,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:11,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:30:11,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:11,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:30:11,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:11,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 09:30:11,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:11,954 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 09:30:11,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:30:11,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494108] [2024-10-11 09:30:11,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494108] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:30:11,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:30:11,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 09:30:11,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979592886] [2024-10-11 09:30:11,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:30:11,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 09:30:11,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:30:11,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 09:30:12,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 09:30:12,003 INFO L87 Difference]: Start difference. First operand has 73 states, 53 states have (on average 1.5471698113207548) internal successors, (82), 54 states have internal predecessors, (82), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 09:30:12,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:30:12,075 INFO L93 Difference]: Finished difference Result 143 states and 247 transitions. [2024-10-11 09:30:12,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 09:30:12,078 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 120 [2024-10-11 09:30:12,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:30:12,088 INFO L225 Difference]: With dead ends: 143 [2024-10-11 09:30:12,089 INFO L226 Difference]: Without dead ends: 71 [2024-10-11 09:30:12,094 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 09:30:12,097 INFO L432 NwaCegarLoop]: 108 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, 108 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 [2024-10-11 09:30:12,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 108 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 09:30:12,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-11 09:30:12,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-10-11 09:30:12,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 52 states have (on average 1.4807692307692308) internal successors, (77), 52 states have internal predecessors, (77), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 09:30:12,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 111 transitions. [2024-10-11 09:30:12,156 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 111 transitions. Word has length 120 [2024-10-11 09:30:12,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:30:12,156 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 111 transitions. [2024-10-11 09:30:12,157 INFO L472 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 09:30:12,157 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 111 transitions. [2024-10-11 09:30:12,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-11 09:30:12,159 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:30:12,160 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:30:12,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 09:30:12,160 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:30:12,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:30:12,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1849574206, now seen corresponding path program 1 times [2024-10-11 09:30:12,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:30:12,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943317105] [2024-10-11 09:30:12,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:30:12,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:30:12,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:12,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:30:12,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:12,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:30:12,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:12,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:30:12,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:12,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:30:12,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:12,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:30:12,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:12,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:30:12,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:12,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:30:12,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:12,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:30:12,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:12,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:30:12,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:12,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:30:12,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:12,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:30:12,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:12,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 09:30:12,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:12,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:30:12,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:12,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 09:30:12,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:12,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:30:12,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:12,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:30:12,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:12,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 09:30:12,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:12,608 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 09:30:12,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:30:12,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943317105] [2024-10-11 09:30:12,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943317105] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:30:12,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:30:12,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 09:30:12,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523897020] [2024-10-11 09:30:12,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:30:12,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 09:30:12,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:30:12,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 09:30:12,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 09:30:12,616 INFO L87 Difference]: Start difference. First operand 71 states and 111 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 09:30:12,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:30:12,741 INFO L93 Difference]: Finished difference Result 173 states and 273 transitions. [2024-10-11 09:30:12,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 09:30:12,742 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 120 [2024-10-11 09:30:12,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:30:12,745 INFO L225 Difference]: With dead ends: 173 [2024-10-11 09:30:12,747 INFO L226 Difference]: Without dead ends: 103 [2024-10-11 09:30:12,748 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 09:30:12,749 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 37 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 09:30:12,749 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 173 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 09:30:12,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-11 09:30:12,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 92. [2024-10-11 09:30:12,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 73 states have (on average 1.547945205479452) internal successors, (113), 73 states have internal predecessors, (113), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 09:30:12,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 147 transitions. [2024-10-11 09:30:12,770 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 147 transitions. Word has length 120 [2024-10-11 09:30:12,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:30:12,771 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 147 transitions. [2024-10-11 09:30:12,772 INFO L472 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 09:30:12,772 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 147 transitions. [2024-10-11 09:30:12,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-11 09:30:12,774 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:30:12,774 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:30:12,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 09:30:12,775 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:30:12,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:30:12,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1202735406, now seen corresponding path program 1 times [2024-10-11 09:30:12,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:30:12,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002307171] [2024-10-11 09:30:12,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:30:12,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:30:12,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:13,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:30:13,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:13,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:30:13,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:13,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:30:13,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:13,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:30:13,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:13,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:30:13,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:13,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:30:13,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:13,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:30:13,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:13,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:30:13,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:13,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:30:13,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:13,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:30:13,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:13,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:30:13,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:13,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 09:30:13,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:13,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:30:13,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:13,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 09:30:13,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:13,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:30:13,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:13,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:30:13,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:13,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 09:30:13,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:13,141 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 09:30:13,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:30:13,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002307171] [2024-10-11 09:30:13,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002307171] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:30:13,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:30:13,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 09:30:13,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102830268] [2024-10-11 09:30:13,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:30:13,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 09:30:13,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:30:13,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 09:30:13,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 09:30:13,150 INFO L87 Difference]: Start difference. First operand 92 states and 147 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 09:30:13,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:30:13,347 INFO L93 Difference]: Finished difference Result 162 states and 257 transitions. [2024-10-11 09:30:13,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 09:30:13,347 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 121 [2024-10-11 09:30:13,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:30:13,352 INFO L225 Difference]: With dead ends: 162 [2024-10-11 09:30:13,352 INFO L226 Difference]: Without dead ends: 71 [2024-10-11 09:30:13,353 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 09:30:13,354 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 135 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 09:30:13,354 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 141 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 09:30:13,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-11 09:30:13,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-10-11 09:30:13,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 52 states have internal predecessors, (74), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 09:30:13,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 108 transitions. [2024-10-11 09:30:13,364 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 108 transitions. Word has length 121 [2024-10-11 09:30:13,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:30:13,364 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 108 transitions. [2024-10-11 09:30:13,365 INFO L472 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 09:30:13,365 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 108 transitions. [2024-10-11 09:30:13,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-11 09:30:13,371 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:30:13,371 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:30:13,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 09:30:13,372 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:30:13,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:30:13,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1110424568, now seen corresponding path program 1 times [2024-10-11 09:30:13,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:30:13,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189839699] [2024-10-11 09:30:13,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:30:13,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:30:13,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:13,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:30:13,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:13,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:30:13,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:13,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:30:13,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:13,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:30:13,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:13,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:30:13,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:13,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:30:13,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:13,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:30:13,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:13,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:30:13,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:13,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:30:13,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:13,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:30:13,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:13,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:30:13,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:13,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 09:30:13,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:13,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:30:13,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:13,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 09:30:13,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:13,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:30:13,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:13,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:30:13,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:13,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 09:30:13,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:13,759 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 09:30:13,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:30:13,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189839699] [2024-10-11 09:30:13,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189839699] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:30:13,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:30:13,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 09:30:13,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174025557] [2024-10-11 09:30:13,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:30:13,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 09:30:13,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:30:13,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 09:30:13,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 09:30:13,762 INFO L87 Difference]: Start difference. First operand 71 states and 108 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 09:30:13,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:30:13,892 INFO L93 Difference]: Finished difference Result 153 states and 231 transitions. [2024-10-11 09:30:13,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 09:30:13,893 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 121 [2024-10-11 09:30:13,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:30:13,894 INFO L225 Difference]: With dead ends: 153 [2024-10-11 09:30:13,896 INFO L226 Difference]: Without dead ends: 83 [2024-10-11 09:30:13,897 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 09:30:13,898 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 54 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 09:30:13,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 214 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 09:30:13,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-11 09:30:13,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2024-10-11 09:30:13,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 58 states have (on average 1.3793103448275863) internal successors, (80), 59 states have internal predecessors, (80), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 09:30:13,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 122 transitions. [2024-10-11 09:30:13,918 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 122 transitions. Word has length 121 [2024-10-11 09:30:13,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:30:13,920 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 122 transitions. [2024-10-11 09:30:13,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 09:30:13,921 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 122 transitions. [2024-10-11 09:30:13,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-11 09:30:13,924 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:30:13,924 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:30:13,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 09:30:13,925 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:30:13,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:30:13,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1110364986, now seen corresponding path program 1 times [2024-10-11 09:30:13,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:30:13,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861036580] [2024-10-11 09:30:13,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:30:13,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:30:14,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:14,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:30:14,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:14,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:30:14,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:14,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:30:14,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:14,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:30:14,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:14,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:30:14,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:14,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:30:14,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:14,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:30:14,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:14,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:30:14,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:14,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:30:14,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:14,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:30:14,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:14,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:30:14,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:14,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 09:30:14,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:14,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:30:14,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:14,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 09:30:14,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:14,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:30:14,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:14,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:30:14,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:14,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 09:30:14,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:14,924 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 09:30:14,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:30:14,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861036580] [2024-10-11 09:30:14,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861036580] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:30:14,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:30:14,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 09:30:14,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33343460] [2024-10-11 09:30:14,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:30:14,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 09:30:14,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:30:14,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 09:30:14,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 09:30:14,928 INFO L87 Difference]: Start difference. First operand 82 states and 122 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 09:30:15,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:30:15,225 INFO L93 Difference]: Finished difference Result 260 states and 384 transitions. [2024-10-11 09:30:15,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 09:30:15,226 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), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 121 [2024-10-11 09:30:15,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:30:15,228 INFO L225 Difference]: With dead ends: 260 [2024-10-11 09:30:15,228 INFO L226 Difference]: Without dead ends: 185 [2024-10-11 09:30:15,228 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 09:30:15,233 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 165 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 09:30:15,233 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 374 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 09:30:15,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-10-11 09:30:15,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 180. [2024-10-11 09:30:15,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 123 states have (on average 1.3414634146341464) internal successors, (165), 124 states have internal predecessors, (165), 51 states have call successors, (51), 5 states have call predecessors, (51), 5 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2024-10-11 09:30:15,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 267 transitions. [2024-10-11 09:30:15,273 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 267 transitions. Word has length 121 [2024-10-11 09:30:15,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:30:15,274 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 267 transitions. [2024-10-11 09:30:15,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 09:30:15,274 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 267 transitions. [2024-10-11 09:30:15,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-11 09:30:15,275 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:30:15,276 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:30:15,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 09:30:15,276 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:30:15,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:30:15,277 INFO L85 PathProgramCache]: Analyzing trace with hash 606171171, now seen corresponding path program 1 times [2024-10-11 09:30:15,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:30:15,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290930826] [2024-10-11 09:30:15,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:30:15,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:30:15,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:26,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:30:26,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:26,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:30:26,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:26,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:30:26,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:26,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:30:26,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:26,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:30:26,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:26,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:30:26,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:26,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:30:26,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:26,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:30:26,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:26,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:30:26,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:26,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:30:26,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:26,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:30:26,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:26,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 09:30:26,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:26,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:30:26,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:26,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 09:30:26,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:26,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:30:26,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:26,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:30:26,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:26,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 09:30:26,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:26,961 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 09:30:26,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:30:26,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290930826] [2024-10-11 09:30:26,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290930826] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:30:26,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:30:26,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-11 09:30:26,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944406044] [2024-10-11 09:30:26,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:30:26,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 09:30:26,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:30:26,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 09:30:26,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2024-10-11 09:30:26,966 INFO L87 Difference]: Start difference. First operand 180 states and 267 transitions. Second operand has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2024-10-11 09:30:30,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:30:30,537 INFO L93 Difference]: Finished difference Result 502 states and 739 transitions. [2024-10-11 09:30:30,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 09:30:30,538 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 123 [2024-10-11 09:30:30,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:30:30,540 INFO L225 Difference]: With dead ends: 502 [2024-10-11 09:30:30,540 INFO L226 Difference]: Without dead ends: 354 [2024-10-11 09:30:30,541 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=188, Invalid=514, Unknown=0, NotChecked=0, Total=702 [2024-10-11 09:30:30,542 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 1234 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1234 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-11 09:30:30,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1234 Valid, 422 Invalid, 897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-11 09:30:30,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2024-10-11 09:30:30,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 229. [2024-10-11 09:30:30,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 172 states have (on average 1.4069767441860466) internal successors, (242), 172 states have internal predecessors, (242), 51 states have call successors, (51), 5 states have call predecessors, (51), 5 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2024-10-11 09:30:30,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 344 transitions. [2024-10-11 09:30:30,588 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 344 transitions. Word has length 123 [2024-10-11 09:30:30,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:30:30,590 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 344 transitions. [2024-10-11 09:30:30,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2024-10-11 09:30:30,590 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 344 transitions. [2024-10-11 09:30:30,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-11 09:30:30,591 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:30:30,594 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:30:30,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 09:30:30,594 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:30:30,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:30:30,595 INFO L85 PathProgramCache]: Analyzing trace with hash -673692507, now seen corresponding path program 1 times [2024-10-11 09:30:30,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:30:30,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925321150] [2024-10-11 09:30:30,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:30:30,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:30:30,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:30,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:30:30,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:30,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:30:30,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:30,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:30:30,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:30,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:30:30,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:30,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:30:30,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:30,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:30:30,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:30,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:30:30,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:30,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:30:30,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:30,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:30:30,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:30,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:30:30,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:30,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:30:30,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:30,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 09:30:30,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:30,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:30:30,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:30,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 09:30:30,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:30,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:30:30,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:30,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:30:30,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:30,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 09:30:30,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:30,825 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 09:30:30,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:30:30,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925321150] [2024-10-11 09:30:30,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925321150] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:30:30,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:30:30,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 09:30:30,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221443363] [2024-10-11 09:30:30,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:30:30,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 09:30:30,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:30:30,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 09:30:30,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 09:30:30,828 INFO L87 Difference]: Start difference. First operand 229 states and 344 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 09:30:31,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:30:31,130 INFO L93 Difference]: Finished difference Result 523 states and 780 transitions. [2024-10-11 09:30:31,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 09:30:31,131 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 123 [2024-10-11 09:30:31,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:30:31,134 INFO L225 Difference]: With dead ends: 523 [2024-10-11 09:30:31,134 INFO L226 Difference]: Without dead ends: 375 [2024-10-11 09:30:31,137 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 09:30:31,139 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 193 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 09:30:31,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 390 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 09:30:31,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2024-10-11 09:30:31,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 371. [2024-10-11 09:30:31,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 276 states have (on average 1.391304347826087) internal successors, (384), 276 states have internal predecessors, (384), 85 states have call successors, (85), 9 states have call predecessors, (85), 9 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2024-10-11 09:30:31,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 554 transitions. [2024-10-11 09:30:31,188 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 554 transitions. Word has length 123 [2024-10-11 09:30:31,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:30:31,188 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 554 transitions. [2024-10-11 09:30:31,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 09:30:31,189 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 554 transitions. [2024-10-11 09:30:31,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-11 09:30:31,191 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:30:31,191 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:30:31,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 09:30:31,192 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:30:31,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:30:31,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1219964707, now seen corresponding path program 1 times [2024-10-11 09:30:31,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:30:31,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692485457] [2024-10-11 09:30:31,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:30:31,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:30:31,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:31,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:30:31,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:31,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:30:31,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:31,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:30:31,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:31,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:30:31,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:31,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:30:31,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:31,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:30:31,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:31,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:30:31,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:31,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:30:31,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:31,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:30:31,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:31,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:30:31,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:31,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:30:31,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:31,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 09:30:31,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:31,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:30:31,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:31,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 09:30:31,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:31,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:30:31,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:31,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:30:31,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:31,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 09:30:31,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:31,418 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 09:30:31,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:30:31,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692485457] [2024-10-11 09:30:31,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692485457] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:30:31,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:30:31,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 09:30:31,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445527810] [2024-10-11 09:30:31,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:30:31,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 09:30:31,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:30:31,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 09:30:31,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 09:30:31,420 INFO L87 Difference]: Start difference. First operand 371 states and 554 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 09:30:31,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:30:31,678 INFO L93 Difference]: Finished difference Result 779 states and 1156 transitions. [2024-10-11 09:30:31,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 09:30:31,678 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 123 [2024-10-11 09:30:31,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:30:31,682 INFO L225 Difference]: With dead ends: 779 [2024-10-11 09:30:31,682 INFO L226 Difference]: Without dead ends: 489 [2024-10-11 09:30:31,683 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 09:30:31,684 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 137 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 09:30:31,684 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 430 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 09:30:31,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2024-10-11 09:30:31,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 387. [2024-10-11 09:30:31,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 292 states have (on average 1.404109589041096) internal successors, (410), 292 states have internal predecessors, (410), 85 states have call successors, (85), 9 states have call predecessors, (85), 9 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2024-10-11 09:30:31,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 580 transitions. [2024-10-11 09:30:31,734 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 580 transitions. Word has length 123 [2024-10-11 09:30:31,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:30:31,735 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 580 transitions. [2024-10-11 09:30:31,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 09:30:31,735 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 580 transitions. [2024-10-11 09:30:31,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-11 09:30:31,737 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:30:31,737 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:30:31,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 09:30:31,737 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:30:31,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:30:31,738 INFO L85 PathProgramCache]: Analyzing trace with hash -59898971, now seen corresponding path program 1 times [2024-10-11 09:30:31,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:30:31,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730625701] [2024-10-11 09:30:31,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:30:31,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:30:31,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:31,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:30:31,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:31,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:30:31,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:31,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:30:31,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:31,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:30:31,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:31,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:30:31,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:31,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:30:31,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:31,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:30:31,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:31,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:30:31,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:31,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:30:31,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:31,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:30:31,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:31,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:30:31,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:31,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 09:30:31,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:31,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:30:31,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:31,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 09:30:31,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:31,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:30:31,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:31,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:30:31,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:31,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 09:30:31,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:31,931 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 09:30:31,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:30:31,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730625701] [2024-10-11 09:30:31,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730625701] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:30:31,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:30:31,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 09:30:31,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194552] [2024-10-11 09:30:31,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:30:31,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 09:30:31,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:30:31,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 09:30:31,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 09:30:31,934 INFO L87 Difference]: Start difference. First operand 387 states and 580 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 09:30:32,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:30:32,127 INFO L93 Difference]: Finished difference Result 729 states and 1089 transitions. [2024-10-11 09:30:32,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 09:30:32,128 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 123 [2024-10-11 09:30:32,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:30:32,130 INFO L225 Difference]: With dead ends: 729 [2024-10-11 09:30:32,131 INFO L226 Difference]: Without dead ends: 409 [2024-10-11 09:30:32,132 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 09:30:32,132 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 227 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 09:30:32,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 310 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 09:30:32,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2024-10-11 09:30:32,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 254. [2024-10-11 09:30:32,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 197 states have (on average 1.4365482233502538) internal successors, (283), 197 states have internal predecessors, (283), 51 states have call successors, (51), 5 states have call predecessors, (51), 5 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2024-10-11 09:30:32,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 385 transitions. [2024-10-11 09:30:32,162 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 385 transitions. Word has length 123 [2024-10-11 09:30:32,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:30:32,163 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 385 transitions. [2024-10-11 09:30:32,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 09:30:32,163 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 385 transitions. [2024-10-11 09:30:32,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-11 09:30:32,164 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:30:32,164 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:30:32,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 09:30:32,165 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:30:32,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:30:32,165 INFO L85 PathProgramCache]: Analyzing trace with hash -2036198410, now seen corresponding path program 1 times [2024-10-11 09:30:32,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:30:32,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563798910] [2024-10-11 09:30:32,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:30:32,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:30:32,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:34,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:30:34,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:34,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:30:34,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:34,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:30:34,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:34,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:30:34,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:34,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:30:34,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:34,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:30:34,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:34,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:30:34,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:34,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:30:34,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:34,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:30:34,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:34,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:30:34,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:34,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:30:34,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:34,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 09:30:34,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:34,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:30:34,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:34,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 09:30:34,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:34,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:30:34,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:34,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:30:34,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:35,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 09:30:35,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:35,004 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 09:30:35,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:30:35,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563798910] [2024-10-11 09:30:35,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563798910] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:30:35,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:30:35,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 09:30:35,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226960331] [2024-10-11 09:30:35,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:30:35,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 09:30:35,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:30:35,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 09:30:35,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-11 09:30:35,007 INFO L87 Difference]: Start difference. First operand 254 states and 385 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 09:30:35,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:30:35,579 INFO L93 Difference]: Finished difference Result 396 states and 588 transitions. [2024-10-11 09:30:35,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 09:30:35,579 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 124 [2024-10-11 09:30:35,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:30:35,581 INFO L225 Difference]: With dead ends: 396 [2024-10-11 09:30:35,581 INFO L226 Difference]: Without dead ends: 187 [2024-10-11 09:30:35,582 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-10-11 09:30:35,584 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 109 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 09:30:35,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 153 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 09:30:35,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-10-11 09:30:35,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 174. [2024-10-11 09:30:35,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 117 states have (on average 1.2564102564102564) internal successors, (147), 118 states have internal predecessors, (147), 51 states have call successors, (51), 5 states have call predecessors, (51), 5 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2024-10-11 09:30:35,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 249 transitions. [2024-10-11 09:30:35,615 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 249 transitions. Word has length 124 [2024-10-11 09:30:35,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:30:35,615 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 249 transitions. [2024-10-11 09:30:35,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 09:30:35,615 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 249 transitions. [2024-10-11 09:30:35,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-11 09:30:35,616 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:30:35,617 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:30:35,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 09:30:35,617 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:30:35,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:30:35,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1362317576, now seen corresponding path program 1 times [2024-10-11 09:30:35,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:30:35,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119979864] [2024-10-11 09:30:35,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:30:35,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:30:35,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:35,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:30:35,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:35,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:30:35,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:35,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:30:35,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:35,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:30:35,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:35,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:30:35,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:35,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:30:35,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:35,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:30:35,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:35,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:30:35,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:35,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:30:35,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:35,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:30:35,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:35,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:30:35,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:35,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 09:30:35,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:35,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:30:35,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:35,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 09:30:35,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:35,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:30:35,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:35,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:30:35,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:35,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 09:30:35,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:35,861 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 09:30:35,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:30:35,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119979864] [2024-10-11 09:30:35,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119979864] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:30:35,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:30:35,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 09:30:35,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84648637] [2024-10-11 09:30:35,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:30:35,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 09:30:35,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:30:35,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 09:30:35,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 09:30:35,863 INFO L87 Difference]: Start difference. First operand 174 states and 249 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 09:30:36,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:30:36,107 INFO L93 Difference]: Finished difference Result 318 states and 452 transitions. [2024-10-11 09:30:36,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 09:30:36,108 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 125 [2024-10-11 09:30:36,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:30:36,110 INFO L225 Difference]: With dead ends: 318 [2024-10-11 09:30:36,110 INFO L226 Difference]: Without dead ends: 176 [2024-10-11 09:30:36,111 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-10-11 09:30:36,111 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 111 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 09:30:36,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 393 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 09:30:36,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-10-11 09:30:36,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 174. [2024-10-11 09:30:36,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 117 states have (on average 1.2393162393162394) internal successors, (145), 118 states have internal predecessors, (145), 51 states have call successors, (51), 5 states have call predecessors, (51), 5 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2024-10-11 09:30:36,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 247 transitions. [2024-10-11 09:30:36,138 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 247 transitions. Word has length 125 [2024-10-11 09:30:36,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:30:36,138 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 247 transitions. [2024-10-11 09:30:36,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 09:30:36,139 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 247 transitions. [2024-10-11 09:30:36,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-11 09:30:36,140 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:30:36,140 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:30:36,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 09:30:36,140 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:30:36,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:30:36,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1362377158, now seen corresponding path program 1 times [2024-10-11 09:30:36,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:30:36,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691827869] [2024-10-11 09:30:36,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:30:36,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:30:36,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:43,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:30:43,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:43,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:30:43,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:43,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:30:43,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:43,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:30:43,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:43,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:30:43,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:43,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:30:43,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:43,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:30:43,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:43,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:30:43,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:43,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:30:43,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:43,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:30:43,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:43,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:30:43,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:43,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 09:30:43,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:43,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:30:43,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:43,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 09:30:43,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:43,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:30:43,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:43,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:30:43,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:43,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 09:30:43,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:43,800 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 09:30:43,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:30:43,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691827869] [2024-10-11 09:30:43,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691827869] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:30:43,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:30:43,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-10-11 09:30:43,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421925949] [2024-10-11 09:30:43,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:30:43,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 09:30:43,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:30:43,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 09:30:43,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2024-10-11 09:30:43,804 INFO L87 Difference]: Start difference. First operand 174 states and 247 transitions. Second operand has 16 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 16 states have internal predecessors, (43), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2024-10-11 09:30:45,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:30:45,354 INFO L93 Difference]: Finished difference Result 249 states and 342 transitions. [2024-10-11 09:30:45,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 09:30:45,355 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 16 states have internal predecessors, (43), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 125 [2024-10-11 09:30:45,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:30:45,357 INFO L225 Difference]: With dead ends: 249 [2024-10-11 09:30:45,357 INFO L226 Difference]: Without dead ends: 247 [2024-10-11 09:30:45,358 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=170, Invalid=480, Unknown=0, NotChecked=0, Total=650 [2024-10-11 09:30:45,359 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 334 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 09:30:45,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 328 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 09:30:45,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-10-11 09:30:45,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 220. [2024-10-11 09:30:45,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 163 states have (on average 1.2576687116564418) internal successors, (205), 163 states have internal predecessors, (205), 51 states have call successors, (51), 5 states have call predecessors, (51), 5 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2024-10-11 09:30:45,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 307 transitions. [2024-10-11 09:30:45,390 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 307 transitions. Word has length 125 [2024-10-11 09:30:45,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:30:45,391 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 307 transitions. [2024-10-11 09:30:45,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 16 states have internal predecessors, (43), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2024-10-11 09:30:45,391 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 307 transitions. [2024-10-11 09:30:45,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-11 09:30:45,392 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:30:45,392 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:30:45,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 09:30:45,393 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:30:45,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:30:45,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1272309140, now seen corresponding path program 1 times [2024-10-11 09:30:45,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:30:45,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949580164] [2024-10-11 09:30:45,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:30:45,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:30:45,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:49,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:30:49,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:49,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:30:49,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:49,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:30:49,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:49,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:30:49,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:49,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:30:49,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:49,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:30:49,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:49,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:30:49,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:49,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:30:49,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:49,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:30:49,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:49,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:30:49,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:49,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:30:49,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:49,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 09:30:49,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:49,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:30:49,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:49,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 09:30:49,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:49,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:30:49,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:49,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:30:49,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:49,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 09:30:49,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:49,657 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 09:30:49,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:30:49,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949580164] [2024-10-11 09:30:49,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949580164] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:30:49,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:30:49,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 09:30:49,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129539365] [2024-10-11 09:30:49,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:30:49,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 09:30:49,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:30:49,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 09:30:49,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2024-10-11 09:30:49,660 INFO L87 Difference]: Start difference. First operand 220 states and 307 transitions. Second operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 09:30:50,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:30:50,484 INFO L93 Difference]: Finished difference Result 431 states and 597 transitions. [2024-10-11 09:30:50,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 09:30:50,485 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 126 [2024-10-11 09:30:50,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:30:50,487 INFO L225 Difference]: With dead ends: 431 [2024-10-11 09:30:50,488 INFO L226 Difference]: Without dead ends: 268 [2024-10-11 09:30:50,488 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=150, Invalid=312, Unknown=0, NotChecked=0, Total=462 [2024-10-11 09:30:50,489 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 153 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 09:30:50,489 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 223 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 09:30:50,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-10-11 09:30:50,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 240. [2024-10-11 09:30:50,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 183 states have (on average 1.2513661202185793) internal successors, (229), 183 states have internal predecessors, (229), 51 states have call successors, (51), 5 states have call predecessors, (51), 5 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2024-10-11 09:30:50,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 331 transitions. [2024-10-11 09:30:50,521 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 331 transitions. Word has length 126 [2024-10-11 09:30:50,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:30:50,521 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 331 transitions. [2024-10-11 09:30:50,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 09:30:50,522 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 331 transitions. [2024-10-11 09:30:50,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-10-11 09:30:50,525 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:30:50,525 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:30:50,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 09:30:50,526 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:30:50,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:30:50,526 INFO L85 PathProgramCache]: Analyzing trace with hash -905443201, now seen corresponding path program 1 times [2024-10-11 09:30:50,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:30:50,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361627522] [2024-10-11 09:30:50,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:30:50,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:30:50,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:51,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:30:51,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:51,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:30:51,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:51,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:30:51,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:51,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:30:51,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:51,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:30:51,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:51,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:30:51,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:51,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:30:51,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:51,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:30:51,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:51,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:30:51,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:51,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:30:51,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:51,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:30:51,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:51,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 09:30:51,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:51,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:30:51,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:51,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 09:30:51,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:51,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:30:51,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:51,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:30:51,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:51,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 09:30:51,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:51,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-11 09:30:51,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:51,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-11 09:30:51,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:51,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 09:30:51,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:51,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-11 09:30:51,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:51,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-11 09:30:51,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:51,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-11 09:30:51,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:51,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-11 09:30:51,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:51,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-11 09:30:51,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:51,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-10-11 09:30:51,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:51,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-11 09:30:51,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:51,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-10-11 09:30:51,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:51,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-10-11 09:30:51,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:51,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-10-11 09:30:51,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:51,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2024-10-11 09:30:51,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:51,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-10-11 09:30:51,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:51,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-10-11 09:30:51,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:51,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-10-11 09:30:51,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:51,639 INFO L134 CoverageAnalysis]: Checked inductivity of 2297 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-11 09:30:51,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:30:51,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361627522] [2024-10-11 09:30:51,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361627522] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:30:51,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:30:51,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 09:30:51,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371915569] [2024-10-11 09:30:51,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:30:51,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 09:30:51,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:30:51,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 09:30:51,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 09:30:51,642 INFO L87 Difference]: Start difference. First operand 240 states and 331 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2024-10-11 09:30:51,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:30:51,936 INFO L93 Difference]: Finished difference Result 361 states and 488 transitions. [2024-10-11 09:30:51,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 09:30:51,937 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 248 [2024-10-11 09:30:51,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:30:51,940 INFO L225 Difference]: With dead ends: 361 [2024-10-11 09:30:51,940 INFO L226 Difference]: Without dead ends: 273 [2024-10-11 09:30:51,940 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 09:30:51,941 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 141 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 09:30:51,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 232 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 09:30:51,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2024-10-11 09:30:51,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 270. [2024-10-11 09:30:51,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 210 states have (on average 1.2380952380952381) internal successors, (260), 211 states have internal predecessors, (260), 53 states have call successors, (53), 6 states have call predecessors, (53), 6 states have return successors, (53), 52 states have call predecessors, (53), 53 states have call successors, (53) [2024-10-11 09:30:51,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 366 transitions. [2024-10-11 09:30:51,974 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 366 transitions. Word has length 248 [2024-10-11 09:30:51,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:30:51,975 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 366 transitions. [2024-10-11 09:30:51,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2024-10-11 09:30:51,975 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 366 transitions. [2024-10-11 09:30:51,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2024-10-11 09:30:51,977 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:30:51,978 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-10-11 09:30:51,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 09:30:51,978 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:30:51,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:30:51,979 INFO L85 PathProgramCache]: Analyzing trace with hash -940155767, now seen corresponding path program 1 times [2024-10-11 09:30:51,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:30:51,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416212484] [2024-10-11 09:30:51,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:30:51,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:30:52,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:03,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:31:03,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:03,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:31:03,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:03,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:31:03,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:03,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:31:03,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:03,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:31:03,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:03,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:31:03,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:03,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:31:03,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:03,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:31:03,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:03,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:31:03,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:03,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:31:03,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:03,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:31:03,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:03,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 09:31:03,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:03,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:31:03,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:03,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 09:31:03,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:03,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:31:03,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:03,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:31:03,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:03,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 09:31:03,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:03,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 09:31:03,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:03,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 09:31:03,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:03,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 09:31:03,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:03,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 09:31:03,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:03,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 09:31:03,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:03,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 09:31:03,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:03,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-11 09:31:03,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:03,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 09:31:03,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:03,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 09:31:03,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:03,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 09:31:03,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:03,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-11 09:31:03,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:03,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 09:31:03,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:03,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-10-11 09:31:03,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:03,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-10-11 09:31:03,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:03,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2024-10-11 09:31:04,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:04,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2024-10-11 09:31:04,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:04,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-10-11 09:31:04,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:04,048 INFO L134 CoverageAnalysis]: Checked inductivity of 2299 backedges. 1 proven. 54 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-11 09:31:04,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:31:04,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416212484] [2024-10-11 09:31:04,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416212484] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 09:31:04,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124437816] [2024-10-11 09:31:04,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:31:04,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:31:04,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:31:04,051 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 09:31:04,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 09:31:04,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:04,217 INFO L255 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 09:31:04,230 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:31:04,514 INFO L134 CoverageAnalysis]: Checked inductivity of 2299 backedges. 773 proven. 18 refuted. 0 times theorem prover too weak. 1508 trivial. 0 not checked. [2024-10-11 09:31:04,515 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 09:31:04,879 INFO L134 CoverageAnalysis]: Checked inductivity of 2299 backedges. 119 proven. 18 refuted. 0 times theorem prover too weak. 2162 trivial. 0 not checked. [2024-10-11 09:31:04,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124437816] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 09:31:04,879 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 09:31:04,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 5, 5] total 21 [2024-10-11 09:31:04,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117076727] [2024-10-11 09:31:04,880 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 09:31:04,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-11 09:31:04,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:31:04,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-11 09:31:04,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2024-10-11 09:31:04,885 INFO L87 Difference]: Start difference. First operand 270 states and 366 transitions. Second operand has 21 states, 21 states have (on average 8.619047619047619) internal successors, (181), 21 states have internal predecessors, (181), 6 states have call successors, (63), 2 states have call predecessors, (63), 4 states have return successors, (65), 6 states have call predecessors, (65), 6 states have call successors, (65) [2024-10-11 09:31:09,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:31:09,332 INFO L93 Difference]: Finished difference Result 578 states and 754 transitions. [2024-10-11 09:31:09,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-11 09:31:09,333 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 8.619047619047619) internal successors, (181), 21 states have internal predecessors, (181), 6 states have call successors, (63), 2 states have call predecessors, (63), 4 states have return successors, (65), 6 states have call predecessors, (65), 6 states have call successors, (65) Word has length 249 [2024-10-11 09:31:09,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:31:09,337 INFO L225 Difference]: With dead ends: 578 [2024-10-11 09:31:09,337 INFO L226 Difference]: Without dead ends: 357 [2024-10-11 09:31:09,338 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 617 GetRequests, 569 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 448 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=451, Invalid=1805, Unknown=0, NotChecked=0, Total=2256 [2024-10-11 09:31:09,339 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 561 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 1720 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 571 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 1884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 1720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-11 09:31:09,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [571 Valid, 705 Invalid, 1884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 1720 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-11 09:31:09,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2024-10-11 09:31:09,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 269. [2024-10-11 09:31:09,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 206 states have (on average 1.2087378640776698) internal successors, (249), 207 states have internal predecessors, (249), 53 states have call successors, (53), 9 states have call predecessors, (53), 9 states have return successors, (53), 52 states have call predecessors, (53), 53 states have call successors, (53) [2024-10-11 09:31:09,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 355 transitions. [2024-10-11 09:31:09,380 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 355 transitions. Word has length 249 [2024-10-11 09:31:09,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:31:09,380 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 355 transitions. [2024-10-11 09:31:09,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 8.619047619047619) internal successors, (181), 21 states have internal predecessors, (181), 6 states have call successors, (63), 2 states have call predecessors, (63), 4 states have return successors, (65), 6 states have call predecessors, (65), 6 states have call successors, (65) [2024-10-11 09:31:09,381 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 355 transitions. [2024-10-11 09:31:09,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2024-10-11 09:31:09,383 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:31:09,383 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:31:09,403 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 09:31:09,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-11 09:31:09,584 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:31:09,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:31:09,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1153098363, now seen corresponding path program 1 times [2024-10-11 09:31:09,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:31:09,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028058535] [2024-10-11 09:31:09,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:31:09,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:31:09,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:09,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:31:09,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:09,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:31:09,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:09,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:31:09,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:09,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:31:09,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:09,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:31:09,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:09,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:31:09,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:09,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:31:09,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:09,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:31:09,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:09,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:31:09,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:09,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:31:09,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:09,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:31:09,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:09,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 09:31:09,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:09,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:31:09,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:09,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 09:31:09,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:09,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:31:09,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:09,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:31:09,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:09,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 09:31:09,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:09,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 09:31:09,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:09,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 09:31:09,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:09,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 09:31:09,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:09,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 09:31:09,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:09,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 09:31:09,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:09,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-11 09:31:09,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:09,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-11 09:31:09,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:09,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-11 09:31:09,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:09,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-11 09:31:09,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:09,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-11 09:31:09,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:09,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-10-11 09:31:09,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:09,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-10-11 09:31:09,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:09,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-10-11 09:31:09,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:09,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-10-11 09:31:09,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:09,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2024-10-11 09:31:09,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:09,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-10-11 09:31:09,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:09,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-10-11 09:31:09,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:09,826 INFO L134 CoverageAnalysis]: Checked inductivity of 2300 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 2258 trivial. 0 not checked. [2024-10-11 09:31:09,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:31:09,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028058535] [2024-10-11 09:31:09,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028058535] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:31:09,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:31:09,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 09:31:09,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974759839] [2024-10-11 09:31:09,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:31:09,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 09:31:09,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:31:09,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 09:31:09,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 09:31:09,828 INFO L87 Difference]: Start difference. First operand 269 states and 355 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 3 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) [2024-10-11 09:31:10,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:31:10,021 INFO L93 Difference]: Finished difference Result 497 states and 646 transitions. [2024-10-11 09:31:10,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 09:31:10,022 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 3 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) Word has length 253 [2024-10-11 09:31:10,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:31:10,024 INFO L225 Difference]: With dead ends: 497 [2024-10-11 09:31:10,024 INFO L226 Difference]: Without dead ends: 281 [2024-10-11 09:31:10,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 09:31:10,026 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 121 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 09:31:10,026 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 172 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 09:31:10,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-10-11 09:31:10,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2024-10-11 09:31:10,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 215 states have (on average 1.186046511627907) internal successors, (255), 216 states have internal predecessors, (255), 53 states have call successors, (53), 12 states have call predecessors, (53), 12 states have return successors, (53), 52 states have call predecessors, (53), 53 states have call successors, (53) [2024-10-11 09:31:10,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 361 transitions. [2024-10-11 09:31:10,073 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 361 transitions. Word has length 253 [2024-10-11 09:31:10,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:31:10,073 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 361 transitions. [2024-10-11 09:31:10,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 3 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) [2024-10-11 09:31:10,073 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 361 transitions. [2024-10-11 09:31:10,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2024-10-11 09:31:10,075 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:31:10,075 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:31:10,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 09:31:10,076 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:31:10,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:31:10,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1580371073, now seen corresponding path program 1 times [2024-10-11 09:31:10,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:31:10,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244572736] [2024-10-11 09:31:10,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:31:10,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:31:10,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat