./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../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 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-52.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 05:28:45,261 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 05:28:45,348 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 05:28:45,354 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 05:28:45,354 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 05:28:45,394 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 05:28:45,395 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 05:28:45,395 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 05:28:45,396 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 05:28:45,396 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 05:28:45,397 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 05:28:45,398 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 05:28:45,399 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 05:28:45,402 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 05:28:45,402 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 05:28:45,403 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 05:28:45,403 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 05:28:45,403 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 05:28:45,403 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 05:28:45,404 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 05:28:45,404 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 05:28:45,408 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 05:28:45,408 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 05:28:45,409 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 05:28:45,409 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 05:28:45,409 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 05:28:45,409 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 05:28:45,410 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 05:28:45,410 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 05:28:45,410 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 05:28:45,410 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 05:28:45,411 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 05:28:45,411 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 05:28:45,411 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 05:28:45,412 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 05:28:45,412 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 05:28:45,413 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 05:28:45,413 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 05:28:45,414 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 05:28:45,414 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 05:28:45,414 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 05:28:45,415 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 05:28:45,416 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/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-11-10 05:28:45,665 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 05:28:45,690 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 05:28:45,694 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 05:28:45,696 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 05:28:45,696 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 05:28:45,697 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-52.i [2024-11-10 05:28:47,248 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 05:28:47,457 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 05:28:47,458 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-52.i [2024-11-10 05:28:47,472 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/283518d78/21c3195f27a04ace8c0e105968217311/FLAG6ede7a753 [2024-11-10 05:28:47,488 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/283518d78/21c3195f27a04ace8c0e105968217311 [2024-11-10 05:28:47,492 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 05:28:47,493 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 05:28:47,495 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 05:28:47,495 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 05:28:47,501 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 05:28:47,501 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:28:47" (1/1) ... [2024-11-10 05:28:47,502 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b41d369 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:28:47, skipping insertion in model container [2024-11-10 05:28:47,503 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:28:47" (1/1) ... [2024-11-10 05:28:47,537 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 05:28:47,738 WARN L250 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-11-10 05:28:47,810 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 05:28:47,824 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 05:28:47,839 WARN L250 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-11-10 05:28:47,869 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 05:28:47,894 INFO L204 MainTranslator]: Completed translation [2024-11-10 05:28:47,895 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:28:47 WrapperNode [2024-11-10 05:28:47,895 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 05:28:47,896 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 05:28:47,896 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 05:28:47,896 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 05:28:47,902 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:28:47" (1/1) ... [2024-11-10 05:28:47,911 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:28:47" (1/1) ... [2024-11-10 05:28:47,947 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 192 [2024-11-10 05:28:47,948 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 05:28:47,948 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 05:28:47,948 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 05:28:47,949 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 05:28:47,961 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:28:47" (1/1) ... [2024-11-10 05:28:47,962 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:28:47" (1/1) ... [2024-11-10 05:28:47,967 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:28:47" (1/1) ... [2024-11-10 05:28:47,996 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-11-10 05:28:47,997 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:28:47" (1/1) ... [2024-11-10 05:28:47,997 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:28:47" (1/1) ... [2024-11-10 05:28:48,008 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:28:47" (1/1) ... [2024-11-10 05:28:48,009 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:28:47" (1/1) ... [2024-11-10 05:28:48,012 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:28:47" (1/1) ... [2024-11-10 05:28:48,014 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:28:47" (1/1) ... [2024-11-10 05:28:48,018 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 05:28:48,019 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 05:28:48,019 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 05:28:48,019 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 05:28:48,020 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:28:47" (1/1) ... [2024-11-10 05:28:48,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 05:28:48,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 05:28:48,060 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 05:28:48,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 05:28:48,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 05:28:48,109 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 05:28:48,109 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 05:28:48,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 05:28:48,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 05:28:48,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 05:28:48,190 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 05:28:48,192 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 05:28:48,627 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-10 05:28:48,628 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 05:28:48,656 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 05:28:48,657 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 05:28:48,657 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:28:48 BoogieIcfgContainer [2024-11-10 05:28:48,657 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 05:28:48,660 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 05:28:48,660 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 05:28:48,663 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 05:28:48,663 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 05:28:47" (1/3) ... [2024-11-10 05:28:48,664 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2128cf39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:28:48, skipping insertion in model container [2024-11-10 05:28:48,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:28:47" (2/3) ... [2024-11-10 05:28:48,665 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2128cf39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:28:48, skipping insertion in model container [2024-11-10 05:28:48,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:28:48" (3/3) ... [2024-11-10 05:28:48,666 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-52.i [2024-11-10 05:28:48,682 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 05:28:48,682 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 05:28:48,738 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 05:28:48,743 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;@72455675, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 05:28:48,743 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 05:28:48,747 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 63 states have (on average 1.4603174603174602) internal successors, (92), 64 states have internal predecessors, (92), 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-11-10 05:28:48,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-10 05:28:48,756 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:28:48,757 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, 1] [2024-11-10 05:28:48,758 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:28:48,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:28:48,762 INFO L85 PathProgramCache]: Analyzing trace with hash -701558521, now seen corresponding path program 1 times [2024-11-10 05:28:48,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:28:48,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663405213] [2024-11-10 05:28:48,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:28:48,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:28:48,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:49,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:28:49,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:49,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:28:49,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:49,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:28:49,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:49,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:28:49,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:49,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:28:49,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:49,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:28:49,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:49,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:28:49,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:49,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 05:28:49,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:49,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 05:28:49,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:49,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 05:28:49,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:49,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 05:28:49,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:49,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 05:28:49,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:49,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 05:28:49,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:49,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 05:28:49,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:49,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 05:28:49,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:49,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 05:28:49,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:49,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 05:28:49,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:49,214 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-10 05:28:49,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:28:49,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663405213] [2024-11-10 05:28:49,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663405213] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:28:49,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:28:49,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 05:28:49,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727730480] [2024-11-10 05:28:49,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:28:49,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 05:28:49,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:28:49,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 05:28:49,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 05:28:49,245 INFO L87 Difference]: Start difference. First operand has 83 states, 63 states have (on average 1.4603174603174602) internal successors, (92), 64 states have internal predecessors, (92), 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 22.5) internal successors, (45), 2 states have internal predecessors, (45), 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-11-10 05:28:49,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:28:49,278 INFO L93 Difference]: Finished difference Result 158 states and 262 transitions. [2024-11-10 05:28:49,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 05:28:49,281 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 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 127 [2024-11-10 05:28:49,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:28:49,292 INFO L225 Difference]: With dead ends: 158 [2024-11-10 05:28:49,292 INFO L226 Difference]: Without dead ends: 78 [2024-11-10 05:28:49,296 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-11-10 05:28:49,300 INFO L432 NwaCegarLoop]: 115 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, 115 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-11-10 05:28:49,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 05:28:49,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-10 05:28:49,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-10 05:28:49,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 59 states have (on average 1.423728813559322) internal successors, (84), 59 states have internal predecessors, (84), 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-11-10 05:28:49,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 118 transitions. [2024-11-10 05:28:49,349 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 118 transitions. Word has length 127 [2024-11-10 05:28:49,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:28:49,350 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 118 transitions. [2024-11-10 05:28:49,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 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-11-10 05:28:49,350 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 118 transitions. [2024-11-10 05:28:49,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-10 05:28:49,355 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:28:49,355 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, 1] [2024-11-10 05:28:49,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 05:28:49,356 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:28:49,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:28:49,357 INFO L85 PathProgramCache]: Analyzing trace with hash 137269636, now seen corresponding path program 1 times [2024-11-10 05:28:49,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:28:49,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782856703] [2024-11-10 05:28:49,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:28:49,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:28:49,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:49,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:28:49,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:49,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:28:49,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:49,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:28:49,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:49,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:28:49,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:49,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:28:49,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:49,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:28:49,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:49,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:28:49,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:49,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 05:28:49,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:49,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 05:28:49,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:49,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 05:28:49,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:49,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 05:28:49,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:49,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 05:28:49,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:49,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 05:28:49,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:49,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 05:28:49,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:49,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 05:28:49,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:49,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 05:28:49,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:49,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 05:28:49,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:49,760 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-10 05:28:49,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:28:49,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782856703] [2024-11-10 05:28:49,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782856703] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:28:49,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:28:49,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 05:28:49,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156566796] [2024-11-10 05:28:49,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:28:49,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 05:28:49,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:28:49,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 05:28:49,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 05:28:49,768 INFO L87 Difference]: Start difference. First operand 78 states and 118 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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-11-10 05:28:49,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:28:49,891 INFO L93 Difference]: Finished difference Result 190 states and 290 transitions. [2024-11-10 05:28:49,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 05:28:49,894 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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 127 [2024-11-10 05:28:49,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:28:49,897 INFO L225 Difference]: With dead ends: 190 [2024-11-10 05:28:49,898 INFO L226 Difference]: Without dead ends: 115 [2024-11-10 05:28:49,899 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-11-10 05:28:49,901 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 43 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 05:28:49,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 195 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 05:28:49,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-10 05:28:49,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 99. [2024-11-10 05:28:49,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 80 states have (on average 1.5) internal successors, (120), 80 states have internal predecessors, (120), 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-11-10 05:28:49,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 154 transitions. [2024-11-10 05:28:49,922 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 154 transitions. Word has length 127 [2024-11-10 05:28:49,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:28:49,925 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 154 transitions. [2024-11-10 05:28:49,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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-11-10 05:28:49,926 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 154 transitions. [2024-11-10 05:28:49,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-10 05:28:49,928 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:28:49,928 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, 1, 1] [2024-11-10 05:28:49,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 05:28:49,929 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:28:49,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:28:49,929 INFO L85 PathProgramCache]: Analyzing trace with hash -120994616, now seen corresponding path program 1 times [2024-11-10 05:28:49,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:28:49,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117260389] [2024-11-10 05:28:49,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:28:49,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:28:50,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:50,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:28:50,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:50,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:28:50,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:50,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:28:50,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:50,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:28:50,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:50,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:28:50,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:50,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:28:50,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:50,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:28:50,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:50,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 05:28:50,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:50,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 05:28:50,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:50,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 05:28:50,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:50,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 05:28:50,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:50,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 05:28:50,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:50,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 05:28:50,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:50,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 05:28:50,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:50,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 05:28:50,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:50,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 05:28:50,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:50,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 05:28:50,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:50,496 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-10 05:28:50,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:28:50,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117260389] [2024-11-10 05:28:50,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117260389] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:28:50,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:28:50,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 05:28:50,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382747732] [2024-11-10 05:28:50,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:28:50,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 05:28:50,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:28:50,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 05:28:50,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 05:28:50,502 INFO L87 Difference]: Start difference. First operand 99 states and 154 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 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-11-10 05:28:50,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:28:50,881 INFO L93 Difference]: Finished difference Result 331 states and 511 transitions. [2024-11-10 05:28:50,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 05:28:50,882 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 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 128 [2024-11-10 05:28:50,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:28:50,889 INFO L225 Difference]: With dead ends: 331 [2024-11-10 05:28:50,890 INFO L226 Difference]: Without dead ends: 235 [2024-11-10 05:28:50,891 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-11-10 05:28:50,892 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 273 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 05:28:50,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 538 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 05:28:50,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-11-10 05:28:50,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 144. [2024-11-10 05:28:50,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 125 states have (on average 1.552) internal successors, (194), 125 states have internal predecessors, (194), 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-11-10 05:28:50,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 228 transitions. [2024-11-10 05:28:50,909 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 228 transitions. Word has length 128 [2024-11-10 05:28:50,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:28:50,910 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 228 transitions. [2024-11-10 05:28:50,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 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-11-10 05:28:50,910 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 228 transitions. [2024-11-10 05:28:50,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-10 05:28:50,913 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:28:50,913 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, 1, 1] [2024-11-10 05:28:50,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 05:28:50,914 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:28:50,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:28:50,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1118066969, now seen corresponding path program 1 times [2024-11-10 05:28:50,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:28:50,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209027201] [2024-11-10 05:28:50,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:28:50,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:28:50,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:51,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:28:51,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:51,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:28:51,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:51,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:28:51,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:51,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:28:51,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:51,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:28:51,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:51,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:28:51,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:51,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:28:51,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:51,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 05:28:51,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:51,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 05:28:51,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:51,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 05:28:51,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:51,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 05:28:51,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:51,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 05:28:51,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:51,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 05:28:51,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:51,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 05:28:51,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:51,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 05:28:51,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:51,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 05:28:51,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:51,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 05:28:51,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:51,194 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-10 05:28:51,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:28:51,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209027201] [2024-11-10 05:28:51,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209027201] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:28:51,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:28:51,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 05:28:51,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715576735] [2024-11-10 05:28:51,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:28:51,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 05:28:51,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:28:51,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 05:28:51,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 05:28:51,200 INFO L87 Difference]: Start difference. First operand 144 states and 228 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-11-10 05:28:51,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:28:51,461 INFO L93 Difference]: Finished difference Result 335 states and 522 transitions. [2024-11-10 05:28:51,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 05:28:51,461 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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 128 [2024-11-10 05:28:51,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:28:51,463 INFO L225 Difference]: With dead ends: 335 [2024-11-10 05:28:51,464 INFO L226 Difference]: Without dead ends: 194 [2024-11-10 05:28:51,464 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-11-10 05:28:51,465 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 190 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 05:28:51,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 505 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 05:28:51,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-11-10 05:28:51,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 144. [2024-11-10 05:28:51,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 125 states have (on average 1.544) internal successors, (193), 125 states have internal predecessors, (193), 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-11-10 05:28:51,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 227 transitions. [2024-11-10 05:28:51,477 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 227 transitions. Word has length 128 [2024-11-10 05:28:51,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:28:51,477 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 227 transitions. [2024-11-10 05:28:51,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-11-10 05:28:51,478 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 227 transitions. [2024-11-10 05:28:51,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-10 05:28:51,479 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:28:51,479 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, 1, 1] [2024-11-10 05:28:51,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 05:28:51,480 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:28:51,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:28:51,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1335356103, now seen corresponding path program 1 times [2024-11-10 05:28:51,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:28:51,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225800277] [2024-11-10 05:28:51,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:28:51,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:28:51,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:52,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:28:52,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:52,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:28:52,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:52,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:28:52,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:52,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:28:52,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:52,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:28:52,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:52,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:28:52,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:52,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:28:52,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:52,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 05:28:52,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:52,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 05:28:52,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:52,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 05:28:52,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:52,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 05:28:52,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:52,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 05:28:52,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:52,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 05:28:52,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:52,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 05:28:52,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:52,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 05:28:52,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:52,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 05:28:52,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:52,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 05:28:52,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:28:52,342 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-10 05:28:52,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:28:52,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225800277] [2024-11-10 05:28:52,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225800277] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:28:52,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:28:52,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 05:28:52,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737264491] [2024-11-10 05:28:52,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:28:52,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 05:28:52,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:28:52,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 05:28:52,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 05:28:52,347 INFO L87 Difference]: Start difference. First operand 144 states and 227 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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-11-10 05:28:52,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:28:52,596 INFO L93 Difference]: Finished difference Result 463 states and 729 transitions. [2024-11-10 05:28:52,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 05:28:52,596 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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 128 [2024-11-10 05:28:52,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:28:52,599 INFO L225 Difference]: With dead ends: 463 [2024-11-10 05:28:52,602 INFO L226 Difference]: Without dead ends: 322 [2024-11-10 05:28:52,603 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-11-10 05:28:52,604 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 158 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 05:28:52,604 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 314 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 05:28:52,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2024-11-10 05:28:52,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 282. [2024-11-10 05:28:52,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 245 states have (on average 1.5387755102040817) internal successors, (377), 245 states have internal predecessors, (377), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-10 05:28:52,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 445 transitions. [2024-11-10 05:28:52,630 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 445 transitions. Word has length 128 [2024-11-10 05:28:52,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:28:52,631 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 445 transitions. [2024-11-10 05:28:52,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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-11-10 05:28:52,632 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 445 transitions. [2024-11-10 05:28:52,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-10 05:28:52,633 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:28:52,633 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, 1, 1, 1, 1] [2024-11-10 05:28:52,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 05:28:52,634 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:28:52,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:28:52,634 INFO L85 PathProgramCache]: Analyzing trace with hash 736575518, now seen corresponding path program 1 times [2024-11-10 05:28:52,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:28:52,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194900752] [2024-11-10 05:28:52,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:28:52,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:28:52,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:05,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:29:05,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:05,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:29:05,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:05,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:29:05,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:05,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:29:05,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:05,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:29:05,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:05,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:29:05,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:05,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:29:05,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:05,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 05:29:05,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:06,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 05:29:06,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:06,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 05:29:06,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:06,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 05:29:06,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:06,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 05:29:06,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:06,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 05:29:06,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:06,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 05:29:06,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:06,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 05:29:06,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:06,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 05:29:06,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:06,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 05:29:06,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:06,375 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-10 05:29:06,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:29:06,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194900752] [2024-11-10 05:29:06,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194900752] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:29:06,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:29:06,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-10 05:29:06,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269674674] [2024-11-10 05:29:06,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:29:06,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-10 05:29:06,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:29:06,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-10 05:29:06,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2024-11-10 05:29:06,382 INFO L87 Difference]: Start difference. First operand 282 states and 445 transitions. Second operand has 18 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 18 states have internal predecessors, (48), 5 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) [2024-11-10 05:29:09,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:29:09,144 INFO L93 Difference]: Finished difference Result 869 states and 1336 transitions. [2024-11-10 05:29:09,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 05:29:09,145 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 18 states have internal predecessors, (48), 5 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) Word has length 130 [2024-11-10 05:29:09,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:29:09,150 INFO L225 Difference]: With dead ends: 869 [2024-11-10 05:29:09,150 INFO L226 Difference]: Without dead ends: 590 [2024-11-10 05:29:09,152 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=156, Invalid=494, Unknown=0, NotChecked=0, Total=650 [2024-11-10 05:29:09,154 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 606 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 1150 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 606 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 1280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 1150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-10 05:29:09,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [606 Valid, 763 Invalid, 1280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 1150 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-10 05:29:09,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2024-11-10 05:29:09,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 347. [2024-11-10 05:29:09,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 292 states have (on average 1.4965753424657535) internal successors, (437), 292 states have internal predecessors, (437), 51 states have call successors, (51), 3 states have call predecessors, (51), 3 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2024-11-10 05:29:09,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 539 transitions. [2024-11-10 05:29:09,208 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 539 transitions. Word has length 130 [2024-11-10 05:29:09,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:29:09,209 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 539 transitions. [2024-11-10 05:29:09,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 18 states have internal predecessors, (48), 5 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) [2024-11-10 05:29:09,212 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 539 transitions. [2024-11-10 05:29:09,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-10 05:29:09,214 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:29:09,214 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, 1, 1, 1, 1] [2024-11-10 05:29:09,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 05:29:09,214 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:29:09,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:29:09,215 INFO L85 PathProgramCache]: Analyzing trace with hash -260496835, now seen corresponding path program 1 times [2024-11-10 05:29:09,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:29:09,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538072760] [2024-11-10 05:29:09,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:29:09,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:29:09,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:09,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:29:09,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:09,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:29:09,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:09,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:29:09,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:09,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:29:09,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:09,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:29:09,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:09,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:29:09,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:09,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:29:09,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:09,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 05:29:09,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:09,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 05:29:09,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:09,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 05:29:09,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:09,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 05:29:09,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:09,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 05:29:09,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:09,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 05:29:09,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:09,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 05:29:09,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:09,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 05:29:09,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:09,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 05:29:09,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:09,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 05:29:09,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:09,452 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-10 05:29:09,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:29:09,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538072760] [2024-11-10 05:29:09,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538072760] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:29:09,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:29:09,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 05:29:09,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134886216] [2024-11-10 05:29:09,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:29:09,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 05:29:09,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:29:09,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 05:29:09,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 05:29:09,455 INFO L87 Difference]: Start difference. First operand 347 states and 539 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-11-10 05:29:09,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:29:09,790 INFO L93 Difference]: Finished difference Result 862 states and 1327 transitions. [2024-11-10 05:29:09,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 05:29:09,791 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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 130 [2024-11-10 05:29:09,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:29:09,796 INFO L225 Difference]: With dead ends: 862 [2024-11-10 05:29:09,796 INFO L226 Difference]: Without dead ends: 583 [2024-11-10 05:29:09,797 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-11-10 05:29:09,799 INFO L432 NwaCegarLoop]: 274 mSDtfsCounter, 207 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 05:29:09,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 583 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 05:29:09,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2024-11-10 05:29:09,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 365. [2024-11-10 05:29:09,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 310 states have (on average 1.5129032258064516) internal successors, (469), 310 states have internal predecessors, (469), 51 states have call successors, (51), 3 states have call predecessors, (51), 3 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2024-11-10 05:29:09,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 571 transitions. [2024-11-10 05:29:09,835 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 571 transitions. Word has length 130 [2024-11-10 05:29:09,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:29:09,836 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 571 transitions. [2024-11-10 05:29:09,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-11-10 05:29:09,836 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 571 transitions. [2024-11-10 05:29:09,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-10 05:29:09,838 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:29:09,839 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, 1, 1, 1, 1] [2024-11-10 05:29:09,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 05:29:09,839 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:29:09,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:29:09,839 INFO L85 PathProgramCache]: Analyzing trace with hash -26673504, now seen corresponding path program 1 times [2024-11-10 05:29:09,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:29:09,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846442153] [2024-11-10 05:29:09,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:29:09,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:29:09,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:09,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:29:09,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:09,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:29:09,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:09,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:29:09,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:09,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:29:09,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:09,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:29:09,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:09,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:29:09,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:09,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:29:09,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:09,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 05:29:09,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:09,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 05:29:09,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:09,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 05:29:09,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:09,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 05:29:09,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:09,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 05:29:09,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:09,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 05:29:09,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:09,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 05:29:09,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:09,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 05:29:09,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:09,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 05:29:09,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:09,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 05:29:09,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:09,987 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-10 05:29:09,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:29:09,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846442153] [2024-11-10 05:29:09,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846442153] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:29:09,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:29:09,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 05:29:09,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426361153] [2024-11-10 05:29:09,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:29:09,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 05:29:09,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:29:09,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 05:29:09,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 05:29:09,990 INFO L87 Difference]: Start difference. First operand 365 states and 571 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-11-10 05:29:10,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:29:10,123 INFO L93 Difference]: Finished difference Result 560 states and 871 transitions. [2024-11-10 05:29:10,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 05:29:10,124 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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 130 [2024-11-10 05:29:10,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:29:10,126 INFO L225 Difference]: With dead ends: 560 [2024-11-10 05:29:10,126 INFO L226 Difference]: Without dead ends: 263 [2024-11-10 05:29:10,128 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-11-10 05:29:10,130 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 143 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 05:29:10,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 152 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 05:29:10,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-11-10 05:29:10,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2024-11-10 05:29:10,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 208 states have (on average 1.4038461538461537) internal successors, (292), 208 states have internal predecessors, (292), 51 states have call successors, (51), 3 states have call predecessors, (51), 3 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2024-11-10 05:29:10,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 394 transitions. [2024-11-10 05:29:10,156 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 394 transitions. Word has length 130 [2024-11-10 05:29:10,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:29:10,159 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 394 transitions. [2024-11-10 05:29:10,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-11-10 05:29:10,159 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 394 transitions. [2024-11-10 05:29:10,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-10 05:29:10,161 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:29:10,161 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, 1, 1, 1, 1, 1] [2024-11-10 05:29:10,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 05:29:10,161 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:29:10,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:29:10,162 INFO L85 PathProgramCache]: Analyzing trace with hash -558327245, now seen corresponding path program 1 times [2024-11-10 05:29:10,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:29:10,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015044913] [2024-11-10 05:29:10,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:29:10,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:29:10,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:12,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:29:12,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:12,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:29:12,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:12,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:29:12,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:12,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:29:12,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:12,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:29:12,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:12,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:29:12,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:12,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:29:12,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:12,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 05:29:12,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:12,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 05:29:12,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:12,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 05:29:12,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:12,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 05:29:12,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:12,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 05:29:12,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:12,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 05:29:12,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:12,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 05:29:12,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:12,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 05:29:12,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:12,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 05:29:12,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:12,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 05:29:12,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:29:12,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-11-10 05:29:12,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:29:12,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015044913] [2024-11-10 05:29:12,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015044913] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:29:12,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:29:12,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 05:29:12,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660731833] [2024-11-10 05:29:12,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:29:12,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 05:29:12,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:29:12,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 05:29:12,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-10 05:29:12,660 INFO L87 Difference]: Start difference. First operand 263 states and 394 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 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-11-10 05:29:13,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:29:13,339 INFO L93 Difference]: Finished difference Result 503 states and 735 transitions. [2024-11-10 05:29:13,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 05:29:13,340 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 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 131 [2024-11-10 05:29:13,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:29:13,342 INFO L225 Difference]: With dead ends: 503 [2024-11-10 05:29:13,343 INFO L226 Difference]: Without dead ends: 290 [2024-11-10 05:29:13,344 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-11-10 05:29:13,344 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 343 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 05:29:13,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 284 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 05:29:13,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-11-10 05:29:13,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 271. [2024-11-10 05:29:13,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 201 states have (on average 1.2487562189054726) internal successors, (251), 204 states have internal predecessors, (251), 63 states have call successors, (63), 6 states have call predecessors, (63), 6 states have return successors, (63), 60 states have call predecessors, (63), 63 states have call successors, (63) [2024-11-10 05:29:13,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 377 transitions. [2024-11-10 05:29:13,378 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 377 transitions. Word has length 131 [2024-11-10 05:29:13,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:29:13,381 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 377 transitions. [2024-11-10 05:29:13,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 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-11-10 05:29:13,381 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 377 transitions. [2024-11-10 05:29:13,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-10 05:29:13,383 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:29:13,383 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, 1, 1, 1, 1, 1, 1] [2024-11-10 05:29:13,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 05:29:13,383 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:29:13,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:29:13,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1454453930, now seen corresponding path program 1 times [2024-11-10 05:29:13,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:29:13,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221117713] [2024-11-10 05:29:13,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:29:13,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:29:13,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat