./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w128_d8_e0.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w128_d8_e0.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash cc215c1310f8b4d8a3ef1501261e91ba08e9c5718658396972a4e0020f5cf43f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 05:56:01,933 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 05:56:01,986 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-11 05:56:01,989 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 05:56:01,989 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 05:56:02,005 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 05:56:02,005 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 05:56:02,006 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 05:56:02,006 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 05:56:02,006 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 05:56:02,007 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 05:56:02,007 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 05:56:02,007 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 05:56:02,008 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 05:56:02,008 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 05:56:02,008 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 05:56:02,009 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 05:56:02,009 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 05:56:02,009 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 05:56:02,009 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 05:56:02,010 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 05:56:02,010 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 05:56:02,011 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 05:56:02,011 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 05:56:02,011 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 05:56:02,011 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 05:56:02,012 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 05:56:02,012 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 05:56:02,012 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 05:56:02,013 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 05:56:02,013 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 05:56:02,013 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 05:56:02,013 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 05:56:02,014 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 05:56:02,014 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 05:56:02,014 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 05:56:02,015 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 05:56:02,015 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 05:56:02,015 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 05:56:02,015 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cc215c1310f8b4d8a3ef1501261e91ba08e9c5718658396972a4e0020f5cf43f [2024-10-11 05:56:02,222 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 05:56:02,240 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 05:56:02,243 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 05:56:02,244 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 05:56:02,245 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 05:56:02,246 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w128_d8_e0.c [2024-10-11 05:56:03,674 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 05:56:03,866 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 05:56:03,867 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w128_d8_e0.c [2024-10-11 05:56:03,886 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f6004dab8/d1e1d01c88b34ca19696ebe7cdd1e844/FLAGb9e67d0f1 [2024-10-11 05:56:03,898 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f6004dab8/d1e1d01c88b34ca19696ebe7cdd1e844 [2024-10-11 05:56:03,901 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 05:56:03,902 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 05:56:03,904 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 05:56:03,905 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 05:56:03,913 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 05:56:03,914 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:56:03" (1/1) ... [2024-10-11 05:56:03,915 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d3a1c98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:03, skipping insertion in model container [2024-10-11 05:56:03,917 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:56:03" (1/1) ... [2024-10-11 05:56:03,954 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 05:56:04,110 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w128_d8_e0.c[1334,1347] [2024-10-11 05:56:04,339 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 05:56:04,351 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 05:56:04,360 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w128_d8_e0.c[1334,1347] [2024-10-11 05:56:04,432 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 05:56:04,444 INFO L204 MainTranslator]: Completed translation [2024-10-11 05:56:04,445 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:04 WrapperNode [2024-10-11 05:56:04,445 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 05:56:04,446 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 05:56:04,446 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 05:56:04,446 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 05:56:04,452 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:04" (1/1) ... [2024-10-11 05:56:04,483 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:04" (1/1) ... [2024-10-11 05:56:04,612 INFO L138 Inliner]: procedures = 18, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1383 [2024-10-11 05:56:04,613 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 05:56:04,614 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 05:56:04,614 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 05:56:04,614 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 05:56:04,624 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:04" (1/1) ... [2024-10-11 05:56:04,624 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:04" (1/1) ... [2024-10-11 05:56:04,660 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:04" (1/1) ... [2024-10-11 05:56:04,707 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 05:56:04,707 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:04" (1/1) ... [2024-10-11 05:56:04,707 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:04" (1/1) ... [2024-10-11 05:56:04,742 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:04" (1/1) ... [2024-10-11 05:56:04,753 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:04" (1/1) ... [2024-10-11 05:56:04,768 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:04" (1/1) ... [2024-10-11 05:56:04,777 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:04" (1/1) ... [2024-10-11 05:56:04,795 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 05:56:04,796 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 05:56:04,796 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 05:56:04,796 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 05:56:04,797 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:04" (1/1) ... [2024-10-11 05:56:04,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 05:56:04,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:56:04,827 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 05:56:04,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 05:56:04,866 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 05:56:04,867 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 05:56:04,867 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 05:56:04,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 05:56:04,867 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 05:56:04,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 05:56:05,084 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 05:56:05,086 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 05:56:06,604 INFO L? ?]: Removed 754 outVars from TransFormulas that were not future-live. [2024-10-11 05:56:06,605 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 05:56:06,645 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 05:56:06,645 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 05:56:06,645 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:56:06 BoogieIcfgContainer [2024-10-11 05:56:06,646 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 05:56:06,647 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 05:56:06,648 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 05:56:06,652 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 05:56:06,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:56:03" (1/3) ... [2024-10-11 05:56:06,653 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bb4313 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:56:06, skipping insertion in model container [2024-10-11 05:56:06,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:56:04" (2/3) ... [2024-10-11 05:56:06,654 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bb4313 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:56:06, skipping insertion in model container [2024-10-11 05:56:06,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:56:06" (3/3) ... [2024-10-11 05:56:06,655 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.circular_pointer_top_w128_d8_e0.c [2024-10-11 05:56:06,671 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 05:56:06,671 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 05:56:06,750 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 05:56:06,757 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;@3db2a092, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 05:56:06,757 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 05:56:06,765 INFO L276 IsEmpty]: Start isEmpty. Operand has 389 states, 383 states have (on average 1.4960835509138382) internal successors, (573), 384 states have internal predecessors, (573), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:56:06,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-11 05:56:06,785 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:06,786 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:56:06,786 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:06,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:06,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1358744025, now seen corresponding path program 1 times [2024-10-11 05:56:06,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:06,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096695196] [2024-10-11 05:56:06,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:06,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:07,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:07,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:56:07,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:07,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 05:56:07,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:07,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 05:56:07,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:07,243 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:07,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:07,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096695196] [2024-10-11 05:56:07,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096695196] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:07,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:07,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 05:56:07,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460297901] [2024-10-11 05:56:07,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:07,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 05:56:07,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:07,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 05:56:07,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 05:56:07,274 INFO L87 Difference]: Start difference. First operand has 389 states, 383 states have (on average 1.4960835509138382) internal successors, (573), 384 states have internal predecessors, (573), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 52.0) internal successors, (104), 2 states have internal predecessors, (104), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 05:56:07,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:07,330 INFO L93 Difference]: Finished difference Result 708 states and 1058 transitions. [2024-10-11 05:56:07,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 05:56:07,333 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 52.0) internal successors, (104), 2 states have internal predecessors, (104), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 116 [2024-10-11 05:56:07,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:07,346 INFO L225 Difference]: With dead ends: 708 [2024-10-11 05:56:07,346 INFO L226 Difference]: Without dead ends: 388 [2024-10-11 05:56:07,350 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 05:56:07,354 INFO L432 NwaCegarLoop]: 575 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:07,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 575 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:56:07,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2024-10-11 05:56:07,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 388. [2024-10-11 05:56:07,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 383 states have (on average 1.4882506527415145) internal successors, (570), 383 states have internal predecessors, (570), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:56:07,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 576 transitions. [2024-10-11 05:56:07,420 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 576 transitions. Word has length 116 [2024-10-11 05:56:07,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:07,422 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 576 transitions. [2024-10-11 05:56:07,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 52.0) internal successors, (104), 2 states have internal predecessors, (104), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 05:56:07,423 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 576 transitions. [2024-10-11 05:56:07,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-11 05:56:07,426 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:07,427 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:56:07,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 05:56:07,427 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:07,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:07,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1080158561, now seen corresponding path program 1 times [2024-10-11 05:56:07,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:07,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5856762] [2024-10-11 05:56:07,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:07,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:07,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:08,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:56:08,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:08,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 05:56:08,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:08,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 05:56:08,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:08,303 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:08,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:08,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5856762] [2024-10-11 05:56:08,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5856762] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:08,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:08,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:56:08,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892268588] [2024-10-11 05:56:08,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:08,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:56:08,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:08,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:56:08,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:56:08,313 INFO L87 Difference]: Start difference. First operand 388 states and 576 transitions. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:08,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:08,358 INFO L93 Difference]: Finished difference Result 392 states and 580 transitions. [2024-10-11 05:56:08,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:56:08,359 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 116 [2024-10-11 05:56:08,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:08,362 INFO L225 Difference]: With dead ends: 392 [2024-10-11 05:56:08,363 INFO L226 Difference]: Without dead ends: 390 [2024-10-11 05:56:08,363 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:56:08,365 INFO L432 NwaCegarLoop]: 573 mSDtfsCounter, 0 mSDsluCounter, 1141 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1714 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:08,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1714 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:56:08,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2024-10-11 05:56:08,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 390. [2024-10-11 05:56:08,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 385 states have (on average 1.4857142857142858) internal successors, (572), 385 states have internal predecessors, (572), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:56:08,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 578 transitions. [2024-10-11 05:56:08,395 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 578 transitions. Word has length 116 [2024-10-11 05:56:08,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:08,397 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 578 transitions. [2024-10-11 05:56:08,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:08,397 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 578 transitions. [2024-10-11 05:56:08,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-11 05:56:08,402 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:08,402 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:56:08,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 05:56:08,402 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:08,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:08,403 INFO L85 PathProgramCache]: Analyzing trace with hash -873127207, now seen corresponding path program 1 times [2024-10-11 05:56:08,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:08,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552789706] [2024-10-11 05:56:08,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:08,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:08,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:08,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:56:08,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:08,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 05:56:08,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:08,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 05:56:08,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:08,803 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:08,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:08,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552789706] [2024-10-11 05:56:08,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552789706] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:08,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:08,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:56:08,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251548950] [2024-10-11 05:56:08,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:08,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:56:08,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:08,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:56:08,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:56:08,810 INFO L87 Difference]: Start difference. First operand 390 states and 578 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:09,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:09,179 INFO L93 Difference]: Finished difference Result 970 states and 1440 transitions. [2024-10-11 05:56:09,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 05:56:09,182 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 117 [2024-10-11 05:56:09,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:09,184 INFO L225 Difference]: With dead ends: 970 [2024-10-11 05:56:09,184 INFO L226 Difference]: Without dead ends: 390 [2024-10-11 05:56:09,188 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:56:09,189 INFO L432 NwaCegarLoop]: 627 mSDtfsCounter, 1090 mSDsluCounter, 1055 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1090 SdHoareTripleChecker+Valid, 1682 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:09,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1090 Valid, 1682 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 05:56:09,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2024-10-11 05:56:09,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 390. [2024-10-11 05:56:09,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 385 states have (on average 1.483116883116883) internal successors, (571), 385 states have internal predecessors, (571), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:56:09,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 577 transitions. [2024-10-11 05:56:09,206 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 577 transitions. Word has length 117 [2024-10-11 05:56:09,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:09,206 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 577 transitions. [2024-10-11 05:56:09,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:09,208 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 577 transitions. [2024-10-11 05:56:09,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-11 05:56:09,211 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:09,212 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:56:09,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 05:56:09,212 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:09,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:09,213 INFO L85 PathProgramCache]: Analyzing trace with hash 52997019, now seen corresponding path program 1 times [2024-10-11 05:56:09,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:09,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044368999] [2024-10-11 05:56:09,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:09,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:09,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:09,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:56:09,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:09,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 05:56:09,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:09,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 05:56:09,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:09,660 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:09,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:09,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044368999] [2024-10-11 05:56:09,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044368999] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:09,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:09,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:56:09,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452424601] [2024-10-11 05:56:09,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:09,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:56:09,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:09,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:56:09,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:56:09,664 INFO L87 Difference]: Start difference. First operand 390 states and 577 transitions. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:09,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:09,698 INFO L93 Difference]: Finished difference Result 713 states and 1054 transitions. [2024-10-11 05:56:09,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:56:09,699 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 118 [2024-10-11 05:56:09,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:09,703 INFO L225 Difference]: With dead ends: 713 [2024-10-11 05:56:09,703 INFO L226 Difference]: Without dead ends: 392 [2024-10-11 05:56:09,704 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:56:09,705 INFO L432 NwaCegarLoop]: 572 mSDtfsCounter, 0 mSDsluCounter, 1136 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1708 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:09,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1708 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:56:09,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-10-11 05:56:09,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2024-10-11 05:56:09,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.4806201550387597) internal successors, (573), 387 states have internal predecessors, (573), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:56:09,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 579 transitions. [2024-10-11 05:56:09,717 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 579 transitions. Word has length 118 [2024-10-11 05:56:09,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:09,719 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 579 transitions. [2024-10-11 05:56:09,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:09,719 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 579 transitions. [2024-10-11 05:56:09,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-11 05:56:09,720 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:09,720 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:56:09,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 05:56:09,721 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:09,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:09,722 INFO L85 PathProgramCache]: Analyzing trace with hash 544942264, now seen corresponding path program 1 times [2024-10-11 05:56:09,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:09,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226982297] [2024-10-11 05:56:09,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:09,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:09,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:10,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:56:10,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:10,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 05:56:10,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:10,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 05:56:10,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:10,191 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:10,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:10,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226982297] [2024-10-11 05:56:10,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226982297] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:10,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:10,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:56:10,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893782313] [2024-10-11 05:56:10,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:10,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:56:10,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:10,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:56:10,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:56:10,197 INFO L87 Difference]: Start difference. First operand 392 states and 579 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:10,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:10,295 INFO L93 Difference]: Finished difference Result 715 states and 1055 transitions. [2024-10-11 05:56:10,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:56:10,296 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 119 [2024-10-11 05:56:10,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:10,298 INFO L225 Difference]: With dead ends: 715 [2024-10-11 05:56:10,298 INFO L226 Difference]: Without dead ends: 392 [2024-10-11 05:56:10,299 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:56:10,299 INFO L432 NwaCegarLoop]: 532 mSDtfsCounter, 480 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:10,300 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 1066 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:56:10,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-10-11 05:56:10,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2024-10-11 05:56:10,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.4780361757105944) internal successors, (572), 387 states have internal predecessors, (572), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:56:10,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 578 transitions. [2024-10-11 05:56:10,311 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 578 transitions. Word has length 119 [2024-10-11 05:56:10,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:10,312 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 578 transitions. [2024-10-11 05:56:10,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:10,312 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 578 transitions. [2024-10-11 05:56:10,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-11 05:56:10,313 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:10,314 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:56:10,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 05:56:10,316 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:10,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:10,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1208713513, now seen corresponding path program 1 times [2024-10-11 05:56:10,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:10,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258076088] [2024-10-11 05:56:10,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:10,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:10,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:10,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:56:10,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:10,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 05:56:10,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:10,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 05:56:10,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:10,603 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:10,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:10,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258076088] [2024-10-11 05:56:10,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258076088] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:10,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:10,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:56:10,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4248221] [2024-10-11 05:56:10,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:10,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:56:10,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:10,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:56:10,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:56:10,607 INFO L87 Difference]: Start difference. First operand 392 states and 578 transitions. Second operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:10,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:10,695 INFO L93 Difference]: Finished difference Result 719 states and 1058 transitions. [2024-10-11 05:56:10,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 05:56:10,696 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 120 [2024-10-11 05:56:10,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:10,698 INFO L225 Difference]: With dead ends: 719 [2024-10-11 05:56:10,698 INFO L226 Difference]: Without dead ends: 392 [2024-10-11 05:56:10,699 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:56:10,699 INFO L432 NwaCegarLoop]: 565 mSDtfsCounter, 487 mSDsluCounter, 1102 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 1667 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:10,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 1667 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:56:10,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-10-11 05:56:10,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2024-10-11 05:56:10,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.475452196382429) internal successors, (571), 387 states have internal predecessors, (571), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:56:10,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 577 transitions. [2024-10-11 05:56:10,720 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 577 transitions. Word has length 120 [2024-10-11 05:56:10,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:10,721 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 577 transitions. [2024-10-11 05:56:10,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:10,722 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 577 transitions. [2024-10-11 05:56:10,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-11 05:56:10,723 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:10,723 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:56:10,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 05:56:10,723 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:10,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:10,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1275297526, now seen corresponding path program 1 times [2024-10-11 05:56:10,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:10,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460857036] [2024-10-11 05:56:10,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:10,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:10,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:11,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:56:11,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:11,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 05:56:11,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:11,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 05:56:11,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:11,058 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:11,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:11,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460857036] [2024-10-11 05:56:11,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460857036] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:11,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:11,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:56:11,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37400255] [2024-10-11 05:56:11,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:11,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:56:11,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:11,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:56:11,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:56:11,061 INFO L87 Difference]: Start difference. First operand 392 states and 577 transitions. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:11,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:11,169 INFO L93 Difference]: Finished difference Result 715 states and 1051 transitions. [2024-10-11 05:56:11,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:56:11,170 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 121 [2024-10-11 05:56:11,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:11,172 INFO L225 Difference]: With dead ends: 715 [2024-10-11 05:56:11,172 INFO L226 Difference]: Without dead ends: 392 [2024-10-11 05:56:11,172 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:56:11,173 INFO L432 NwaCegarLoop]: 532 mSDtfsCounter, 1039 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1042 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:11,173 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1042 Valid, 1066 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:56:11,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-10-11 05:56:11,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2024-10-11 05:56:11,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.4728682170542635) internal successors, (570), 387 states have internal predecessors, (570), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:56:11,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 576 transitions. [2024-10-11 05:56:11,184 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 576 transitions. Word has length 121 [2024-10-11 05:56:11,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:11,184 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 576 transitions. [2024-10-11 05:56:11,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:11,185 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 576 transitions. [2024-10-11 05:56:11,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-11 05:56:11,186 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:11,186 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:56:11,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 05:56:11,187 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:11,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:11,187 INFO L85 PathProgramCache]: Analyzing trace with hash -178047970, now seen corresponding path program 1 times [2024-10-11 05:56:11,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:11,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013926249] [2024-10-11 05:56:11,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:11,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:11,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:11,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:56:11,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:11,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 05:56:11,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:11,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 05:56:11,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:11,446 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:11,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:11,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013926249] [2024-10-11 05:56:11,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013926249] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:11,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:11,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:56:11,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316879007] [2024-10-11 05:56:11,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:11,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:56:11,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:11,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:56:11,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:56:11,449 INFO L87 Difference]: Start difference. First operand 392 states and 576 transitions. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:11,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:11,532 INFO L93 Difference]: Finished difference Result 715 states and 1049 transitions. [2024-10-11 05:56:11,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:56:11,532 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 122 [2024-10-11 05:56:11,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:11,534 INFO L225 Difference]: With dead ends: 715 [2024-10-11 05:56:11,534 INFO L226 Difference]: Without dead ends: 392 [2024-10-11 05:56:11,534 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:56:11,535 INFO L432 NwaCegarLoop]: 532 mSDtfsCounter, 555 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 558 SdHoareTripleChecker+Valid, 1072 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:11,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [558 Valid, 1072 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:56:11,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-10-11 05:56:11,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2024-10-11 05:56:11,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.4702842377260983) internal successors, (569), 387 states have internal predecessors, (569), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:56:11,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 575 transitions. [2024-10-11 05:56:11,548 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 575 transitions. Word has length 122 [2024-10-11 05:56:11,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:11,549 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 575 transitions. [2024-10-11 05:56:11,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:11,549 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 575 transitions. [2024-10-11 05:56:11,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-11 05:56:11,551 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:11,551 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:56:11,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 05:56:11,551 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:11,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:11,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1899068650, now seen corresponding path program 1 times [2024-10-11 05:56:11,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:11,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464247039] [2024-10-11 05:56:11,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:11,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:11,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:11,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:56:11,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:11,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 05:56:11,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:11,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 05:56:11,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:11,874 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:11,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:11,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464247039] [2024-10-11 05:56:11,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464247039] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:11,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:11,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:56:11,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593674210] [2024-10-11 05:56:11,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:11,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:56:11,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:11,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:56:11,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:56:11,876 INFO L87 Difference]: Start difference. First operand 392 states and 575 transitions. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:11,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:11,928 INFO L93 Difference]: Finished difference Result 715 states and 1047 transitions. [2024-10-11 05:56:11,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:56:11,929 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 123 [2024-10-11 05:56:11,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:11,930 INFO L225 Difference]: With dead ends: 715 [2024-10-11 05:56:11,930 INFO L226 Difference]: Without dead ends: 392 [2024-10-11 05:56:11,931 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:56:11,931 INFO L432 NwaCegarLoop]: 548 mSDtfsCounter, 484 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 1098 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:11,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 1098 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:56:11,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-10-11 05:56:11,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2024-10-11 05:56:11,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.4677002583979328) internal successors, (568), 387 states have internal predecessors, (568), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:56:11,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 574 transitions. [2024-10-11 05:56:11,938 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 574 transitions. Word has length 123 [2024-10-11 05:56:11,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:11,939 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 574 transitions. [2024-10-11 05:56:11,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:11,939 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 574 transitions. [2024-10-11 05:56:11,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-11 05:56:11,940 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:11,940 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:56:11,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 05:56:11,940 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:11,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:11,941 INFO L85 PathProgramCache]: Analyzing trace with hash -129347291, now seen corresponding path program 1 times [2024-10-11 05:56:11,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:11,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707847925] [2024-10-11 05:56:11,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:11,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:11,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:12,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:56:12,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:12,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 05:56:12,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:12,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 05:56:12,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:12,136 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:12,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:12,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707847925] [2024-10-11 05:56:12,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707847925] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:12,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:12,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:56:12,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338189746] [2024-10-11 05:56:12,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:12,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:56:12,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:12,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:56:12,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:56:12,138 INFO L87 Difference]: Start difference. First operand 392 states and 574 transitions. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:12,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:12,247 INFO L93 Difference]: Finished difference Result 715 states and 1045 transitions. [2024-10-11 05:56:12,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:56:12,247 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 124 [2024-10-11 05:56:12,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:12,249 INFO L225 Difference]: With dead ends: 715 [2024-10-11 05:56:12,249 INFO L226 Difference]: Without dead ends: 392 [2024-10-11 05:56:12,250 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:56:12,251 INFO L432 NwaCegarLoop]: 548 mSDtfsCounter, 1037 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1040 SdHoareTripleChecker+Valid, 1098 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:12,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1040 Valid, 1098 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:56:12,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-10-11 05:56:12,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2024-10-11 05:56:12,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.4651162790697674) internal successors, (567), 387 states have internal predecessors, (567), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:56:12,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 573 transitions. [2024-10-11 05:56:12,262 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 573 transitions. Word has length 124 [2024-10-11 05:56:12,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:12,262 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 573 transitions. [2024-10-11 05:56:12,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:12,263 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 573 transitions. [2024-10-11 05:56:12,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-11 05:56:12,264 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:12,264 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:56:12,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 05:56:12,264 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:12,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:12,265 INFO L85 PathProgramCache]: Analyzing trace with hash -577416317, now seen corresponding path program 1 times [2024-10-11 05:56:12,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:12,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544808404] [2024-10-11 05:56:12,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:12,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:12,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:13,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:56:13,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:13,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 05:56:13,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:13,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 05:56:13,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:13,105 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:13,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:13,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544808404] [2024-10-11 05:56:13,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544808404] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:13,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:13,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:56:13,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263839966] [2024-10-11 05:56:13,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:13,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:56:13,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:13,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:56:13,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:56:13,107 INFO L87 Difference]: Start difference. First operand 392 states and 573 transitions. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 05:56:13,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:13,209 INFO L93 Difference]: Finished difference Result 715 states and 1043 transitions. [2024-10-11 05:56:13,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:56:13,209 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 125 [2024-10-11 05:56:13,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:13,211 INFO L225 Difference]: With dead ends: 715 [2024-10-11 05:56:13,211 INFO L226 Difference]: Without dead ends: 392 [2024-10-11 05:56:13,212 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:56:13,213 INFO L432 NwaCegarLoop]: 552 mSDtfsCounter, 519 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 1106 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:13,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 1106 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:56:13,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-10-11 05:56:13,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2024-10-11 05:56:13,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.4625322997416021) internal successors, (566), 387 states have internal predecessors, (566), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:56:13,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 572 transitions. [2024-10-11 05:56:13,221 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 572 transitions. Word has length 125 [2024-10-11 05:56:13,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:13,222 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 572 transitions. [2024-10-11 05:56:13,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 05:56:13,222 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 572 transitions. [2024-10-11 05:56:13,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-11 05:56:13,223 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:13,223 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:56:13,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 05:56:13,223 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:13,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:13,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1617002421, now seen corresponding path program 1 times [2024-10-11 05:56:13,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:13,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392578051] [2024-10-11 05:56:13,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:13,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:13,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:13,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:56:13,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:13,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 05:56:13,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:13,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 05:56:13,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:13,735 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:13,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:13,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392578051] [2024-10-11 05:56:13,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392578051] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:13,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:13,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:56:13,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351419456] [2024-10-11 05:56:13,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:13,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:56:13,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:13,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:56:13,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:56:13,737 INFO L87 Difference]: Start difference. First operand 392 states and 572 transitions. Second operand has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:13,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:13,858 INFO L93 Difference]: Finished difference Result 715 states and 1041 transitions. [2024-10-11 05:56:13,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:56:13,859 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 126 [2024-10-11 05:56:13,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:13,861 INFO L225 Difference]: With dead ends: 715 [2024-10-11 05:56:13,861 INFO L226 Difference]: Without dead ends: 392 [2024-10-11 05:56:13,861 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:56:13,862 INFO L432 NwaCegarLoop]: 529 mSDtfsCounter, 474 mSDsluCounter, 1056 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 1585 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:13,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 1585 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:56:13,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-10-11 05:56:13,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2024-10-11 05:56:13,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.4599483204134367) internal successors, (565), 387 states have internal predecessors, (565), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:56:13,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 571 transitions. [2024-10-11 05:56:13,873 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 571 transitions. Word has length 126 [2024-10-11 05:56:13,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:13,873 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 571 transitions. [2024-10-11 05:56:13,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:13,873 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 571 transitions. [2024-10-11 05:56:13,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-11 05:56:13,874 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:13,875 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:56:13,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 05:56:13,875 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:13,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:13,876 INFO L85 PathProgramCache]: Analyzing trace with hash 384933465, now seen corresponding path program 1 times [2024-10-11 05:56:13,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:13,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204036245] [2024-10-11 05:56:13,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:13,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:14,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:14,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:56:14,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:14,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 05:56:14,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:14,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 05:56:14,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:14,315 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:14,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:14,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204036245] [2024-10-11 05:56:14,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204036245] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:14,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:14,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:56:14,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973420256] [2024-10-11 05:56:14,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:14,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:56:14,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:14,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:56:14,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:56:14,318 INFO L87 Difference]: Start difference. First operand 392 states and 571 transitions. Second operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:14,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:14,434 INFO L93 Difference]: Finished difference Result 715 states and 1039 transitions. [2024-10-11 05:56:14,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:56:14,434 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 127 [2024-10-11 05:56:14,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:14,436 INFO L225 Difference]: With dead ends: 715 [2024-10-11 05:56:14,436 INFO L226 Difference]: Without dead ends: 392 [2024-10-11 05:56:14,437 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:56:14,438 INFO L432 NwaCegarLoop]: 529 mSDtfsCounter, 938 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 938 SdHoareTripleChecker+Valid, 1060 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:14,438 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [938 Valid, 1060 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:56:14,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-10-11 05:56:14,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2024-10-11 05:56:14,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.4573643410852712) internal successors, (564), 387 states have internal predecessors, (564), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:56:14,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 570 transitions. [2024-10-11 05:56:14,450 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 570 transitions. Word has length 127 [2024-10-11 05:56:14,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:14,451 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 570 transitions. [2024-10-11 05:56:14,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:14,451 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 570 transitions. [2024-10-11 05:56:14,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-11 05:56:14,452 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:14,452 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:56:14,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 05:56:14,453 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:14,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:14,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1126086004, now seen corresponding path program 1 times [2024-10-11 05:56:14,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:14,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704161977] [2024-10-11 05:56:14,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:14,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:14,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:14,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:56:14,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:14,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 05:56:14,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:14,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 05:56:14,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:14,889 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:14,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:14,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704161977] [2024-10-11 05:56:14,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704161977] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:14,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:14,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:56:14,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312974498] [2024-10-11 05:56:14,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:14,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:56:14,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:14,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:56:14,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:56:14,892 INFO L87 Difference]: Start difference. First operand 392 states and 570 transitions. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:15,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:15,026 INFO L93 Difference]: Finished difference Result 715 states and 1037 transitions. [2024-10-11 05:56:15,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:56:15,028 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 128 [2024-10-11 05:56:15,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:15,030 INFO L225 Difference]: With dead ends: 715 [2024-10-11 05:56:15,030 INFO L226 Difference]: Without dead ends: 392 [2024-10-11 05:56:15,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:56:15,031 INFO L432 NwaCegarLoop]: 529 mSDtfsCounter, 470 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:15,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 1066 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:56:15,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-10-11 05:56:15,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2024-10-11 05:56:15,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.454780361757106) internal successors, (563), 387 states have internal predecessors, (563), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:56:15,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 569 transitions. [2024-10-11 05:56:15,042 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 569 transitions. Word has length 128 [2024-10-11 05:56:15,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:15,042 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 569 transitions. [2024-10-11 05:56:15,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:15,042 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 569 transitions. [2024-10-11 05:56:15,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-11 05:56:15,043 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:15,043 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:56:15,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 05:56:15,044 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:15,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:15,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1478743000, now seen corresponding path program 1 times [2024-10-11 05:56:15,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:15,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686683299] [2024-10-11 05:56:15,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:15,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:15,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:15,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:56:15,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:15,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 05:56:15,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:15,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 05:56:15,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:15,319 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:15,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:15,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686683299] [2024-10-11 05:56:15,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686683299] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:15,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:15,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:56:15,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736999493] [2024-10-11 05:56:15,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:15,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:56:15,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:15,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:56:15,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:56:15,322 INFO L87 Difference]: Start difference. First operand 392 states and 569 transitions. Second operand has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 05:56:15,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:15,374 INFO L93 Difference]: Finished difference Result 715 states and 1035 transitions. [2024-10-11 05:56:15,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:56:15,375 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 129 [2024-10-11 05:56:15,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:15,376 INFO L225 Difference]: With dead ends: 715 [2024-10-11 05:56:15,376 INFO L226 Difference]: Without dead ends: 392 [2024-10-11 05:56:15,377 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:56:15,377 INFO L432 NwaCegarLoop]: 549 mSDtfsCounter, 514 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 1100 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:15,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [516 Valid, 1100 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:56:15,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-10-11 05:56:15,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2024-10-11 05:56:15,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.4521963824289406) internal successors, (562), 387 states have internal predecessors, (562), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:56:15,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 568 transitions. [2024-10-11 05:56:15,387 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 568 transitions. Word has length 129 [2024-10-11 05:56:15,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:15,388 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 568 transitions. [2024-10-11 05:56:15,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 05:56:15,388 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 568 transitions. [2024-10-11 05:56:15,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-11 05:56:15,389 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:15,389 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:56:15,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 05:56:15,390 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:15,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:15,390 INFO L85 PathProgramCache]: Analyzing trace with hash -23884227, now seen corresponding path program 1 times [2024-10-11 05:56:15,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:15,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427048853] [2024-10-11 05:56:15,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:15,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:15,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:15,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:56:15,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:15,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:56:15,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:15,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 05:56:15,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:15,643 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:15,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:15,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427048853] [2024-10-11 05:56:15,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427048853] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:15,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:15,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:56:15,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667841997] [2024-10-11 05:56:15,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:15,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:56:15,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:15,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:56:15,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:56:15,647 INFO L87 Difference]: Start difference. First operand 392 states and 568 transitions. Second operand has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:15,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:15,699 INFO L93 Difference]: Finished difference Result 715 states and 1033 transitions. [2024-10-11 05:56:15,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:56:15,700 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 130 [2024-10-11 05:56:15,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:15,701 INFO L225 Difference]: With dead ends: 715 [2024-10-11 05:56:15,701 INFO L226 Difference]: Without dead ends: 392 [2024-10-11 05:56:15,702 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:56:15,702 INFO L432 NwaCegarLoop]: 543 mSDtfsCounter, 474 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 1088 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:15,702 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 1088 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:56:15,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-10-11 05:56:15,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2024-10-11 05:56:15,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 387 states have (on average 1.449612403100775) internal successors, (561), 387 states have internal predecessors, (561), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:56:15,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 567 transitions. [2024-10-11 05:56:15,714 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 567 transitions. Word has length 130 [2024-10-11 05:56:15,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:15,714 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 567 transitions. [2024-10-11 05:56:15,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:15,715 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 567 transitions. [2024-10-11 05:56:15,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 05:56:15,715 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:15,716 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:56:15,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 05:56:15,716 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:15,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:15,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1259931877, now seen corresponding path program 1 times [2024-10-11 05:56:15,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:15,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215011731] [2024-10-11 05:56:15,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:15,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:15,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:16,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:56:16,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:16,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:56:16,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:16,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 05:56:16,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:16,759 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:16,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:16,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215011731] [2024-10-11 05:56:16,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215011731] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:16,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:16,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:56:16,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780867946] [2024-10-11 05:56:16,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:16,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:56:16,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:16,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:56:16,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:56:16,763 INFO L87 Difference]: Start difference. First operand 392 states and 567 transitions. Second operand has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:17,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:17,171 INFO L93 Difference]: Finished difference Result 779 states and 1124 transitions. [2024-10-11 05:56:17,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:56:17,172 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 131 [2024-10-11 05:56:17,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:17,174 INFO L225 Difference]: With dead ends: 779 [2024-10-11 05:56:17,174 INFO L226 Difference]: Without dead ends: 394 [2024-10-11 05:56:17,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:56:17,176 INFO L432 NwaCegarLoop]: 538 mSDtfsCounter, 641 mSDsluCounter, 2017 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 644 SdHoareTripleChecker+Valid, 2555 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:17,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [644 Valid, 2555 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 05:56:17,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-10-11 05:56:17,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2024-10-11 05:56:17,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 389 states have (on average 1.4447300771208227) internal successors, (562), 389 states have internal predecessors, (562), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:56:17,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 568 transitions. [2024-10-11 05:56:17,192 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 568 transitions. Word has length 131 [2024-10-11 05:56:17,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:17,192 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 568 transitions. [2024-10-11 05:56:17,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:17,193 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 568 transitions. [2024-10-11 05:56:17,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-11 05:56:17,194 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:17,194 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:56:17,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 05:56:17,195 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:17,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:17,195 INFO L85 PathProgramCache]: Analyzing trace with hash 633723290, now seen corresponding path program 1 times [2024-10-11 05:56:17,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:17,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803820036] [2024-10-11 05:56:17,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:17,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:17,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:17,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 05:56:17,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:17,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 05:56:17,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:17,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 05:56:17,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:17,921 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:17,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:17,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803820036] [2024-10-11 05:56:17,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803820036] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:17,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:17,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:56:17,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804027342] [2024-10-11 05:56:17,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:17,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:56:17,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:17,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:56:17,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:56:17,924 INFO L87 Difference]: Start difference. First operand 394 states and 568 transitions. Second operand has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:18,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:18,013 INFO L93 Difference]: Finished difference Result 763 states and 1088 transitions. [2024-10-11 05:56:18,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 05:56:18,014 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 132 [2024-10-11 05:56:18,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:18,016 INFO L225 Difference]: With dead ends: 763 [2024-10-11 05:56:18,017 INFO L226 Difference]: Without dead ends: 438 [2024-10-11 05:56:18,018 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:56:18,019 INFO L432 NwaCegarLoop]: 555 mSDtfsCounter, 20 mSDsluCounter, 1659 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 2214 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:18,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 2214 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:56:18,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2024-10-11 05:56:18,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 436. [2024-10-11 05:56:18,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 431 states have (on average 1.4222737819025522) internal successors, (613), 431 states have internal predecessors, (613), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:56:18,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 619 transitions. [2024-10-11 05:56:18,031 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 619 transitions. Word has length 132 [2024-10-11 05:56:18,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:18,032 INFO L471 AbstractCegarLoop]: Abstraction has 436 states and 619 transitions. [2024-10-11 05:56:18,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:18,033 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 619 transitions. [2024-10-11 05:56:18,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-11 05:56:18,034 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:18,034 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:56:18,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 05:56:18,035 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:18,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:18,036 INFO L85 PathProgramCache]: Analyzing trace with hash -920527072, now seen corresponding path program 1 times [2024-10-11 05:56:18,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:18,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828962250] [2024-10-11 05:56:18,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:18,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:18,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:18,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 05:56:18,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:18,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 05:56:18,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:18,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 05:56:18,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:18,628 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:18,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:18,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828962250] [2024-10-11 05:56:18,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828962250] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:18,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:18,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:56:18,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246648292] [2024-10-11 05:56:18,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:18,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:56:18,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:18,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:56:18,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:56:18,632 INFO L87 Difference]: Start difference. First operand 436 states and 619 transitions. Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:19,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:19,216 INFO L93 Difference]: Finished difference Result 811 states and 1147 transitions. [2024-10-11 05:56:19,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 05:56:19,216 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 133 [2024-10-11 05:56:19,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:19,218 INFO L225 Difference]: With dead ends: 811 [2024-10-11 05:56:19,218 INFO L226 Difference]: Without dead ends: 444 [2024-10-11 05:56:19,219 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:56:19,220 INFO L432 NwaCegarLoop]: 411 mSDtfsCounter, 521 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 1221 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:19,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 1221 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 05:56:19,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2024-10-11 05:56:19,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 440. [2024-10-11 05:56:19,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 435 states have (on average 1.4183908045977012) internal successors, (617), 435 states have internal predecessors, (617), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 05:56:19,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 623 transitions. [2024-10-11 05:56:19,233 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 623 transitions. Word has length 133 [2024-10-11 05:56:19,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:19,233 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 623 transitions. [2024-10-11 05:56:19,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:19,234 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 623 transitions. [2024-10-11 05:56:19,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-11 05:56:19,235 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:19,235 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:56:19,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 05:56:19,236 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:19,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:19,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1704014421, now seen corresponding path program 1 times [2024-10-11 05:56:19,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:19,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089987910] [2024-10-11 05:56:19,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:19,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:19,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:19,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 05:56:19,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:19,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 05:56:19,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:19,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 05:56:19,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:19,952 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:56:19,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:19,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089987910] [2024-10-11 05:56:19,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089987910] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:19,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:19,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:56:19,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157600570] [2024-10-11 05:56:19,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:19,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:56:19,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:19,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:56:19,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:56:19,955 INFO L87 Difference]: Start difference. First operand 440 states and 623 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:20,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:20,072 INFO L93 Difference]: Finished difference Result 979 states and 1366 transitions. [2024-10-11 05:56:20,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 05:56:20,072 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 134 [2024-10-11 05:56:20,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:20,075 INFO L225 Difference]: With dead ends: 979 [2024-10-11 05:56:20,075 INFO L226 Difference]: Without dead ends: 608 [2024-10-11 05:56:20,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-11 05:56:20,077 INFO L432 NwaCegarLoop]: 549 mSDtfsCounter, 857 mSDsluCounter, 1643 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 860 SdHoareTripleChecker+Valid, 2192 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:20,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [860 Valid, 2192 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:56:20,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2024-10-11 05:56:20,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 608. [2024-10-11 05:56:20,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 600 states have (on average 1.3883333333333334) internal successors, (833), 600 states have internal predecessors, (833), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 05:56:20,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 845 transitions. [2024-10-11 05:56:20,096 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 845 transitions. Word has length 134 [2024-10-11 05:56:20,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:20,096 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 845 transitions. [2024-10-11 05:56:20,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:20,097 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 845 transitions. [2024-10-11 05:56:20,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2024-10-11 05:56:20,101 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:20,101 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:56:20,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 05:56:20,101 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:20,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:20,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1825961125, now seen corresponding path program 1 times [2024-10-11 05:56:20,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:20,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521662359] [2024-10-11 05:56:20,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:20,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:20,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:20,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 05:56:20,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:20,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 05:56:20,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:20,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 05:56:20,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:20,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-10-11 05:56:20,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:20,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2024-10-11 05:56:20,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:20,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2024-10-11 05:56:20,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:20,759 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 05:56:20,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:20,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521662359] [2024-10-11 05:56:20,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521662359] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:20,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:20,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:56:20,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259257613] [2024-10-11 05:56:20,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:20,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:56:20,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:20,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:56:20,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:56:20,764 INFO L87 Difference]: Start difference. First operand 608 states and 845 transitions. Second operand has 5 states, 5 states have (on average 59.2) internal successors, (296), 5 states have internal predecessors, (296), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 05:56:20,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:20,863 INFO L93 Difference]: Finished difference Result 979 states and 1365 transitions. [2024-10-11 05:56:20,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:56:20,864 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 59.2) internal successors, (296), 5 states have internal predecessors, (296), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 323 [2024-10-11 05:56:20,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:20,867 INFO L225 Difference]: With dead ends: 979 [2024-10-11 05:56:20,868 INFO L226 Difference]: Without dead ends: 608 [2024-10-11 05:56:20,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:56:20,869 INFO L432 NwaCegarLoop]: 526 mSDtfsCounter, 936 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 939 SdHoareTripleChecker+Valid, 1054 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:20,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [939 Valid, 1054 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:56:20,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2024-10-11 05:56:20,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 608. [2024-10-11 05:56:20,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 600 states have (on average 1.3866666666666667) internal successors, (832), 600 states have internal predecessors, (832), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 05:56:20,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 844 transitions. [2024-10-11 05:56:20,889 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 844 transitions. Word has length 323 [2024-10-11 05:56:20,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:20,889 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 844 transitions. [2024-10-11 05:56:20,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 59.2) internal successors, (296), 5 states have internal predecessors, (296), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 05:56:20,890 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 844 transitions. [2024-10-11 05:56:20,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2024-10-11 05:56:20,929 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:20,929 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:56:20,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 05:56:20,929 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:20,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:20,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1917394581, now seen corresponding path program 1 times [2024-10-11 05:56:20,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:20,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984160316] [2024-10-11 05:56:20,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:20,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:21,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:21,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 05:56:21,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:21,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 05:56:21,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:21,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 05:56:21,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:21,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2024-10-11 05:56:21,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:21,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2024-10-11 05:56:21,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:21,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2024-10-11 05:56:21,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:21,624 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 05:56:21,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:21,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984160316] [2024-10-11 05:56:21,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984160316] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:21,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:21,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:56:21,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353829430] [2024-10-11 05:56:21,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:21,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:56:21,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:21,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:56:21,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:56:21,626 INFO L87 Difference]: Start difference. First operand 608 states and 844 transitions. Second operand has 5 states, 5 states have (on average 59.4) internal successors, (297), 5 states have internal predecessors, (297), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 05:56:21,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:21,714 INFO L93 Difference]: Finished difference Result 979 states and 1363 transitions. [2024-10-11 05:56:21,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:56:21,715 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 59.4) internal successors, (297), 5 states have internal predecessors, (297), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 324 [2024-10-11 05:56:21,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:21,717 INFO L225 Difference]: With dead ends: 979 [2024-10-11 05:56:21,717 INFO L226 Difference]: Without dead ends: 608 [2024-10-11 05:56:21,718 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:56:21,718 INFO L432 NwaCegarLoop]: 526 mSDtfsCounter, 920 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 923 SdHoareTripleChecker+Valid, 1054 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:21,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [923 Valid, 1054 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:56:21,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2024-10-11 05:56:21,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 608. [2024-10-11 05:56:21,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 600 states have (on average 1.385) internal successors, (831), 600 states have internal predecessors, (831), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 05:56:21,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 843 transitions. [2024-10-11 05:56:21,737 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 843 transitions. Word has length 324 [2024-10-11 05:56:21,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:21,738 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 843 transitions. [2024-10-11 05:56:21,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 59.4) internal successors, (297), 5 states have internal predecessors, (297), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 05:56:21,738 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 843 transitions. [2024-10-11 05:56:21,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2024-10-11 05:56:21,741 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:21,742 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:56:21,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 05:56:21,742 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:21,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:21,743 INFO L85 PathProgramCache]: Analyzing trace with hash -337767984, now seen corresponding path program 1 times [2024-10-11 05:56:21,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:21,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562299439] [2024-10-11 05:56:21,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:21,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:21,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:22,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 05:56:22,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:22,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 05:56:22,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:22,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 05:56:22,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:22,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2024-10-11 05:56:22,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:22,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2024-10-11 05:56:22,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:22,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2024-10-11 05:56:22,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:22,474 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 05:56:22,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:22,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562299439] [2024-10-11 05:56:22,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562299439] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:22,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:22,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:56:22,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927298706] [2024-10-11 05:56:22,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:22,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:56:22,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:22,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:56:22,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:56:22,477 INFO L87 Difference]: Start difference. First operand 608 states and 843 transitions. Second operand has 5 states, 5 states have (on average 59.6) internal successors, (298), 5 states have internal predecessors, (298), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 05:56:22,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:22,563 INFO L93 Difference]: Finished difference Result 979 states and 1361 transitions. [2024-10-11 05:56:22,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:56:22,564 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 59.6) internal successors, (298), 5 states have internal predecessors, (298), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 325 [2024-10-11 05:56:22,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:22,566 INFO L225 Difference]: With dead ends: 979 [2024-10-11 05:56:22,566 INFO L226 Difference]: Without dead ends: 608 [2024-10-11 05:56:22,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:56:22,567 INFO L432 NwaCegarLoop]: 526 mSDtfsCounter, 904 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 907 SdHoareTripleChecker+Valid, 1054 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:22,567 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [907 Valid, 1054 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:56:22,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2024-10-11 05:56:22,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 608. [2024-10-11 05:56:22,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 600 states have (on average 1.3833333333333333) internal successors, (830), 600 states have internal predecessors, (830), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 05:56:22,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 842 transitions. [2024-10-11 05:56:22,585 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 842 transitions. Word has length 325 [2024-10-11 05:56:22,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:22,585 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 842 transitions. [2024-10-11 05:56:22,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 59.6) internal successors, (298), 5 states have internal predecessors, (298), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 05:56:22,586 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 842 transitions. [2024-10-11 05:56:22,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2024-10-11 05:56:22,588 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:22,590 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:56:22,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 05:56:22,590 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:22,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:22,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1699475008, now seen corresponding path program 1 times [2024-10-11 05:56:22,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:22,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950222093] [2024-10-11 05:56:22,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:22,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:22,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:23,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 05:56:23,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:23,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 05:56:23,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:23,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 05:56:23,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:23,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2024-10-11 05:56:23,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:23,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2024-10-11 05:56:23,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:23,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2024-10-11 05:56:23,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:23,229 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 05:56:23,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:23,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950222093] [2024-10-11 05:56:23,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950222093] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:23,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:23,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:56:23,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335832678] [2024-10-11 05:56:23,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:23,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:56:23,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:23,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:56:23,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:56:23,232 INFO L87 Difference]: Start difference. First operand 608 states and 842 transitions. Second operand has 5 states, 5 states have (on average 59.8) internal successors, (299), 5 states have internal predecessors, (299), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 05:56:23,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:23,307 INFO L93 Difference]: Finished difference Result 979 states and 1359 transitions. [2024-10-11 05:56:23,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:56:23,307 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 59.8) internal successors, (299), 5 states have internal predecessors, (299), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 326 [2024-10-11 05:56:23,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:23,310 INFO L225 Difference]: With dead ends: 979 [2024-10-11 05:56:23,310 INFO L226 Difference]: Without dead ends: 608 [2024-10-11 05:56:23,311 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:56:23,311 INFO L432 NwaCegarLoop]: 526 mSDtfsCounter, 888 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 891 SdHoareTripleChecker+Valid, 1054 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:23,312 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [891 Valid, 1054 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:56:23,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2024-10-11 05:56:23,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 608. [2024-10-11 05:56:23,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 600 states have (on average 1.3816666666666666) internal successors, (829), 600 states have internal predecessors, (829), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 05:56:23,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 841 transitions. [2024-10-11 05:56:23,326 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 841 transitions. Word has length 326 [2024-10-11 05:56:23,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:23,326 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 841 transitions. [2024-10-11 05:56:23,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 59.8) internal successors, (299), 5 states have internal predecessors, (299), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 05:56:23,327 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 841 transitions. [2024-10-11 05:56:23,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2024-10-11 05:56:23,329 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:23,329 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:56:23,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 05:56:23,330 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:23,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:23,330 INFO L85 PathProgramCache]: Analyzing trace with hash 449194949, now seen corresponding path program 1 times [2024-10-11 05:56:23,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:23,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320329911] [2024-10-11 05:56:23,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:23,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:23,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:23,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 05:56:23,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:23,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 05:56:23,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:23,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 05:56:23,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:23,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2024-10-11 05:56:23,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:23,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2024-10-11 05:56:23,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:23,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2024-10-11 05:56:23,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:23,886 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 05:56:23,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:23,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320329911] [2024-10-11 05:56:23,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320329911] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:23,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:23,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:56:23,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819087024] [2024-10-11 05:56:23,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:23,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:56:23,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:23,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:56:23,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:56:23,888 INFO L87 Difference]: Start difference. First operand 608 states and 841 transitions. Second operand has 5 states, 5 states have (on average 60.0) internal successors, (300), 5 states have internal predecessors, (300), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 05:56:23,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:23,974 INFO L93 Difference]: Finished difference Result 979 states and 1357 transitions. [2024-10-11 05:56:23,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:56:23,975 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 60.0) internal successors, (300), 5 states have internal predecessors, (300), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 327 [2024-10-11 05:56:23,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:23,977 INFO L225 Difference]: With dead ends: 979 [2024-10-11 05:56:23,977 INFO L226 Difference]: Without dead ends: 608 [2024-10-11 05:56:23,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:56:23,978 INFO L432 NwaCegarLoop]: 538 mSDtfsCounter, 865 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 868 SdHoareTripleChecker+Valid, 1078 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:23,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [868 Valid, 1078 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:56:23,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2024-10-11 05:56:23,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 608. [2024-10-11 05:56:23,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 600 states have (on average 1.38) internal successors, (828), 600 states have internal predecessors, (828), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 05:56:23,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 840 transitions. [2024-10-11 05:56:23,998 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 840 transitions. Word has length 327 [2024-10-11 05:56:23,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:24,001 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 840 transitions. [2024-10-11 05:56:24,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.0) internal successors, (300), 5 states have internal predecessors, (300), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 05:56:24,002 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 840 transitions. [2024-10-11 05:56:24,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2024-10-11 05:56:24,005 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:24,005 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:56:24,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 05:56:24,005 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:24,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:24,005 INFO L85 PathProgramCache]: Analyzing trace with hash -448690539, now seen corresponding path program 1 times [2024-10-11 05:56:24,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:24,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610016279] [2024-10-11 05:56:24,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:24,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:24,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:24,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 05:56:24,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:24,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 05:56:24,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:24,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 05:56:24,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:24,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2024-10-11 05:56:24,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:24,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-10-11 05:56:24,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:24,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2024-10-11 05:56:24,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:24,601 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 05:56:24,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:24,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610016279] [2024-10-11 05:56:24,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610016279] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:24,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:24,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:56:24,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513883739] [2024-10-11 05:56:24,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:24,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:56:24,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:24,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:56:24,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:56:24,608 INFO L87 Difference]: Start difference. First operand 608 states and 840 transitions. Second operand has 5 states, 5 states have (on average 60.2) internal successors, (301), 5 states have internal predecessors, (301), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 05:56:24,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:24,677 INFO L93 Difference]: Finished difference Result 979 states and 1355 transitions. [2024-10-11 05:56:24,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:56:24,677 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 60.2) internal successors, (301), 5 states have internal predecessors, (301), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 328 [2024-10-11 05:56:24,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:24,679 INFO L225 Difference]: With dead ends: 979 [2024-10-11 05:56:24,680 INFO L226 Difference]: Without dead ends: 608 [2024-10-11 05:56:24,680 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:56:24,681 INFO L432 NwaCegarLoop]: 538 mSDtfsCounter, 467 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 1084 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:24,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 1084 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:56:24,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2024-10-11 05:56:24,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 608. [2024-10-11 05:56:24,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 600 states have (on average 1.3783333333333334) internal successors, (827), 600 states have internal predecessors, (827), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 05:56:24,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 839 transitions. [2024-10-11 05:56:24,700 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 839 transitions. Word has length 328 [2024-10-11 05:56:24,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:24,700 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 839 transitions. [2024-10-11 05:56:24,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.2) internal successors, (301), 5 states have internal predecessors, (301), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 05:56:24,700 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 839 transitions. [2024-10-11 05:56:24,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2024-10-11 05:56:24,703 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:24,703 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:56:24,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-11 05:56:24,703 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:24,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:24,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1367303878, now seen corresponding path program 1 times [2024-10-11 05:56:24,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:24,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558758419] [2024-10-11 05:56:24,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:24,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:24,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:25,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 05:56:25,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:25,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 05:56:25,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:25,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 05:56:25,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:25,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2024-10-11 05:56:25,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:25,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-10-11 05:56:25,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:25,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2024-10-11 05:56:25,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:25,323 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 05:56:25,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:25,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558758419] [2024-10-11 05:56:25,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558758419] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:25,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:25,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:56:25,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114194786] [2024-10-11 05:56:25,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:25,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:56:25,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:25,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:56:25,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:56:25,325 INFO L87 Difference]: Start difference. First operand 608 states and 839 transitions. Second operand has 5 states, 5 states have (on average 60.4) internal successors, (302), 5 states have internal predecessors, (302), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 05:56:25,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:25,586 INFO L93 Difference]: Finished difference Result 979 states and 1353 transitions. [2024-10-11 05:56:25,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:56:25,587 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 60.4) internal successors, (302), 5 states have internal predecessors, (302), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 329 [2024-10-11 05:56:25,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:25,589 INFO L225 Difference]: With dead ends: 979 [2024-10-11 05:56:25,589 INFO L226 Difference]: Without dead ends: 608 [2024-10-11 05:56:25,590 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:56:25,590 INFO L432 NwaCegarLoop]: 398 mSDtfsCounter, 415 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:25,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 804 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 05:56:25,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2024-10-11 05:56:25,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 608. [2024-10-11 05:56:25,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 600 states have (on average 1.3766666666666667) internal successors, (826), 600 states have internal predecessors, (826), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 05:56:25,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 838 transitions. [2024-10-11 05:56:25,606 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 838 transitions. Word has length 329 [2024-10-11 05:56:25,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:25,607 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 838 transitions. [2024-10-11 05:56:25,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.4) internal successors, (302), 5 states have internal predecessors, (302), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 05:56:25,607 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 838 transitions. [2024-10-11 05:56:25,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2024-10-11 05:56:25,610 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:25,611 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:56:25,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-11 05:56:25,611 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:25,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:25,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1320162710, now seen corresponding path program 1 times [2024-10-11 05:56:25,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:25,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935811516] [2024-10-11 05:56:25,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:25,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:25,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:26,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 05:56:26,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:26,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 05:56:26,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:26,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 05:56:26,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:26,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2024-10-11 05:56:26,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:26,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2024-10-11 05:56:26,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:26,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2024-10-11 05:56:26,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:26,621 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 05:56:26,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:26,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935811516] [2024-10-11 05:56:26,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935811516] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:26,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:26,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:56:26,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12569336] [2024-10-11 05:56:26,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:26,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:56:26,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:26,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:56:26,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:56:26,625 INFO L87 Difference]: Start difference. First operand 608 states and 838 transitions. Second operand has 4 states, 4 states have (on average 75.75) internal successors, (303), 4 states have internal predecessors, (303), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 05:56:26,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:26,683 INFO L93 Difference]: Finished difference Result 979 states and 1351 transitions. [2024-10-11 05:56:26,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:56:26,684 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 75.75) internal successors, (303), 4 states have internal predecessors, (303), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 330 [2024-10-11 05:56:26,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:26,686 INFO L225 Difference]: With dead ends: 979 [2024-10-11 05:56:26,686 INFO L226 Difference]: Without dead ends: 608 [2024-10-11 05:56:26,687 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:56:26,688 INFO L432 NwaCegarLoop]: 537 mSDtfsCounter, 381 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 1076 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:26,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 1076 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:56:26,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2024-10-11 05:56:26,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 608. [2024-10-11 05:56:26,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 600 states have (on average 1.375) internal successors, (825), 600 states have internal predecessors, (825), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 05:56:26,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 837 transitions. [2024-10-11 05:56:26,704 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 837 transitions. Word has length 330 [2024-10-11 05:56:26,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:26,704 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 837 transitions. [2024-10-11 05:56:26,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.75) internal successors, (303), 4 states have internal predecessors, (303), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 05:56:26,704 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 837 transitions. [2024-10-11 05:56:26,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2024-10-11 05:56:26,708 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:26,710 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:56:26,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-11 05:56:26,710 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:26,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:26,711 INFO L85 PathProgramCache]: Analyzing trace with hash 258710252, now seen corresponding path program 1 times [2024-10-11 05:56:26,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:26,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68401168] [2024-10-11 05:56:26,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:26,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:27,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:27,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 05:56:27,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:27,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 05:56:27,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:27,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 05:56:27,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:27,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2024-10-11 05:56:27,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:27,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2024-10-11 05:56:27,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:27,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2024-10-11 05:56:27,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:27,866 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 05:56:27,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:27,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68401168] [2024-10-11 05:56:27,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68401168] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:27,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:27,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:56:27,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087669437] [2024-10-11 05:56:27,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:27,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:56:27,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:27,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:56:27,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:56:27,869 INFO L87 Difference]: Start difference. First operand 608 states and 837 transitions. Second operand has 5 states, 5 states have (on average 60.8) internal successors, (304), 5 states have internal predecessors, (304), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 05:56:27,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:27,951 INFO L93 Difference]: Finished difference Result 979 states and 1349 transitions. [2024-10-11 05:56:27,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:56:27,956 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 60.8) internal successors, (304), 5 states have internal predecessors, (304), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 331 [2024-10-11 05:56:27,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:27,958 INFO L225 Difference]: With dead ends: 979 [2024-10-11 05:56:27,958 INFO L226 Difference]: Without dead ends: 608 [2024-10-11 05:56:27,959 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:56:27,959 INFO L432 NwaCegarLoop]: 522 mSDtfsCounter, 861 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 861 SdHoareTripleChecker+Valid, 1046 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:27,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [861 Valid, 1046 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:56:27,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2024-10-11 05:56:27,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 608. [2024-10-11 05:56:27,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 600 states have (on average 1.3733333333333333) internal successors, (824), 600 states have internal predecessors, (824), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 05:56:27,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 836 transitions. [2024-10-11 05:56:27,977 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 836 transitions. Word has length 331 [2024-10-11 05:56:27,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:27,978 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 836 transitions. [2024-10-11 05:56:27,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.8) internal successors, (304), 5 states have internal predecessors, (304), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 05:56:27,978 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 836 transitions. [2024-10-11 05:56:27,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2024-10-11 05:56:27,979 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:27,980 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:56:27,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-11 05:56:27,980 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:27,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:27,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1969308438, now seen corresponding path program 1 times [2024-10-11 05:56:27,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:27,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609964269] [2024-10-11 05:56:27,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:27,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:28,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:28,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 05:56:28,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:28,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 05:56:28,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:28,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 05:56:28,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:28,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-10-11 05:56:28,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:28,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2024-10-11 05:56:28,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:28,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2024-10-11 05:56:28,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:28,911 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 05:56:28,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:28,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609964269] [2024-10-11 05:56:28,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609964269] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:28,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:28,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:56:28,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478352938] [2024-10-11 05:56:28,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:28,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:56:28,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:28,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:56:28,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:56:28,913 INFO L87 Difference]: Start difference. First operand 608 states and 836 transitions. Second operand has 5 states, 5 states have (on average 61.0) internal successors, (305), 5 states have internal predecessors, (305), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 05:56:28,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:28,994 INFO L93 Difference]: Finished difference Result 979 states and 1347 transitions. [2024-10-11 05:56:28,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:56:28,994 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 61.0) internal successors, (305), 5 states have internal predecessors, (305), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 332 [2024-10-11 05:56:28,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:28,996 INFO L225 Difference]: With dead ends: 979 [2024-10-11 05:56:28,996 INFO L226 Difference]: Without dead ends: 608 [2024-10-11 05:56:28,997 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:56:28,998 INFO L432 NwaCegarLoop]: 522 mSDtfsCounter, 851 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 851 SdHoareTripleChecker+Valid, 1046 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:28,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [851 Valid, 1046 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:56:28,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2024-10-11 05:56:29,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 608. [2024-10-11 05:56:29,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 600 states have (on average 1.3716666666666666) internal successors, (823), 600 states have internal predecessors, (823), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 05:56:29,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 835 transitions. [2024-10-11 05:56:29,011 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 835 transitions. Word has length 332 [2024-10-11 05:56:29,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:29,012 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 835 transitions. [2024-10-11 05:56:29,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 61.0) internal successors, (305), 5 states have internal predecessors, (305), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 05:56:29,012 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 835 transitions. [2024-10-11 05:56:29,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2024-10-11 05:56:29,013 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:29,014 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:56:29,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-11 05:56:29,014 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:29,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:29,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1737248891, now seen corresponding path program 1 times [2024-10-11 05:56:29,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:29,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213705704] [2024-10-11 05:56:29,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:29,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:29,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:30,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 05:56:30,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:30,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 05:56:30,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:30,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 05:56:30,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:30,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2024-10-11 05:56:30,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:30,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2024-10-11 05:56:30,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:30,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2024-10-11 05:56:30,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:30,018 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 05:56:30,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:30,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213705704] [2024-10-11 05:56:30,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213705704] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:30,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:30,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:56:30,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947346310] [2024-10-11 05:56:30,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:30,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:56:30,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:30,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:56:30,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:56:30,022 INFO L87 Difference]: Start difference. First operand 608 states and 835 transitions. Second operand has 4 states, 4 states have (on average 76.5) internal successors, (306), 4 states have internal predecessors, (306), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 05:56:30,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:30,094 INFO L93 Difference]: Finished difference Result 979 states and 1345 transitions. [2024-10-11 05:56:30,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:56:30,095 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 76.5) internal successors, (306), 4 states have internal predecessors, (306), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 333 [2024-10-11 05:56:30,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:30,097 INFO L225 Difference]: With dead ends: 979 [2024-10-11 05:56:30,097 INFO L226 Difference]: Without dead ends: 608 [2024-10-11 05:56:30,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:56:30,098 INFO L432 NwaCegarLoop]: 522 mSDtfsCounter, 390 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 1046 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:30,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 1046 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:56:30,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2024-10-11 05:56:30,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 608. [2024-10-11 05:56:30,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 600 states have (on average 1.37) internal successors, (822), 600 states have internal predecessors, (822), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 05:56:30,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 834 transitions. [2024-10-11 05:56:30,111 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 834 transitions. Word has length 333 [2024-10-11 05:56:30,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:30,111 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 834 transitions. [2024-10-11 05:56:30,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 76.5) internal successors, (306), 4 states have internal predecessors, (306), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 05:56:30,112 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 834 transitions. [2024-10-11 05:56:30,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2024-10-11 05:56:30,114 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:30,114 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:56:30,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-11 05:56:30,115 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:30,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:30,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1991437285, now seen corresponding path program 1 times [2024-10-11 05:56:30,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:30,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853694620] [2024-10-11 05:56:30,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:30,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:30,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:31,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 05:56:31,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:31,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 05:56:31,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:31,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 05:56:31,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:31,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2024-10-11 05:56:31,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:31,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2024-10-11 05:56:31,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:31,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2024-10-11 05:56:31,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:31,033 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 05:56:31,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:31,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853694620] [2024-10-11 05:56:31,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853694620] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:31,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:31,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:56:31,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798463185] [2024-10-11 05:56:31,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:31,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:56:31,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:31,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:56:31,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:56:31,035 INFO L87 Difference]: Start difference. First operand 608 states and 834 transitions. Second operand has 6 states, 6 states have (on average 51.166666666666664) internal successors, (307), 6 states have internal predecessors, (307), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 05:56:31,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:31,475 INFO L93 Difference]: Finished difference Result 1428 states and 1964 transitions. [2024-10-11 05:56:31,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 05:56:31,476 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 51.166666666666664) internal successors, (307), 6 states have internal predecessors, (307), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 334 [2024-10-11 05:56:31,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:31,480 INFO L225 Difference]: With dead ends: 1428 [2024-10-11 05:56:31,480 INFO L226 Difference]: Without dead ends: 1057 [2024-10-11 05:56:31,482 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:56:31,482 INFO L432 NwaCegarLoop]: 455 mSDtfsCounter, 354 mSDsluCounter, 1816 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 2271 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:31,483 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 2271 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 05:56:31,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2024-10-11 05:56:31,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 935. [2024-10-11 05:56:31,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 935 states, 924 states have (on average 1.3658008658008658) internal successors, (1262), 924 states have internal predecessors, (1262), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 05:56:31,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1280 transitions. [2024-10-11 05:56:31,505 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1280 transitions. Word has length 334 [2024-10-11 05:56:31,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:31,506 INFO L471 AbstractCegarLoop]: Abstraction has 935 states and 1280 transitions. [2024-10-11 05:56:31,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 51.166666666666664) internal successors, (307), 6 states have internal predecessors, (307), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 05:56:31,506 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1280 transitions. [2024-10-11 05:56:31,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2024-10-11 05:56:31,508 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:31,508 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:56:31,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-11 05:56:31,509 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:31,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:31,509 INFO L85 PathProgramCache]: Analyzing trace with hash 2061663201, now seen corresponding path program 1 times [2024-10-11 05:56:31,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:31,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199627662] [2024-10-11 05:56:31,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:31,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:32,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:32,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 05:56:32,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:32,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 05:56:32,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:32,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 05:56:32,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:32,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2024-10-11 05:56:32,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:32,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2024-10-11 05:56:32,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:32,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2024-10-11 05:56:32,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:32,743 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 05:56:32,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:32,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199627662] [2024-10-11 05:56:32,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199627662] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:32,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:32,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:56:32,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582271294] [2024-10-11 05:56:32,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:32,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:56:32,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:32,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:56:32,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:56:32,746 INFO L87 Difference]: Start difference. First operand 935 states and 1280 transitions. Second operand has 6 states, 6 states have (on average 51.333333333333336) internal successors, (308), 6 states have internal predecessors, (308), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 05:56:33,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:33,248 INFO L93 Difference]: Finished difference Result 1329 states and 1823 transitions. [2024-10-11 05:56:33,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 05:56:33,248 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 51.333333333333336) internal successors, (308), 6 states have internal predecessors, (308), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 335 [2024-10-11 05:56:33,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:33,251 INFO L225 Difference]: With dead ends: 1329 [2024-10-11 05:56:33,251 INFO L226 Difference]: Without dead ends: 958 [2024-10-11 05:56:33,252 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:56:33,252 INFO L432 NwaCegarLoop]: 395 mSDtfsCounter, 766 mSDsluCounter, 1178 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 769 SdHoareTripleChecker+Valid, 1573 SdHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:33,253 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [769 Valid, 1573 Invalid, 636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 05:56:33,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2024-10-11 05:56:33,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 936. [2024-10-11 05:56:33,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 936 states, 925 states have (on average 1.3654054054054054) internal successors, (1263), 925 states have internal predecessors, (1263), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 05:56:33,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 936 states to 936 states and 1281 transitions. [2024-10-11 05:56:33,269 INFO L78 Accepts]: Start accepts. Automaton has 936 states and 1281 transitions. Word has length 335 [2024-10-11 05:56:33,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:33,269 INFO L471 AbstractCegarLoop]: Abstraction has 936 states and 1281 transitions. [2024-10-11 05:56:33,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 51.333333333333336) internal successors, (308), 6 states have internal predecessors, (308), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 05:56:33,270 INFO L276 IsEmpty]: Start isEmpty. Operand 936 states and 1281 transitions. [2024-10-11 05:56:33,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2024-10-11 05:56:33,271 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:33,272 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:56:33,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-11 05:56:33,272 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:33,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:33,272 INFO L85 PathProgramCache]: Analyzing trace with hash -769732178, now seen corresponding path program 1 times [2024-10-11 05:56:33,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:33,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388247177] [2024-10-11 05:56:33,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:33,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:34,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:35,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 05:56:35,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:35,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 05:56:35,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:35,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 05:56:35,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:35,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2024-10-11 05:56:35,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:35,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2024-10-11 05:56:35,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:35,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2024-10-11 05:56:35,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:35,594 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-10-11 05:56:35,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:35,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388247177] [2024-10-11 05:56:35,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388247177] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:35,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:35,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 05:56:35,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164591377] [2024-10-11 05:56:35,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:35,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 05:56:35,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:35,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 05:56:35,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:56:35,597 INFO L87 Difference]: Start difference. First operand 936 states and 1281 transitions. Second operand has 8 states, 8 states have (on average 32.25) internal successors, (258), 8 states have internal predecessors, (258), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 05:56:37,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:37,040 INFO L93 Difference]: Finished difference Result 2111 states and 2882 transitions. [2024-10-11 05:56:37,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 05:56:37,041 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 32.25) internal successors, (258), 8 states have internal predecessors, (258), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 335 [2024-10-11 05:56:37,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:37,047 INFO L225 Difference]: With dead ends: 2111 [2024-10-11 05:56:37,047 INFO L226 Difference]: Without dead ends: 1624 [2024-10-11 05:56:37,048 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-11 05:56:37,049 INFO L432 NwaCegarLoop]: 916 mSDtfsCounter, 1319 mSDsluCounter, 3792 mSDsCounter, 0 mSdLazyCounter, 2053 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1325 SdHoareTripleChecker+Valid, 4708 SdHoareTripleChecker+Invalid, 2054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:37,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1325 Valid, 4708 Invalid, 2054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2053 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 05:56:37,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1624 states. [2024-10-11 05:56:37,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1624 to 1005. [2024-10-11 05:56:37,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1005 states, 991 states have (on average 1.367305751765893) internal successors, (1355), 991 states have internal predecessors, (1355), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 05:56:37,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1005 states to 1005 states and 1379 transitions. [2024-10-11 05:56:37,083 INFO L78 Accepts]: Start accepts. Automaton has 1005 states and 1379 transitions. Word has length 335 [2024-10-11 05:56:37,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:37,084 INFO L471 AbstractCegarLoop]: Abstraction has 1005 states and 1379 transitions. [2024-10-11 05:56:37,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 32.25) internal successors, (258), 8 states have internal predecessors, (258), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 05:56:37,088 INFO L276 IsEmpty]: Start isEmpty. Operand 1005 states and 1379 transitions. [2024-10-11 05:56:37,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2024-10-11 05:56:37,091 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:37,091 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:56:37,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-11 05:56:37,091 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:37,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:37,093 INFO L85 PathProgramCache]: Analyzing trace with hash -53651874, now seen corresponding path program 1 times [2024-10-11 05:56:37,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:37,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794949758] [2024-10-11 05:56:37,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:37,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:37,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:38,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 05:56:38,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:38,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 05:56:38,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:38,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 05:56:38,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:38,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2024-10-11 05:56:38,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:38,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2024-10-11 05:56:38,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:38,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 273 [2024-10-11 05:56:38,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:38,923 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-10-11 05:56:38,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:38,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794949758] [2024-10-11 05:56:38,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794949758] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:38,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:38,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:56:38,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998840996] [2024-10-11 05:56:38,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:38,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:56:38,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:38,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:56:38,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:56:38,927 INFO L87 Difference]: Start difference. First operand 1005 states and 1379 transitions. Second operand has 5 states, 5 states have (on average 53.6) internal successors, (268), 5 states have internal predecessors, (268), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:39,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:39,279 INFO L93 Difference]: Finished difference Result 1671 states and 2268 transitions. [2024-10-11 05:56:39,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 05:56:39,280 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 53.6) internal successors, (268), 5 states have internal predecessors, (268), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 336 [2024-10-11 05:56:39,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:39,284 INFO L225 Difference]: With dead ends: 1671 [2024-10-11 05:56:39,284 INFO L226 Difference]: Without dead ends: 1017 [2024-10-11 05:56:39,286 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:56:39,286 INFO L432 NwaCegarLoop]: 401 mSDtfsCounter, 322 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 1197 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:39,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 1197 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 05:56:39,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2024-10-11 05:56:39,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 1011. [2024-10-11 05:56:39,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1011 states, 997 states have (on average 1.3650952858575727) internal successors, (1361), 997 states have internal predecessors, (1361), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 05:56:39,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1385 transitions. [2024-10-11 05:56:39,342 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1385 transitions. Word has length 336 [2024-10-11 05:56:39,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:39,343 INFO L471 AbstractCegarLoop]: Abstraction has 1011 states and 1385 transitions. [2024-10-11 05:56:39,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 53.6) internal successors, (268), 5 states have internal predecessors, (268), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 05:56:39,343 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1385 transitions. [2024-10-11 05:56:39,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2024-10-11 05:56:39,350 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:39,350 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:56:39,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-10-11 05:56:39,351 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:39,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:39,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1710423380, now seen corresponding path program 1 times [2024-10-11 05:56:39,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:39,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140499335] [2024-10-11 05:56:39,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:39,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:40,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:40,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 05:56:40,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:40,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 05:56:40,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:40,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 05:56:40,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:40,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2024-10-11 05:56:40,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:40,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2024-10-11 05:56:40,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:40,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 273 [2024-10-11 05:56:40,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:40,643 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-10-11 05:56:40,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:40,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140499335] [2024-10-11 05:56:40,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140499335] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:40,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:40,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:56:40,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722975411] [2024-10-11 05:56:40,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:40,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:56:40,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:40,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:56:40,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:56:40,646 INFO L87 Difference]: Start difference. First operand 1011 states and 1385 transitions. Second operand has 4 states, 4 states have (on average 69.0) internal successors, (276), 4 states have internal predecessors, (276), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 05:56:40,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:40,916 INFO L93 Difference]: Finished difference Result 1667 states and 2258 transitions. [2024-10-11 05:56:40,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:56:40,917 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 69.0) internal successors, (276), 4 states have internal predecessors, (276), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 336 [2024-10-11 05:56:40,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:40,921 INFO L225 Difference]: With dead ends: 1667 [2024-10-11 05:56:40,922 INFO L226 Difference]: Without dead ends: 1011 [2024-10-11 05:56:40,923 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:56:40,924 INFO L432 NwaCegarLoop]: 402 mSDtfsCounter, 501 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:40,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 803 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 05:56:40,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2024-10-11 05:56:40,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 1011. [2024-10-11 05:56:40,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1011 states, 997 states have (on average 1.3590772316950852) internal successors, (1355), 997 states have internal predecessors, (1355), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 05:56:40,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1379 transitions. [2024-10-11 05:56:40,946 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1379 transitions. Word has length 336 [2024-10-11 05:56:40,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:40,946 INFO L471 AbstractCegarLoop]: Abstraction has 1011 states and 1379 transitions. [2024-10-11 05:56:40,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.0) internal successors, (276), 4 states have internal predecessors, (276), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 05:56:40,946 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1379 transitions. [2024-10-11 05:56:40,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2024-10-11 05:56:40,948 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:40,948 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:56:40,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-10-11 05:56:40,949 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:40,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:40,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1114654100, now seen corresponding path program 1 times [2024-10-11 05:56:40,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:40,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79579589] [2024-10-11 05:56:40,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:40,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:41,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:42,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 05:56:42,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:42,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 05:56:42,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:42,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 05:56:42,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:42,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-10-11 05:56:42,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:42,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2024-10-11 05:56:42,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:42,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2024-10-11 05:56:42,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:42,472 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-10-11 05:56:42,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:42,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79579589] [2024-10-11 05:56:42,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79579589] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:42,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:42,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 05:56:42,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363763029] [2024-10-11 05:56:42,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:42,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 05:56:42,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:42,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 05:56:42,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:56:42,475 INFO L87 Difference]: Start difference. First operand 1011 states and 1379 transitions. Second operand has 8 states, 8 states have (on average 35.125) internal successors, (281), 8 states have internal predecessors, (281), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 05:56:43,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:43,286 INFO L93 Difference]: Finished difference Result 2517 states and 3402 transitions. [2024-10-11 05:56:43,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 05:56:43,287 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 35.125) internal successors, (281), 8 states have internal predecessors, (281), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 338 [2024-10-11 05:56:43,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:43,294 INFO L225 Difference]: With dead ends: 2517 [2024-10-11 05:56:43,294 INFO L226 Difference]: Without dead ends: 1877 [2024-10-11 05:56:43,295 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-10-11 05:56:43,296 INFO L432 NwaCegarLoop]: 414 mSDtfsCounter, 1289 mSDsluCounter, 1984 mSDsCounter, 0 mSdLazyCounter, 971 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1292 SdHoareTripleChecker+Valid, 2398 SdHoareTripleChecker+Invalid, 971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 971 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:43,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1292 Valid, 2398 Invalid, 971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 971 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 05:56:43,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1877 states. [2024-10-11 05:56:43,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1877 to 1869. [2024-10-11 05:56:43,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1869 states, 1843 states have (on average 1.3505154639175259) internal successors, (2489), 1843 states have internal predecessors, (2489), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 05:56:43,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1869 states to 1869 states and 2537 transitions. [2024-10-11 05:56:43,343 INFO L78 Accepts]: Start accepts. Automaton has 1869 states and 2537 transitions. Word has length 338 [2024-10-11 05:56:43,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:43,344 INFO L471 AbstractCegarLoop]: Abstraction has 1869 states and 2537 transitions. [2024-10-11 05:56:43,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 35.125) internal successors, (281), 8 states have internal predecessors, (281), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 05:56:43,344 INFO L276 IsEmpty]: Start isEmpty. Operand 1869 states and 2537 transitions. [2024-10-11 05:56:43,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2024-10-11 05:56:43,348 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:43,349 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:56:43,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-10-11 05:56:43,349 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:43,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:43,350 INFO L85 PathProgramCache]: Analyzing trace with hash 366505692, now seen corresponding path program 1 times [2024-10-11 05:56:43,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:43,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255029948] [2024-10-11 05:56:43,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:43,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:44,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:44,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 05:56:44,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:44,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 05:56:44,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:44,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 05:56:44,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:44,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2024-10-11 05:56:44,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:44,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2024-10-11 05:56:44,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:44,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2024-10-11 05:56:44,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:44,890 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 79 proven. 4 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-10-11 05:56:44,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:44,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255029948] [2024-10-11 05:56:44,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255029948] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 05:56:44,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762486477] [2024-10-11 05:56:44,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:44,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:56:44,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:56:44,894 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 05:56:44,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 05:56:45,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:45,978 INFO L255 TraceCheckSpWp]: Trace formula consists of 2035 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 05:56:46,000 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:56:46,320 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-10-11 05:56:46,321 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 05:56:46,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1762486477] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:46,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 05:56:46,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2024-10-11 05:56:46,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869939037] [2024-10-11 05:56:46,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:46,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:56:46,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:46,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:56:46,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:56:46,326 INFO L87 Difference]: Start difference. First operand 1869 states and 2537 transitions. Second operand has 4 states, 4 states have (on average 71.25) internal successors, (285), 4 states have internal predecessors, (285), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 05:56:46,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:46,625 INFO L93 Difference]: Finished difference Result 2598 states and 3513 transitions. [2024-10-11 05:56:46,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:56:46,626 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 71.25) internal successors, (285), 4 states have internal predecessors, (285), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 340 [2024-10-11 05:56:46,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:46,631 INFO L225 Difference]: With dead ends: 2598 [2024-10-11 05:56:46,631 INFO L226 Difference]: Without dead ends: 1009 [2024-10-11 05:56:46,633 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 353 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-11 05:56:46,634 INFO L432 NwaCegarLoop]: 394 mSDtfsCounter, 458 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:46,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 790 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 05:56:46,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2024-10-11 05:56:46,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 1009. [2024-10-11 05:56:46,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1009 states, 995 states have (on average 1.3537688442211055) internal successors, (1347), 995 states have internal predecessors, (1347), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 05:56:46,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1371 transitions. [2024-10-11 05:56:46,673 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1371 transitions. Word has length 340 [2024-10-11 05:56:46,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:46,674 INFO L471 AbstractCegarLoop]: Abstraction has 1009 states and 1371 transitions. [2024-10-11 05:56:46,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.25) internal successors, (285), 4 states have internal predecessors, (285), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 05:56:46,674 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1371 transitions. [2024-10-11 05:56:46,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2024-10-11 05:56:46,678 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:46,679 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:56:46,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 05:56:46,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2024-10-11 05:56:46,884 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:46,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:46,884 INFO L85 PathProgramCache]: Analyzing trace with hash -135458990, now seen corresponding path program 1 times [2024-10-11 05:56:46,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:46,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108573466] [2024-10-11 05:56:46,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:46,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:47,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:48,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 05:56:48,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:48,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 05:56:48,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:48,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 05:56:48,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:48,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2024-10-11 05:56:48,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:48,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2024-10-11 05:56:48,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:48,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2024-10-11 05:56:48,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:48,598 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 72 proven. 3 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-10-11 05:56:48,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:48,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108573466] [2024-10-11 05:56:48,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108573466] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 05:56:48,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [687549950] [2024-10-11 05:56:48,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:48,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:56:48,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:56:48,601 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 05:56:48,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 05:56:49,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:49,642 INFO L255 TraceCheckSpWp]: Trace formula consists of 2035 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-11 05:56:49,656 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:56:50,032 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-10-11 05:56:50,033 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 05:56:50,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [687549950] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:50,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 05:56:50,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 14 [2024-10-11 05:56:50,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496125349] [2024-10-11 05:56:50,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:50,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 05:56:50,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:50,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 05:56:50,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-10-11 05:56:50,036 INFO L87 Difference]: Start difference. First operand 1009 states and 1371 transitions. Second operand has 9 states, 9 states have (on average 28.333333333333332) internal successors, (255), 9 states have internal predecessors, (255), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 05:56:50,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:50,792 INFO L93 Difference]: Finished difference Result 1842 states and 2491 transitions. [2024-10-11 05:56:50,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 05:56:50,793 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 28.333333333333332) internal successors, (255), 9 states have internal predecessors, (255), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 340 [2024-10-11 05:56:50,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:50,797 INFO L225 Difference]: With dead ends: 1842 [2024-10-11 05:56:50,797 INFO L226 Difference]: Without dead ends: 1029 [2024-10-11 05:56:50,798 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2024-10-11 05:56:50,799 INFO L432 NwaCegarLoop]: 383 mSDtfsCounter, 502 mSDsluCounter, 2264 mSDsCounter, 0 mSdLazyCounter, 1162 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 2647 SdHoareTripleChecker+Invalid, 1164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:50,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 2647 Invalid, 1164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1162 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 05:56:50,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2024-10-11 05:56:50,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 1021. [2024-10-11 05:56:50,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1021 states, 1007 states have (on average 1.3455809334657398) internal successors, (1355), 1007 states have internal predecessors, (1355), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 05:56:50,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 1021 states and 1379 transitions. [2024-10-11 05:56:50,824 INFO L78 Accepts]: Start accepts. Automaton has 1021 states and 1379 transitions. Word has length 340 [2024-10-11 05:56:50,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:50,825 INFO L471 AbstractCegarLoop]: Abstraction has 1021 states and 1379 transitions. [2024-10-11 05:56:50,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 28.333333333333332) internal successors, (255), 9 states have internal predecessors, (255), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 05:56:50,825 INFO L276 IsEmpty]: Start isEmpty. Operand 1021 states and 1379 transitions. [2024-10-11 05:56:50,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2024-10-11 05:56:50,828 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:50,828 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:56:50,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 05:56:51,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2024-10-11 05:56:51,033 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:51,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:51,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1627115852, now seen corresponding path program 1 times [2024-10-11 05:56:51,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:51,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720133244] [2024-10-11 05:56:51,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:51,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:51,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:52,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 05:56:52,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:52,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 05:56:52,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:52,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 05:56:52,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:52,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2024-10-11 05:56:52,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:52,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2024-10-11 05:56:52,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:52,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2024-10-11 05:56:52,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:52,150 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-10-11 05:56:52,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:52,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720133244] [2024-10-11 05:56:52,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720133244] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:52,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:52,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:56:52,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332677024] [2024-10-11 05:56:52,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:52,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:56:52,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:52,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:56:52,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:56:52,155 INFO L87 Difference]: Start difference. First operand 1021 states and 1379 transitions. Second operand has 7 states, 7 states have (on average 37.57142857142857) internal successors, (263), 7 states have internal predecessors, (263), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:56:52,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:52,604 INFO L93 Difference]: Finished difference Result 1811 states and 2434 transitions. [2024-10-11 05:56:52,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 05:56:52,604 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 37.57142857142857) internal successors, (263), 7 states have internal predecessors, (263), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 344 [2024-10-11 05:56:52,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:52,607 INFO L225 Difference]: With dead ends: 1811 [2024-10-11 05:56:52,607 INFO L226 Difference]: Without dead ends: 1037 [2024-10-11 05:56:52,608 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-11 05:56:52,608 INFO L432 NwaCegarLoop]: 387 mSDtfsCounter, 526 mSDsluCounter, 1162 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 1549 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:52,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 1549 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 643 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 05:56:52,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states. [2024-10-11 05:56:52,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 1029. [2024-10-11 05:56:52,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1029 states, 1015 states have (on average 1.3389162561576355) internal successors, (1359), 1015 states have internal predecessors, (1359), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 05:56:52,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1383 transitions. [2024-10-11 05:56:52,625 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 1383 transitions. Word has length 344 [2024-10-11 05:56:52,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:52,625 INFO L471 AbstractCegarLoop]: Abstraction has 1029 states and 1383 transitions. [2024-10-11 05:56:52,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 37.57142857142857) internal successors, (263), 7 states have internal predecessors, (263), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:56:52,625 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1383 transitions. [2024-10-11 05:56:52,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2024-10-11 05:56:52,627 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:52,627 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:56:52,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-10-11 05:56:52,628 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:52,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:52,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1110469900, now seen corresponding path program 1 times [2024-10-11 05:56:52,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:52,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618618391] [2024-10-11 05:56:52,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:52,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:53,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:54,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 05:56:54,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:54,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 05:56:54,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:54,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 05:56:54,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:54,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2024-10-11 05:56:54,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:54,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2024-10-11 05:56:54,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:54,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2024-10-11 05:56:54,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:54,950 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-10-11 05:56:54,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:54,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618618391] [2024-10-11 05:56:54,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618618391] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:54,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:54,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 05:56:54,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807572659] [2024-10-11 05:56:54,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:54,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 05:56:54,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:54,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 05:56:54,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-11 05:56:54,952 INFO L87 Difference]: Start difference. First operand 1029 states and 1383 transitions. Second operand has 9 states, 9 states have (on average 30.666666666666668) internal successors, (276), 9 states have internal predecessors, (276), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-11 05:56:56,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:56,422 INFO L93 Difference]: Finished difference Result 2449 states and 3254 transitions. [2024-10-11 05:56:56,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 05:56:56,423 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 30.666666666666668) internal successors, (276), 9 states have internal predecessors, (276), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 346 [2024-10-11 05:56:56,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:56,432 INFO L225 Difference]: With dead ends: 2449 [2024-10-11 05:56:56,433 INFO L226 Difference]: Without dead ends: 1733 [2024-10-11 05:56:56,434 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-10-11 05:56:56,435 INFO L432 NwaCegarLoop]: 603 mSDtfsCounter, 847 mSDsluCounter, 2749 mSDsCounter, 0 mSdLazyCounter, 1526 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 848 SdHoareTripleChecker+Valid, 3352 SdHoareTripleChecker+Invalid, 1528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:56,435 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [848 Valid, 3352 Invalid, 1528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1526 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 05:56:56,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1733 states. [2024-10-11 05:56:56,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1733 to 1117. [2024-10-11 05:56:56,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1117 states, 1099 states have (on average 1.3421292083712466) internal successors, (1475), 1099 states have internal predecessors, (1475), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 05:56:56,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1117 states to 1117 states and 1507 transitions. [2024-10-11 05:56:56,458 INFO L78 Accepts]: Start accepts. Automaton has 1117 states and 1507 transitions. Word has length 346 [2024-10-11 05:56:56,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:56,458 INFO L471 AbstractCegarLoop]: Abstraction has 1117 states and 1507 transitions. [2024-10-11 05:56:56,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 30.666666666666668) internal successors, (276), 9 states have internal predecessors, (276), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-11 05:56:56,458 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 1507 transitions. [2024-10-11 05:56:56,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2024-10-11 05:56:56,460 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:56,460 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:56:56,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-10-11 05:56:56,461 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:56,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:56,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1744261870, now seen corresponding path program 1 times [2024-10-11 05:56:56,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:56,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259927212] [2024-10-11 05:56:56,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:56,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:57,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:57,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 05:56:57,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:57,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 05:56:57,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:57,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 05:56:57,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:57,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2024-10-11 05:56:57,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:57,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2024-10-11 05:56:57,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:57,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2024-10-11 05:56:57,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:56:57,678 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2024-10-11 05:56:57,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:56:57,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259927212] [2024-10-11 05:56:57,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259927212] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:56:57,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:56:57,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:56:57,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922470325] [2024-10-11 05:56:57,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:56:57,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:56:57,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:56:57,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:56:57,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:56:57,680 INFO L87 Difference]: Start difference. First operand 1117 states and 1507 transitions. Second operand has 6 states, 6 states have (on average 44.333333333333336) internal successors, (266), 6 states have internal predecessors, (266), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:56:58,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:56:58,132 INFO L93 Difference]: Finished difference Result 1959 states and 2633 transitions. [2024-10-11 05:56:58,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 05:56:58,133 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 44.333333333333336) internal successors, (266), 6 states have internal predecessors, (266), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 348 [2024-10-11 05:56:58,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:56:58,135 INFO L225 Difference]: With dead ends: 1959 [2024-10-11 05:56:58,135 INFO L226 Difference]: Without dead ends: 1125 [2024-10-11 05:56:58,136 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-11 05:56:58,137 INFO L432 NwaCegarLoop]: 387 mSDtfsCounter, 485 mSDsluCounter, 1156 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 1543 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 05:56:58,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 1543 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 643 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 05:56:58,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2024-10-11 05:56:58,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 1121. [2024-10-11 05:56:58,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1121 states, 1103 states have (on average 1.3372620126926564) internal successors, (1475), 1103 states have internal predecessors, (1475), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 05:56:58,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 1507 transitions. [2024-10-11 05:56:58,154 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 1507 transitions. Word has length 348 [2024-10-11 05:56:58,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:56:58,155 INFO L471 AbstractCegarLoop]: Abstraction has 1121 states and 1507 transitions. [2024-10-11 05:56:58,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 44.333333333333336) internal successors, (266), 6 states have internal predecessors, (266), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:56:58,155 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1507 transitions. [2024-10-11 05:56:58,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2024-10-11 05:56:58,157 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:56:58,157 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:56:58,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-10-11 05:56:58,157 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:56:58,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:56:58,158 INFO L85 PathProgramCache]: Analyzing trace with hash 702549830, now seen corresponding path program 1 times [2024-10-11 05:56:58,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:56:58,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68418777] [2024-10-11 05:56:58,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:56:58,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:56:58,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:00,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 05:57:00,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:00,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 05:57:00,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:00,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 05:57:00,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:00,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2024-10-11 05:57:00,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:00,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2024-10-11 05:57:00,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:00,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 284 [2024-10-11 05:57:00,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:00,151 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 4 proven. 86 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 05:57:00,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:57:00,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68418777] [2024-10-11 05:57:00,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68418777] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 05:57:00,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1357325865] [2024-10-11 05:57:00,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:57:00,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:57:00,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:57:00,153 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 05:57:00,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 05:57:01,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:01,178 INFO L255 TraceCheckSpWp]: Trace formula consists of 2051 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-11 05:57:01,185 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:57:01,373 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 05:57:01,373 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 05:57:01,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1357325865] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:57:01,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 05:57:01,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2024-10-11 05:57:01,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580561422] [2024-10-11 05:57:01,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:57:01,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 05:57:01,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:57:01,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 05:57:01,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2024-10-11 05:57:01,375 INFO L87 Difference]: Start difference. First operand 1121 states and 1507 transitions. Second operand has 8 states, 8 states have (on average 40.125) internal successors, (321), 8 states have internal predecessors, (321), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 05:57:01,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:57:01,970 INFO L93 Difference]: Finished difference Result 2496 states and 3363 transitions. [2024-10-11 05:57:01,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:57:01,971 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 40.125) internal successors, (321), 8 states have internal predecessors, (321), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 348 [2024-10-11 05:57:01,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:57:01,979 INFO L225 Difference]: With dead ends: 2496 [2024-10-11 05:57:01,983 INFO L226 Difference]: Without dead ends: 1949 [2024-10-11 05:57:01,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 354 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2024-10-11 05:57:01,986 INFO L432 NwaCegarLoop]: 393 mSDtfsCounter, 1691 mSDsluCounter, 1566 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1697 SdHoareTripleChecker+Valid, 1959 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 05:57:01,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1697 Valid, 1959 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 784 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 05:57:01,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1949 states. [2024-10-11 05:57:02,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1949 to 1603. [2024-10-11 05:57:02,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1603 states, 1573 states have (on average 1.319135410044501) internal successors, (2075), 1573 states have internal predecessors, (2075), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-11 05:57:02,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2131 transitions. [2024-10-11 05:57:02,067 INFO L78 Accepts]: Start accepts. Automaton has 1603 states and 2131 transitions. Word has length 348 [2024-10-11 05:57:02,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:57:02,067 INFO L471 AbstractCegarLoop]: Abstraction has 1603 states and 2131 transitions. [2024-10-11 05:57:02,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 40.125) internal successors, (321), 8 states have internal predecessors, (321), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 05:57:02,069 INFO L276 IsEmpty]: Start isEmpty. Operand 1603 states and 2131 transitions. [2024-10-11 05:57:02,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2024-10-11 05:57:02,075 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:57:02,075 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:57:02,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 05:57:02,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:57:02,277 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:57:02,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:57:02,278 INFO L85 PathProgramCache]: Analyzing trace with hash 37067651, now seen corresponding path program 1 times [2024-10-11 05:57:02,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:57:02,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505110004] [2024-10-11 05:57:02,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:57:02,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:57:02,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:03,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 05:57:03,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:03,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 05:57:03,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:03,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 05:57:03,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:03,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2024-10-11 05:57:03,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:03,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2024-10-11 05:57:03,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:03,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 284 [2024-10-11 05:57:03,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:03,191 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2024-10-11 05:57:03,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:57:03,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505110004] [2024-10-11 05:57:03,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505110004] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:57:03,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:57:03,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:57:03,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191430699] [2024-10-11 05:57:03,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:57:03,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:57:03,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:57:03,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:57:03,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:57:03,198 INFO L87 Difference]: Start difference. First operand 1603 states and 2131 transitions. Second operand has 5 states, 5 states have (on average 56.8) internal successors, (284), 5 states have internal predecessors, (284), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 05:57:03,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:57:03,254 INFO L93 Difference]: Finished difference Result 2476 states and 3302 transitions. [2024-10-11 05:57:03,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 05:57:03,255 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 56.8) internal successors, (284), 5 states have internal predecessors, (284), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 348 [2024-10-11 05:57:03,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:57:03,258 INFO L225 Difference]: With dead ends: 2476 [2024-10-11 05:57:03,259 INFO L226 Difference]: Without dead ends: 1743 [2024-10-11 05:57:03,260 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:57:03,261 INFO L432 NwaCegarLoop]: 542 mSDtfsCounter, 16 mSDsluCounter, 1617 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 2159 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:57:03,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 2159 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:57:03,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1743 states. [2024-10-11 05:57:03,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1743 to 1743. [2024-10-11 05:57:03,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1743 states, 1713 states have (on average 1.328079392877992) internal successors, (2275), 1713 states have internal predecessors, (2275), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-11 05:57:03,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1743 states to 1743 states and 2331 transitions. [2024-10-11 05:57:03,358 INFO L78 Accepts]: Start accepts. Automaton has 1743 states and 2331 transitions. Word has length 348 [2024-10-11 05:57:03,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:57:03,362 INFO L471 AbstractCegarLoop]: Abstraction has 1743 states and 2331 transitions. [2024-10-11 05:57:03,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 56.8) internal successors, (284), 5 states have internal predecessors, (284), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 05:57:03,362 INFO L276 IsEmpty]: Start isEmpty. Operand 1743 states and 2331 transitions. [2024-10-11 05:57:03,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2024-10-11 05:57:03,370 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:57:03,370 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:57:03,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-10-11 05:57:03,371 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:57:03,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:57:03,371 INFO L85 PathProgramCache]: Analyzing trace with hash 671402407, now seen corresponding path program 1 times [2024-10-11 05:57:03,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:57:03,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647607539] [2024-10-11 05:57:03,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:57:03,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:57:04,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:06,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 05:57:06,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:06,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 05:57:06,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:06,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 05:57:06,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:06,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-10-11 05:57:06,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:06,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2024-10-11 05:57:06,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:06,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2024-10-11 05:57:06,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:06,272 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 4 proven. 86 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 05:57:06,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:57:06,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647607539] [2024-10-11 05:57:06,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647607539] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 05:57:06,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1742519191] [2024-10-11 05:57:06,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:57:06,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:57:06,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:57:06,276 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 05:57:06,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 05:57:07,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:07,477 INFO L255 TraceCheckSpWp]: Trace formula consists of 2054 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 05:57:07,486 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:57:07,568 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-10-11 05:57:07,568 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 05:57:07,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1742519191] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:57:07,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 05:57:07,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15 [2024-10-11 05:57:07,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225875117] [2024-10-11 05:57:07,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:57:07,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:57:07,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:57:07,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:57:07,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2024-10-11 05:57:07,569 INFO L87 Difference]: Start difference. First operand 1743 states and 2331 transitions. Second operand has 6 states, 5 states have (on average 59.2) internal successors, (296), 6 states have internal predecessors, (296), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 05:57:07,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:57:07,624 INFO L93 Difference]: Finished difference Result 2870 states and 3820 transitions. [2024-10-11 05:57:07,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 05:57:07,625 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 59.2) internal successors, (296), 6 states have internal predecessors, (296), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 349 [2024-10-11 05:57:07,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:57:07,630 INFO L225 Difference]: With dead ends: 2870 [2024-10-11 05:57:07,631 INFO L226 Difference]: Without dead ends: 1743 [2024-10-11 05:57:07,633 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 357 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2024-10-11 05:57:07,633 INFO L432 NwaCegarLoop]: 542 mSDtfsCounter, 0 mSDsluCounter, 2151 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2693 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:57:07,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2693 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:57:07,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1743 states. [2024-10-11 05:57:07,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1743 to 1743. [2024-10-11 05:57:07,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1743 states, 1713 states have (on average 1.3239929947460596) internal successors, (2268), 1713 states have internal predecessors, (2268), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-11 05:57:07,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1743 states to 1743 states and 2324 transitions. [2024-10-11 05:57:07,672 INFO L78 Accepts]: Start accepts. Automaton has 1743 states and 2324 transitions. Word has length 349 [2024-10-11 05:57:07,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:57:07,672 INFO L471 AbstractCegarLoop]: Abstraction has 1743 states and 2324 transitions. [2024-10-11 05:57:07,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 59.2) internal successors, (296), 6 states have internal predecessors, (296), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 05:57:07,673 INFO L276 IsEmpty]: Start isEmpty. Operand 1743 states and 2324 transitions. [2024-10-11 05:57:07,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2024-10-11 05:57:07,676 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:57:07,676 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:57:07,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 05:57:07,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2024-10-11 05:57:07,881 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:57:07,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:57:07,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1158683043, now seen corresponding path program 1 times [2024-10-11 05:57:07,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:57:07,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943808301] [2024-10-11 05:57:07,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:57:07,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:57:08,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:10,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 05:57:10,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:10,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 05:57:10,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:10,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 05:57:10,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:10,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-10-11 05:57:10,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:10,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2024-10-11 05:57:10,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:10,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2024-10-11 05:57:10,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:57:10,531 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 05:57:10,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:57:10,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943808301] [2024-10-11 05:57:10,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943808301] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:57:10,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:57:10,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 05:57:10,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462408311] [2024-10-11 05:57:10,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:57:10,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 05:57:10,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:57:10,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 05:57:10,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-11 05:57:10,534 INFO L87 Difference]: Start difference. First operand 1743 states and 2324 transitions. Second operand has 9 states, 9 states have (on average 36.0) internal successors, (324), 9 states have internal predecessors, (324), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-11 05:57:11,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:57:11,570 INFO L93 Difference]: Finished difference Result 3369 states and 4471 transitions. [2024-10-11 05:57:11,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 05:57:11,571 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 36.0) internal successors, (324), 9 states have internal predecessors, (324), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 351 [2024-10-11 05:57:11,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:57:11,574 INFO L225 Difference]: With dead ends: 3369 [2024-10-11 05:57:11,575 INFO L226 Difference]: Without dead ends: 2830 [2024-10-11 05:57:11,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2024-10-11 05:57:11,576 INFO L432 NwaCegarLoop]: 577 mSDtfsCounter, 824 mSDsluCounter, 2658 mSDsCounter, 0 mSdLazyCounter, 1467 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 825 SdHoareTripleChecker+Valid, 3235 SdHoareTripleChecker+Invalid, 1473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 05:57:11,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [825 Valid, 3235 Invalid, 1473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1467 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 05:57:11,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2830 states. [2024-10-11 05:57:11,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2830 to 2582. [2024-10-11 05:57:11,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2582 states, 2545 states have (on average 1.3072691552062867) internal successors, (3327), 2545 states have internal predecessors, (3327), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-11 05:57:11,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2582 states to 2582 states and 3397 transitions. [2024-10-11 05:57:11,618 INFO L78 Accepts]: Start accepts. Automaton has 2582 states and 3397 transitions. Word has length 351 [2024-10-11 05:57:11,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:57:11,618 INFO L471 AbstractCegarLoop]: Abstraction has 2582 states and 3397 transitions. [2024-10-11 05:57:11,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 36.0) internal successors, (324), 9 states have internal predecessors, (324), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-11 05:57:11,619 INFO L276 IsEmpty]: Start isEmpty. Operand 2582 states and 3397 transitions. [2024-10-11 05:57:11,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2024-10-11 05:57:11,632 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:57:11,632 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:57:11,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-10-11 05:57:11,633 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:57:11,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:57:11,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1282325658, now seen corresponding path program 1 times [2024-10-11 05:57:11,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:57:11,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171768086] [2024-10-11 05:57:11,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:57:11,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:57:12,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat