./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.5_overflow.ufo.UNBOUNDED.pals+Problem12_label04.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.5_overflow.ufo.UNBOUNDED.pals+Problem12_label04.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4243fe6692f4db96df8f6b90dae65e2f8a23804630be612d5daf50a5894e5fe2 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 00:56:10,903 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 00:56:10,963 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 00:56:10,967 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 00:56:10,969 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 00:56:10,999 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 00:56:11,001 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 00:56:11,002 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 00:56:11,003 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 00:56:11,006 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 00:56:11,007 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 00:56:11,007 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 00:56:11,007 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 00:56:11,008 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 00:56:11,008 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 00:56:11,008 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 00:56:11,010 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 00:56:11,011 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 00:56:11,011 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 00:56:11,011 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 00:56:11,011 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 00:56:11,012 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 00:56:11,013 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 00:56:11,013 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 00:56:11,013 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 00:56:11,013 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 00:56:11,014 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 00:56:11,014 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 00:56:11,014 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 00:56:11,014 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 00:56:11,015 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 00:56:11,015 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 00:56:11,016 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:56:11,016 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 00:56:11,016 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 00:56:11,016 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 00:56:11,016 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 00:56:11,017 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 00:56:11,017 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 00:56:11,017 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 00:56:11,017 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 00:56:11,018 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 00:56:11,019 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4243fe6692f4db96df8f6b90dae65e2f8a23804630be612d5daf50a5894e5fe2 [2024-11-10 00:56:11,288 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 00:56:11,312 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 00:56:11,316 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 00:56:11,317 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 00:56:11,317 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 00:56:11,318 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.5_overflow.ufo.UNBOUNDED.pals+Problem12_label04.c [2024-11-10 00:56:12,737 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 00:56:13,220 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 00:56:13,221 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5_overflow.ufo.UNBOUNDED.pals+Problem12_label04.c [2024-11-10 00:56:13,265 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff6dfd044/c4f356c10c54497997282836e608e1c4/FLAGe06a7010a [2024-11-10 00:56:13,282 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff6dfd044/c4f356c10c54497997282836e608e1c4 [2024-11-10 00:56:13,285 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 00:56:13,287 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 00:56:13,291 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 00:56:13,291 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 00:56:13,297 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 00:56:13,298 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:56:13" (1/1) ... [2024-11-10 00:56:13,299 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30bd7320 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:56:13, skipping insertion in model container [2024-11-10 00:56:13,299 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:56:13" (1/1) ... [2024-11-10 00:56:13,461 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 00:56:13,848 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5_overflow.ufo.UNBOUNDED.pals+Problem12_label04.c[11742,11755] [2024-11-10 00:56:13,910 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5_overflow.ufo.UNBOUNDED.pals+Problem12_label04.c[18803,18816] [2024-11-10 00:56:14,578 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:56:14,591 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 00:56:14,631 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5_overflow.ufo.UNBOUNDED.pals+Problem12_label04.c[11742,11755] [2024-11-10 00:56:14,648 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5_overflow.ufo.UNBOUNDED.pals+Problem12_label04.c[18803,18816] [2024-11-10 00:56:15,029 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:56:15,057 INFO L204 MainTranslator]: Completed translation [2024-11-10 00:56:15,058 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:56:15 WrapperNode [2024-11-10 00:56:15,058 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 00:56:15,059 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 00:56:15,059 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 00:56:15,059 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 00:56:15,068 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:56:15" (1/1) ... [2024-11-10 00:56:15,133 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:56:15" (1/1) ... [2024-11-10 00:56:15,472 INFO L138 Inliner]: procedures = 37, calls = 22, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 5093 [2024-11-10 00:56:15,472 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 00:56:15,473 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 00:56:15,473 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 00:56:15,473 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 00:56:15,484 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:56:15" (1/1) ... [2024-11-10 00:56:15,484 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:56:15" (1/1) ... [2024-11-10 00:56:15,539 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:56:15" (1/1) ... [2024-11-10 00:56:15,757 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 00:56:15,757 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:56:15" (1/1) ... [2024-11-10 00:56:15,758 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:56:15" (1/1) ... [2024-11-10 00:56:15,904 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:56:15" (1/1) ... [2024-11-10 00:56:15,940 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:56:15" (1/1) ... [2024-11-10 00:56:15,961 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:56:15" (1/1) ... [2024-11-10 00:56:15,979 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:56:15" (1/1) ... [2024-11-10 00:56:16,028 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 00:56:16,106 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 00:56:16,107 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 00:56:16,107 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 00:56:16,108 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:56:15" (1/1) ... [2024-11-10 00:56:16,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:56:16,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:56:16,151 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 00:56:16,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 00:56:16,195 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 00:56:16,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 00:56:16,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 00:56:16,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 00:56:16,309 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 00:56:16,311 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 00:56:21,615 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2128: havoc calculate_output_#t~ret37#1; [2024-11-10 00:56:21,616 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3607: havoc calculate_output2_#t~ret38#1; [2024-11-10 00:56:21,617 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L5097: havoc calculate_output3_#t~ret39#1; [2024-11-10 00:56:21,902 INFO L? ?]: Removed 2081 outVars from TransFormulas that were not future-live. [2024-11-10 00:56:21,902 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 00:56:21,940 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 00:56:21,940 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 00:56:21,941 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:56:21 BoogieIcfgContainer [2024-11-10 00:56:21,941 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 00:56:21,944 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 00:56:21,944 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 00:56:21,948 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 00:56:21,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:56:13" (1/3) ... [2024-11-10 00:56:21,949 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52b74406 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:56:21, skipping insertion in model container [2024-11-10 00:56:21,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:56:15" (2/3) ... [2024-11-10 00:56:21,949 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52b74406 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:56:21, skipping insertion in model container [2024-11-10 00:56:21,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:56:21" (3/3) ... [2024-11-10 00:56:21,952 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.5_overflow.ufo.UNBOUNDED.pals+Problem12_label04.c [2024-11-10 00:56:21,970 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 00:56:21,970 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 00:56:22,068 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 00:56:22,074 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;@6ce2e722, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 00:56:22,075 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-10 00:56:22,083 INFO L276 IsEmpty]: Start isEmpty. Operand has 906 states, 903 states have (on average 2.6511627906976742) internal successors, (2394), 905 states have internal predecessors, (2394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:22,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-10 00:56:22,090 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:56:22,091 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:56:22,091 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:56:22,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:56:22,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1826649402, now seen corresponding path program 1 times [2024-11-10 00:56:22,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:56:22,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021948172] [2024-11-10 00:56:22,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:22,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:56:22,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:22,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:56:22,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:56:22,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021948172] [2024-11-10 00:56:22,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021948172] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:56:22,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:56:22,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 00:56:22,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865040642] [2024-11-10 00:56:22,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:56:22,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 00:56:22,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:56:22,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 00:56:22,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 00:56:22,374 INFO L87 Difference]: Start difference. First operand has 906 states, 903 states have (on average 2.6511627906976742) internal successors, (2394), 905 states have internal predecessors, (2394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:22,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:56:22,460 INFO L93 Difference]: Finished difference Result 1771 states and 4714 transitions. [2024-11-10 00:56:22,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 00:56:22,466 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-10 00:56:22,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:56:22,487 INFO L225 Difference]: With dead ends: 1771 [2024-11-10 00:56:22,487 INFO L226 Difference]: Without dead ends: 838 [2024-11-10 00:56:22,497 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 00:56:22,500 INFO L432 NwaCegarLoop]: 2323 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2323 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:56:22,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2323 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:56:22,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2024-11-10 00:56:22,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2024-11-10 00:56:22,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 836 states have (on average 2.702153110047847) internal successors, (2259), 837 states have internal predecessors, (2259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:22,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 2259 transitions. [2024-11-10 00:56:22,597 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 2259 transitions. Word has length 26 [2024-11-10 00:56:22,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:56:22,597 INFO L471 AbstractCegarLoop]: Abstraction has 838 states and 2259 transitions. [2024-11-10 00:56:22,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:22,597 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 2259 transitions. [2024-11-10 00:56:22,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-10 00:56:22,599 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:56:22,599 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:56:22,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 00:56:22,599 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:56:22,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:56:22,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1417825177, now seen corresponding path program 1 times [2024-11-10 00:56:22,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:56:22,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428344725] [2024-11-10 00:56:22,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:22,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:56:22,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:22,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:56:22,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:56:22,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428344725] [2024-11-10 00:56:22,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428344725] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:56:22,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:56:22,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:56:22,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016373077] [2024-11-10 00:56:22,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:56:22,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:56:22,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:56:22,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:56:22,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:56:22,848 INFO L87 Difference]: Start difference. First operand 838 states and 2259 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:23,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:56:23,019 INFO L93 Difference]: Finished difference Result 887 states and 2333 transitions. [2024-11-10 00:56:23,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:56:23,020 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-10 00:56:23,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:56:23,026 INFO L225 Difference]: With dead ends: 887 [2024-11-10 00:56:23,026 INFO L226 Difference]: Without dead ends: 838 [2024-11-10 00:56:23,026 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-11-10 00:56:23,028 INFO L432 NwaCegarLoop]: 2257 mSDtfsCounter, 0 mSDsluCounter, 6735 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8992 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:56:23,029 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8992 Invalid, 43 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [30 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:56:23,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2024-11-10 00:56:23,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2024-11-10 00:56:23,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 836 states have (on average 2.665071770334928) internal successors, (2228), 837 states have internal predecessors, (2228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:23,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 2228 transitions. [2024-11-10 00:56:23,057 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 2228 transitions. Word has length 26 [2024-11-10 00:56:23,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:56:23,058 INFO L471 AbstractCegarLoop]: Abstraction has 838 states and 2228 transitions. [2024-11-10 00:56:23,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:23,059 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 2228 transitions. [2024-11-10 00:56:23,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-10 00:56:23,061 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:56:23,061 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:56:23,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 00:56:23,062 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:56:23,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:56:23,063 INFO L85 PathProgramCache]: Analyzing trace with hash -2138475845, now seen corresponding path program 1 times [2024-11-10 00:56:23,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:56:23,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713628390] [2024-11-10 00:56:23,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:23,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:56:23,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:23,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:56:23,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:56:23,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713628390] [2024-11-10 00:56:23,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713628390] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:56:23,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:56:23,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 00:56:23,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925856772] [2024-11-10 00:56:23,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:56:23,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:56:23,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:56:23,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:56:23,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:56:23,292 INFO L87 Difference]: Start difference. First operand 838 states and 2228 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:23,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:56:23,618 INFO L93 Difference]: Finished difference Result 1288 states and 2928 transitions. [2024-11-10 00:56:23,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 00:56:23,620 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2024-11-10 00:56:23,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:56:23,628 INFO L225 Difference]: With dead ends: 1288 [2024-11-10 00:56:23,628 INFO L226 Difference]: Without dead ends: 1243 [2024-11-10 00:56:23,630 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2024-11-10 00:56:23,631 INFO L432 NwaCegarLoop]: 2222 mSDtfsCounter, 11386 mSDsluCounter, 1156 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11386 SdHoareTripleChecker+Valid, 3378 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 00:56:23,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11386 Valid, 3378 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 00:56:23,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1243 states. [2024-11-10 00:56:23,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1243 to 880. [2024-11-10 00:56:23,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 880 states, 878 states have (on average 2.612756264236902) internal successors, (2294), 879 states have internal predecessors, (2294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:23,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 2294 transitions. [2024-11-10 00:56:23,665 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 2294 transitions. Word has length 56 [2024-11-10 00:56:23,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:56:23,666 INFO L471 AbstractCegarLoop]: Abstraction has 880 states and 2294 transitions. [2024-11-10 00:56:23,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:23,666 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 2294 transitions. [2024-11-10 00:56:23,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-10 00:56:23,672 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:56:23,672 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:56:23,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 00:56:23,673 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:56:23,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:56:23,674 INFO L85 PathProgramCache]: Analyzing trace with hash 208440989, now seen corresponding path program 1 times [2024-11-10 00:56:23,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:56:23,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635288306] [2024-11-10 00:56:23,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:23,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:56:23,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:24,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:56:24,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:56:24,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635288306] [2024-11-10 00:56:24,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635288306] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:56:24,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:56:24,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 00:56:24,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581638283] [2024-11-10 00:56:24,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:56:24,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:56:24,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:56:24,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:56:24,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:56:24,032 INFO L87 Difference]: Start difference. First operand 880 states and 2294 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:24,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:56:24,239 INFO L93 Difference]: Finished difference Result 970 states and 2432 transitions. [2024-11-10 00:56:24,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 00:56:24,239 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2024-11-10 00:56:24,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:56:24,244 INFO L225 Difference]: With dead ends: 970 [2024-11-10 00:56:24,244 INFO L226 Difference]: Without dead ends: 883 [2024-11-10 00:56:24,247 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2024-11-10 00:56:24,247 INFO L432 NwaCegarLoop]: 2221 mSDtfsCounter, 6531 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6531 SdHoareTripleChecker+Valid, 2486 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:56:24,248 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6531 Valid, 2486 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:56:24,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2024-11-10 00:56:24,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 880. [2024-11-10 00:56:24,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 880 states, 878 states have (on average 2.611617312072893) internal successors, (2293), 879 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:24,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 2293 transitions. [2024-11-10 00:56:24,268 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 2293 transitions. Word has length 58 [2024-11-10 00:56:24,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:56:24,269 INFO L471 AbstractCegarLoop]: Abstraction has 880 states and 2293 transitions. [2024-11-10 00:56:24,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:24,269 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 2293 transitions. [2024-11-10 00:56:24,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-10 00:56:24,270 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:56:24,271 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:56:24,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 00:56:24,271 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:56:24,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:56:24,271 INFO L85 PathProgramCache]: Analyzing trace with hash -404444728, now seen corresponding path program 1 times [2024-11-10 00:56:24,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:56:24,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854349266] [2024-11-10 00:56:24,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:24,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:56:24,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:24,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:56:24,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:56:24,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854349266] [2024-11-10 00:56:24,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854349266] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:56:24,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:56:24,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:56:24,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868875686] [2024-11-10 00:56:24,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:56:24,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:56:24,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:56:24,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:56:24,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:56:24,358 INFO L87 Difference]: Start difference. First operand 880 states and 2293 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:24,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:56:24,392 INFO L93 Difference]: Finished difference Result 1042 states and 2543 transitions. [2024-11-10 00:56:24,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:56:24,393 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2024-11-10 00:56:24,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:56:24,398 INFO L225 Difference]: With dead ends: 1042 [2024-11-10 00:56:24,398 INFO L226 Difference]: Without dead ends: 955 [2024-11-10 00:56:24,401 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:56:24,402 INFO L432 NwaCegarLoop]: 2225 mSDtfsCounter, 2166 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2166 SdHoareTripleChecker+Valid, 2290 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:56:24,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2166 Valid, 2290 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:56:24,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2024-11-10 00:56:24,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 952. [2024-11-10 00:56:24,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 952 states, 950 states have (on average 2.5294736842105263) internal successors, (2403), 951 states have internal predecessors, (2403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:24,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 2403 transitions. [2024-11-10 00:56:24,426 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 2403 transitions. Word has length 59 [2024-11-10 00:56:24,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:56:24,427 INFO L471 AbstractCegarLoop]: Abstraction has 952 states and 2403 transitions. [2024-11-10 00:56:24,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:24,427 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 2403 transitions. [2024-11-10 00:56:24,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 00:56:24,428 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:56:24,429 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:56:24,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 00:56:24,429 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:56:24,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:56:24,430 INFO L85 PathProgramCache]: Analyzing trace with hash 788028767, now seen corresponding path program 1 times [2024-11-10 00:56:24,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:56:24,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734493515] [2024-11-10 00:56:24,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:24,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:56:24,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:24,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:56:24,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:56:24,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734493515] [2024-11-10 00:56:24,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734493515] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:56:24,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:56:24,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:56:24,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513805904] [2024-11-10 00:56:24,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:56:24,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:56:24,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:56:24,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:56:24,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:56:24,495 INFO L87 Difference]: Start difference. First operand 952 states and 2403 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:24,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:56:24,528 INFO L93 Difference]: Finished difference Result 1254 states and 2865 transitions. [2024-11-10 00:56:24,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:56:24,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-10 00:56:24,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:56:24,536 INFO L225 Difference]: With dead ends: 1254 [2024-11-10 00:56:24,537 INFO L226 Difference]: Without dead ends: 1095 [2024-11-10 00:56:24,538 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:56:24,539 INFO L432 NwaCegarLoop]: 2276 mSDtfsCounter, 2178 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2178 SdHoareTripleChecker+Valid, 2351 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:56:24,541 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2178 Valid, 2351 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:56:24,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2024-11-10 00:56:24,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 1092. [2024-11-10 00:56:24,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1092 states, 1090 states have (on average 2.398165137614679) internal successors, (2614), 1091 states have internal predecessors, (2614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:24,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1092 states to 1092 states and 2614 transitions. [2024-11-10 00:56:24,573 INFO L78 Accepts]: Start accepts. Automaton has 1092 states and 2614 transitions. Word has length 60 [2024-11-10 00:56:24,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:56:24,574 INFO L471 AbstractCegarLoop]: Abstraction has 1092 states and 2614 transitions. [2024-11-10 00:56:24,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:24,574 INFO L276 IsEmpty]: Start isEmpty. Operand 1092 states and 2614 transitions. [2024-11-10 00:56:24,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 00:56:24,575 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:56:24,575 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:56:24,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 00:56:24,576 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:56:24,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:56:24,576 INFO L85 PathProgramCache]: Analyzing trace with hash -213380961, now seen corresponding path program 1 times [2024-11-10 00:56:24,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:56:24,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145771394] [2024-11-10 00:56:24,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:24,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:56:24,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:24,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:56:24,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:56:24,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145771394] [2024-11-10 00:56:24,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145771394] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:56:24,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:56:24,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:56:24,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375296454] [2024-11-10 00:56:24,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:56:24,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:56:24,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:56:24,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:56:24,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:56:24,650 INFO L87 Difference]: Start difference. First operand 1092 states and 2614 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:24,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:56:24,684 INFO L93 Difference]: Finished difference Result 1658 states and 3470 transitions. [2024-11-10 00:56:24,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:56:24,685 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-10 00:56:24,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:56:24,692 INFO L225 Difference]: With dead ends: 1658 [2024-11-10 00:56:24,693 INFO L226 Difference]: Without dead ends: 1359 [2024-11-10 00:56:24,694 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:56:24,694 INFO L432 NwaCegarLoop]: 2274 mSDtfsCounter, 2176 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2176 SdHoareTripleChecker+Valid, 2353 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:56:24,696 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2176 Valid, 2353 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:56:24,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1359 states. [2024-11-10 00:56:24,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1359 to 1356. [2024-11-10 00:56:24,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1356 states, 1354 states have (on average 2.218611521418021) internal successors, (3004), 1355 states have internal predecessors, (3004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:24,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1356 states to 1356 states and 3004 transitions. [2024-11-10 00:56:24,784 INFO L78 Accepts]: Start accepts. Automaton has 1356 states and 3004 transitions. Word has length 60 [2024-11-10 00:56:24,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:56:24,785 INFO L471 AbstractCegarLoop]: Abstraction has 1356 states and 3004 transitions. [2024-11-10 00:56:24,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:24,785 INFO L276 IsEmpty]: Start isEmpty. Operand 1356 states and 3004 transitions. [2024-11-10 00:56:24,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 00:56:24,787 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:56:24,787 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:56:24,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 00:56:24,787 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:56:24,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:56:24,788 INFO L85 PathProgramCache]: Analyzing trace with hash -227830817, now seen corresponding path program 1 times [2024-11-10 00:56:24,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:56:24,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997497002] [2024-11-10 00:56:24,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:24,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:56:24,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:24,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:56:24,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:56:24,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997497002] [2024-11-10 00:56:24,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997497002] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:56:24,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:56:24,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:56:24,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195407587] [2024-11-10 00:56:24,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:56:24,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:56:24,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:56:24,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:56:24,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:56:24,846 INFO L87 Difference]: Start difference. First operand 1356 states and 3004 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:24,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:56:24,883 INFO L93 Difference]: Finished difference Result 2418 states and 4584 transitions. [2024-11-10 00:56:24,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:56:24,883 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-10 00:56:24,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:56:24,892 INFO L225 Difference]: With dead ends: 2418 [2024-11-10 00:56:24,892 INFO L226 Difference]: Without dead ends: 1855 [2024-11-10 00:56:24,894 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:56:24,895 INFO L432 NwaCegarLoop]: 2272 mSDtfsCounter, 2174 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2174 SdHoareTripleChecker+Valid, 2355 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:56:24,895 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2174 Valid, 2355 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:56:24,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1855 states. [2024-11-10 00:56:24,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1855 to 1852. [2024-11-10 00:56:24,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1852 states, 1850 states have (on average 2.0108108108108107) internal successors, (3720), 1851 states have internal predecessors, (3720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:24,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1852 states to 1852 states and 3720 transitions. [2024-11-10 00:56:24,944 INFO L78 Accepts]: Start accepts. Automaton has 1852 states and 3720 transitions. Word has length 60 [2024-11-10 00:56:24,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:56:24,945 INFO L471 AbstractCegarLoop]: Abstraction has 1852 states and 3720 transitions. [2024-11-10 00:56:24,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:24,945 INFO L276 IsEmpty]: Start isEmpty. Operand 1852 states and 3720 transitions. [2024-11-10 00:56:24,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 00:56:24,946 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:56:24,946 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:56:24,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 00:56:24,947 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:56:24,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:56:24,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1863771935, now seen corresponding path program 1 times [2024-11-10 00:56:24,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:56:24,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096219663] [2024-11-10 00:56:24,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:24,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:56:24,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:25,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:56:25,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:56:25,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096219663] [2024-11-10 00:56:25,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096219663] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:56:25,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:56:25,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:56:25,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991031783] [2024-11-10 00:56:25,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:56:25,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:56:25,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:56:25,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:56:25,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:56:25,033 INFO L87 Difference]: Start difference. First operand 1852 states and 3720 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:25,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:56:25,086 INFO L93 Difference]: Finished difference Result 3842 states and 6620 transitions. [2024-11-10 00:56:25,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:56:25,087 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-10 00:56:25,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:56:25,102 INFO L225 Difference]: With dead ends: 3842 [2024-11-10 00:56:25,102 INFO L226 Difference]: Without dead ends: 2783 [2024-11-10 00:56:25,105 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:56:25,106 INFO L432 NwaCegarLoop]: 2270 mSDtfsCounter, 2172 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2172 SdHoareTripleChecker+Valid, 2357 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:56:25,106 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2172 Valid, 2357 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:56:25,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2783 states. [2024-11-10 00:56:25,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2783 to 2780. [2024-11-10 00:56:25,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2780 states, 2778 states have (on average 1.80849532037437) internal successors, (5024), 2779 states have internal predecessors, (5024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:25,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2780 states to 2780 states and 5024 transitions. [2024-11-10 00:56:25,179 INFO L78 Accepts]: Start accepts. Automaton has 2780 states and 5024 transitions. Word has length 60 [2024-11-10 00:56:25,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:56:25,180 INFO L471 AbstractCegarLoop]: Abstraction has 2780 states and 5024 transitions. [2024-11-10 00:56:25,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:25,180 INFO L276 IsEmpty]: Start isEmpty. Operand 2780 states and 5024 transitions. [2024-11-10 00:56:25,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 00:56:25,181 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:56:25,181 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:56:25,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 00:56:25,181 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:56:25,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:56:25,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1339494880, now seen corresponding path program 1 times [2024-11-10 00:56:25,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:56:25,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442319551] [2024-11-10 00:56:25,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:25,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:56:25,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:25,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:56:25,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:56:25,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442319551] [2024-11-10 00:56:25,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442319551] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:56:25,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:56:25,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:56:25,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029417448] [2024-11-10 00:56:25,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:56:25,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:56:25,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:56:25,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:56:25,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:56:25,444 INFO L87 Difference]: Start difference. First operand 2780 states and 5024 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:25,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:56:25,560 INFO L93 Difference]: Finished difference Result 2879 states and 5154 transitions. [2024-11-10 00:56:25,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:56:25,561 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-10 00:56:25,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:56:25,572 INFO L225 Difference]: With dead ends: 2879 [2024-11-10 00:56:25,573 INFO L226 Difference]: Without dead ends: 2876 [2024-11-10 00:56:25,574 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:56:25,575 INFO L432 NwaCegarLoop]: 2222 mSDtfsCounter, 0 mSDsluCounter, 13319 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15541 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:56:25,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 15541 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:56:25,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2876 states. [2024-11-10 00:56:25,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2876 to 2876. [2024-11-10 00:56:25,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2876 states, 2874 states have (on average 1.7759220598469032) internal successors, (5104), 2875 states have internal predecessors, (5104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:25,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2876 states to 2876 states and 5104 transitions. [2024-11-10 00:56:25,663 INFO L78 Accepts]: Start accepts. Automaton has 2876 states and 5104 transitions. Word has length 60 [2024-11-10 00:56:25,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:56:25,663 INFO L471 AbstractCegarLoop]: Abstraction has 2876 states and 5104 transitions. [2024-11-10 00:56:25,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:25,664 INFO L276 IsEmpty]: Start isEmpty. Operand 2876 states and 5104 transitions. [2024-11-10 00:56:25,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 00:56:25,666 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:56:25,666 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:56:25,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 00:56:25,668 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:56:25,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:56:25,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1070103071, now seen corresponding path program 1 times [2024-11-10 00:56:25,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:56:25,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915535640] [2024-11-10 00:56:25,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:25,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:56:25,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:25,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:56:25,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:56:25,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915535640] [2024-11-10 00:56:25,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915535640] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:56:25,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:56:25,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:56:25,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665426527] [2024-11-10 00:56:25,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:56:25,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:56:25,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:56:25,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:56:25,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:56:25,737 INFO L87 Difference]: Start difference. First operand 2876 states and 5104 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:25,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:56:25,805 INFO L93 Difference]: Finished difference Result 5125 states and 8312 transitions. [2024-11-10 00:56:25,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:56:25,806 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-10 00:56:25,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:56:25,822 INFO L225 Difference]: With dead ends: 5125 [2024-11-10 00:56:25,822 INFO L226 Difference]: Without dead ends: 3938 [2024-11-10 00:56:25,825 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:56:25,826 INFO L432 NwaCegarLoop]: 2282 mSDtfsCounter, 2180 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2180 SdHoareTripleChecker+Valid, 2353 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:56:25,827 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2180 Valid, 2353 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:56:25,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3938 states. [2024-11-10 00:56:25,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3938 to 3935. [2024-11-10 00:56:25,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3935 states, 3933 states have (on average 1.6687007373506229) internal successors, (6563), 3934 states have internal predecessors, (6563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:25,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3935 states to 3935 states and 6563 transitions. [2024-11-10 00:56:25,975 INFO L78 Accepts]: Start accepts. Automaton has 3935 states and 6563 transitions. Word has length 60 [2024-11-10 00:56:25,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:56:25,975 INFO L471 AbstractCegarLoop]: Abstraction has 3935 states and 6563 transitions. [2024-11-10 00:56:25,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:25,976 INFO L276 IsEmpty]: Start isEmpty. Operand 3935 states and 6563 transitions. [2024-11-10 00:56:25,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-10 00:56:25,977 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:56:25,978 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:56:25,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 00:56:25,978 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:56:25,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:56:25,979 INFO L85 PathProgramCache]: Analyzing trace with hash 795525352, now seen corresponding path program 1 times [2024-11-10 00:56:25,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:56:25,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116948761] [2024-11-10 00:56:25,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:25,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:56:25,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:26,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:56:26,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:56:26,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116948761] [2024-11-10 00:56:26,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116948761] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:56:26,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:56:26,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:56:26,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605025972] [2024-11-10 00:56:26,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:56:26,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 00:56:26,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:56:26,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 00:56:26,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 00:56:26,101 INFO L87 Difference]: Start difference. First operand 3935 states and 6563 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:33,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:56:33,737 INFO L93 Difference]: Finished difference Result 6194 states and 12916 transitions. [2024-11-10 00:56:33,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 00:56:33,738 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-11-10 00:56:33,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:56:33,775 INFO L225 Difference]: With dead ends: 6194 [2024-11-10 00:56:33,776 INFO L226 Difference]: Without dead ends: 5439 [2024-11-10 00:56:33,778 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:56:33,779 INFO L432 NwaCegarLoop]: 802 mSDtfsCounter, 4453 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 7874 mSolverCounterSat, 1245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4453 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 9119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1245 IncrementalHoareTripleChecker+Valid, 7874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2024-11-10 00:56:33,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4453 Valid, 825 Invalid, 9119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1245 Valid, 7874 Invalid, 0 Unknown, 0 Unchecked, 7.4s Time] [2024-11-10 00:56:33,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5439 states. [2024-11-10 00:56:33,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5439 to 5439. [2024-11-10 00:56:33,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5439 states, 5437 states have (on average 1.8210410152657717) internal successors, (9901), 5438 states have internal predecessors, (9901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:33,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5439 states to 5439 states and 9901 transitions. [2024-11-10 00:56:33,965 INFO L78 Accepts]: Start accepts. Automaton has 5439 states and 9901 transitions. Word has length 63 [2024-11-10 00:56:33,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:56:33,965 INFO L471 AbstractCegarLoop]: Abstraction has 5439 states and 9901 transitions. [2024-11-10 00:56:33,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:33,966 INFO L276 IsEmpty]: Start isEmpty. Operand 5439 states and 9901 transitions. [2024-11-10 00:56:33,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-10 00:56:33,968 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:56:33,968 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:56:33,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 00:56:33,968 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:56:33,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:56:33,969 INFO L85 PathProgramCache]: Analyzing trace with hash 958545093, now seen corresponding path program 1 times [2024-11-10 00:56:33,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:56:33,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926334423] [2024-11-10 00:56:33,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:33,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:56:33,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:34,144 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-10 00:56:34,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:56:34,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926334423] [2024-11-10 00:56:34,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926334423] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:56:34,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:56:34,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 00:56:34,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314902955] [2024-11-10 00:56:34,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:56:34,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:56:34,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:56:34,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:56:34,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:56:34,146 INFO L87 Difference]: Start difference. First operand 5439 states and 9901 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:34,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:56:34,508 INFO L93 Difference]: Finished difference Result 21825 states and 32825 transitions. [2024-11-10 00:56:34,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 00:56:34,509 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-11-10 00:56:34,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:56:34,548 INFO L225 Difference]: With dead ends: 21825 [2024-11-10 00:56:34,548 INFO L226 Difference]: Without dead ends: 18686 [2024-11-10 00:56:34,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-10 00:56:34,560 INFO L432 NwaCegarLoop]: 2293 mSDtfsCounter, 9059 mSDsluCounter, 2708 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9059 SdHoareTripleChecker+Valid, 5001 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:56:34,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9059 Valid, 5001 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:56:34,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18686 states. [2024-11-10 00:56:34,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18686 to 8575. [2024-11-10 00:56:34,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8575 states, 8573 states have (on average 1.662545200046658) internal successors, (14253), 8574 states have internal predecessors, (14253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:34,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8575 states to 8575 states and 14253 transitions. [2024-11-10 00:56:34,832 INFO L78 Accepts]: Start accepts. Automaton has 8575 states and 14253 transitions. Word has length 81 [2024-11-10 00:56:34,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:56:34,833 INFO L471 AbstractCegarLoop]: Abstraction has 8575 states and 14253 transitions. [2024-11-10 00:56:34,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:34,833 INFO L276 IsEmpty]: Start isEmpty. Operand 8575 states and 14253 transitions. [2024-11-10 00:56:34,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-10 00:56:34,836 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:56:34,836 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:56:34,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 00:56:34,836 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:56:34,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:56:34,837 INFO L85 PathProgramCache]: Analyzing trace with hash -42864635, now seen corresponding path program 1 times [2024-11-10 00:56:34,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:56:34,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965178178] [2024-11-10 00:56:34,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:34,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:56:34,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:34,996 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-10 00:56:34,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:56:34,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965178178] [2024-11-10 00:56:34,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965178178] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:56:34,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:56:34,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 00:56:34,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445726326] [2024-11-10 00:56:34,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:56:34,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:56:34,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:56:34,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:56:34,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:56:34,999 INFO L87 Difference]: Start difference. First operand 8575 states and 14253 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:35,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:56:35,489 INFO L93 Difference]: Finished difference Result 24961 states and 37177 transitions. [2024-11-10 00:56:35,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 00:56:35,489 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-11-10 00:56:35,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:56:35,529 INFO L225 Difference]: With dead ends: 24961 [2024-11-10 00:56:35,529 INFO L226 Difference]: Without dead ends: 21822 [2024-11-10 00:56:35,540 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-10 00:56:35,540 INFO L432 NwaCegarLoop]: 2290 mSDtfsCounter, 9083 mSDsluCounter, 2646 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9083 SdHoareTripleChecker+Valid, 4936 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:56:35,541 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9083 Valid, 4936 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:56:35,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21822 states. [2024-11-10 00:56:35,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21822 to 13295. [2024-11-10 00:56:35,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13295 states, 13293 states have (on average 1.5608967125554802) internal successors, (20749), 13294 states have internal predecessors, (20749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:35,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13295 states to 13295 states and 20749 transitions. [2024-11-10 00:56:35,925 INFO L78 Accepts]: Start accepts. Automaton has 13295 states and 20749 transitions. Word has length 81 [2024-11-10 00:56:35,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:56:35,925 INFO L471 AbstractCegarLoop]: Abstraction has 13295 states and 20749 transitions. [2024-11-10 00:56:35,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:35,926 INFO L276 IsEmpty]: Start isEmpty. Operand 13295 states and 20749 transitions. [2024-11-10 00:56:35,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-10 00:56:35,928 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:56:35,928 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:56:35,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 00:56:35,929 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:56:35,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:56:35,929 INFO L85 PathProgramCache]: Analyzing trace with hash -57314491, now seen corresponding path program 1 times [2024-11-10 00:56:35,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:56:35,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246000492] [2024-11-10 00:56:35,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:35,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:56:35,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:36,079 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-10 00:56:36,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:56:36,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246000492] [2024-11-10 00:56:36,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246000492] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:56:36,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:56:36,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 00:56:36,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936141501] [2024-11-10 00:56:36,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:56:36,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:56:36,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:56:36,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:56:36,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:56:36,082 INFO L87 Difference]: Start difference. First operand 13295 states and 20749 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:36,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:56:36,687 INFO L93 Difference]: Finished difference Result 28097 states and 41529 transitions. [2024-11-10 00:56:36,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 00:56:36,688 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-11-10 00:56:36,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:56:36,734 INFO L225 Difference]: With dead ends: 28097 [2024-11-10 00:56:36,734 INFO L226 Difference]: Without dead ends: 24958 [2024-11-10 00:56:36,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-10 00:56:36,746 INFO L432 NwaCegarLoop]: 2287 mSDtfsCounter, 9118 mSDsluCounter, 2660 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9118 SdHoareTripleChecker+Valid, 4947 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:56:36,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9118 Valid, 4947 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:56:36,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24958 states. [2024-11-10 00:56:37,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24958 to 16431. [2024-11-10 00:56:37,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16431 states, 16429 states have (on average 1.5278470996408788) internal successors, (25101), 16430 states have internal predecessors, (25101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:37,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16431 states to 16431 states and 25101 transitions. [2024-11-10 00:56:37,179 INFO L78 Accepts]: Start accepts. Automaton has 16431 states and 25101 transitions. Word has length 81 [2024-11-10 00:56:37,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:56:37,179 INFO L471 AbstractCegarLoop]: Abstraction has 16431 states and 25101 transitions. [2024-11-10 00:56:37,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:37,180 INFO L276 IsEmpty]: Start isEmpty. Operand 16431 states and 25101 transitions. [2024-11-10 00:56:37,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-10 00:56:37,182 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:56:37,182 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:56:37,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 00:56:37,183 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:56:37,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:56:37,183 INFO L85 PathProgramCache]: Analyzing trace with hash 2034288261, now seen corresponding path program 1 times [2024-11-10 00:56:37,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:56:37,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160544283] [2024-11-10 00:56:37,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:37,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:56:37,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:37,330 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-10 00:56:37,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:56:37,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160544283] [2024-11-10 00:56:37,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160544283] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:56:37,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:56:37,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 00:56:37,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711666184] [2024-11-10 00:56:37,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:56:37,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:56:37,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:56:37,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:56:37,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:56:37,335 INFO L87 Difference]: Start difference. First operand 16431 states and 25101 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:38,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:56:38,101 INFO L93 Difference]: Finished difference Result 31233 states and 45881 transitions. [2024-11-10 00:56:38,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 00:56:38,101 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-11-10 00:56:38,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:56:38,159 INFO L225 Difference]: With dead ends: 31233 [2024-11-10 00:56:38,159 INFO L226 Difference]: Without dead ends: 28094 [2024-11-10 00:56:38,174 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-10 00:56:38,175 INFO L432 NwaCegarLoop]: 2297 mSDtfsCounter, 9066 mSDsluCounter, 2722 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9066 SdHoareTripleChecker+Valid, 5019 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:56:38,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9066 Valid, 5019 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:56:38,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28094 states. [2024-11-10 00:56:38,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28094 to 19567. [2024-11-10 00:56:38,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19567 states, 19565 states have (on average 1.5053922821364683) internal successors, (29453), 19566 states have internal predecessors, (29453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:38,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19567 states to 19567 states and 29453 transitions. [2024-11-10 00:56:38,717 INFO L78 Accepts]: Start accepts. Automaton has 19567 states and 29453 transitions. Word has length 81 [2024-11-10 00:56:38,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:56:38,717 INFO L471 AbstractCegarLoop]: Abstraction has 19567 states and 29453 transitions. [2024-11-10 00:56:38,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:38,718 INFO L276 IsEmpty]: Start isEmpty. Operand 19567 states and 29453 transitions. [2024-11-10 00:56:38,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-10 00:56:38,722 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:56:38,722 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:56:38,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 00:56:38,723 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:56:38,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:56:38,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1240619397, now seen corresponding path program 1 times [2024-11-10 00:56:38,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:56:38,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660296893] [2024-11-10 00:56:38,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:38,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:56:38,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:38,881 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 00:56:38,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:56:38,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660296893] [2024-11-10 00:56:38,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660296893] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:56:38,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:56:38,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 00:56:38,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740160481] [2024-11-10 00:56:38,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:56:38,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:56:38,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:56:38,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:56:38,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:56:38,884 INFO L87 Difference]: Start difference. First operand 19567 states and 29453 transitions. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:39,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:56:39,470 INFO L93 Difference]: Finished difference Result 32577 states and 47769 transitions. [2024-11-10 00:56:39,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 00:56:39,470 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-11-10 00:56:39,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:56:39,517 INFO L225 Difference]: With dead ends: 32577 [2024-11-10 00:56:39,517 INFO L226 Difference]: Without dead ends: 30334 [2024-11-10 00:56:39,532 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-10 00:56:39,532 INFO L432 NwaCegarLoop]: 2297 mSDtfsCounter, 9049 mSDsluCounter, 2828 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9049 SdHoareTripleChecker+Valid, 5125 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:56:39,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9049 Valid, 5125 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:56:39,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30334 states. [2024-11-10 00:56:40,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30334 to 21807. [2024-11-10 00:56:40,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21807 states, 21805 states have (on average 1.4945654666360926) internal successors, (32589), 21806 states have internal predecessors, (32589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:40,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21807 states to 21807 states and 32589 transitions. [2024-11-10 00:56:40,198 INFO L78 Accepts]: Start accepts. Automaton has 21807 states and 32589 transitions. Word has length 81 [2024-11-10 00:56:40,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:56:40,198 INFO L471 AbstractCegarLoop]: Abstraction has 21807 states and 32589 transitions. [2024-11-10 00:56:40,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:40,199 INFO L276 IsEmpty]: Start isEmpty. Operand 21807 states and 32589 transitions. [2024-11-10 00:56:40,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 00:56:40,203 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:56:40,203 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:56:40,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 00:56:40,203 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:56:40,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:56:40,204 INFO L85 PathProgramCache]: Analyzing trace with hash 33226279, now seen corresponding path program 1 times [2024-11-10 00:56:40,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:56:40,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528829570] [2024-11-10 00:56:40,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:40,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:56:40,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:40,292 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:56:40,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:56:40,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528829570] [2024-11-10 00:56:40,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528829570] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:56:40,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:56:40,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:56:40,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876988026] [2024-11-10 00:56:40,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:56:40,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:56:40,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:56:40,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:56:40,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:56:40,294 INFO L87 Difference]: Start difference. First operand 21807 states and 32589 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:40,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:56:40,592 INFO L93 Difference]: Finished difference Result 36394 states and 52999 transitions. [2024-11-10 00:56:40,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:56:40,593 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2024-11-10 00:56:40,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:56:40,620 INFO L225 Difference]: With dead ends: 36394 [2024-11-10 00:56:40,621 INFO L226 Difference]: Without dead ends: 16887 [2024-11-10 00:56:40,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:56:40,644 INFO L432 NwaCegarLoop]: 2270 mSDtfsCounter, 48 mSDsluCounter, 2216 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 4486 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:56:40,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 4486 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:56:40,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16887 states. [2024-11-10 00:56:40,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16887 to 16877. [2024-11-10 00:56:40,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16877 states, 16875 states have (on average 1.5224296296296296) internal successors, (25691), 16876 states have internal predecessors, (25691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:41,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16877 states to 16877 states and 25691 transitions. [2024-11-10 00:56:41,030 INFO L78 Accepts]: Start accepts. Automaton has 16877 states and 25691 transitions. Word has length 83 [2024-11-10 00:56:41,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:56:41,030 INFO L471 AbstractCegarLoop]: Abstraction has 16877 states and 25691 transitions. [2024-11-10 00:56:41,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:41,030 INFO L276 IsEmpty]: Start isEmpty. Operand 16877 states and 25691 transitions. [2024-11-10 00:56:41,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 00:56:41,033 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:56:41,034 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:56:41,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 00:56:41,034 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:56:41,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:56:41,034 INFO L85 PathProgramCache]: Analyzing trace with hash 523692775, now seen corresponding path program 1 times [2024-11-10 00:56:41,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:56:41,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186139700] [2024-11-10 00:56:41,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:41,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:56:41,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:41,161 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:56:41,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:56:41,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186139700] [2024-11-10 00:56:41,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186139700] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:56:41,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:56:41,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:56:41,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104550567] [2024-11-10 00:56:41,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:56:41,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:56:41,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:56:41,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:56:41,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:56:41,164 INFO L87 Difference]: Start difference. First operand 16877 states and 25691 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:41,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:56:41,458 INFO L93 Difference]: Finished difference Result 24163 states and 35783 transitions. [2024-11-10 00:56:41,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:56:41,459 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2024-11-10 00:56:41,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:56:41,474 INFO L225 Difference]: With dead ends: 24163 [2024-11-10 00:56:41,474 INFO L226 Difference]: Without dead ends: 9600 [2024-11-10 00:56:41,489 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:56:41,490 INFO L432 NwaCegarLoop]: 2263 mSDtfsCounter, 43 mSDsluCounter, 2208 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 4471 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:56:41,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 4471 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:56:41,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9600 states. [2024-11-10 00:56:41,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9600 to 9597. [2024-11-10 00:56:41,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9597 states, 9595 states have (on average 1.6153204794163627) internal successors, (15499), 9596 states have internal predecessors, (15499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:41,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9597 states to 9597 states and 15499 transitions. [2024-11-10 00:56:41,699 INFO L78 Accepts]: Start accepts. Automaton has 9597 states and 15499 transitions. Word has length 83 [2024-11-10 00:56:41,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:56:41,699 INFO L471 AbstractCegarLoop]: Abstraction has 9597 states and 15499 transitions. [2024-11-10 00:56:41,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:41,699 INFO L276 IsEmpty]: Start isEmpty. Operand 9597 states and 15499 transitions. [2024-11-10 00:56:41,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-10 00:56:41,701 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:56:41,702 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:56:41,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 00:56:41,703 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:56:41,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:56:41,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1197682903, now seen corresponding path program 1 times [2024-11-10 00:56:41,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:56:41,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256011481] [2024-11-10 00:56:41,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:41,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:56:41,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:41,848 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:56:41,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:56:41,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256011481] [2024-11-10 00:56:41,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256011481] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:56:41,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:56:41,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:56:41,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525078413] [2024-11-10 00:56:41,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:56:41,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:56:41,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:56:41,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:56:41,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:56:41,849 INFO L87 Difference]: Start difference. First operand 9597 states and 15499 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:41,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:56:41,952 INFO L93 Difference]: Finished difference Result 13243 states and 20495 transitions. [2024-11-10 00:56:41,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:56:41,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2024-11-10 00:56:41,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:56:41,962 INFO L225 Difference]: With dead ends: 13243 [2024-11-10 00:56:41,962 INFO L226 Difference]: Without dead ends: 5960 [2024-11-10 00:56:41,970 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:56:41,971 INFO L432 NwaCegarLoop]: 2256 mSDtfsCounter, 38 mSDsluCounter, 2200 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 4456 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:56:41,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 4456 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:56:41,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5960 states. [2024-11-10 00:56:42,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5960 to 5957. [2024-11-10 00:56:42,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5957 states, 5955 states have (on average 1.7556675062972291) internal successors, (10455), 5956 states have internal predecessors, (10455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:42,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5957 states to 5957 states and 10455 transitions. [2024-11-10 00:56:42,090 INFO L78 Accepts]: Start accepts. Automaton has 5957 states and 10455 transitions. Word has length 85 [2024-11-10 00:56:42,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:56:42,091 INFO L471 AbstractCegarLoop]: Abstraction has 5957 states and 10455 transitions. [2024-11-10 00:56:42,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:42,091 INFO L276 IsEmpty]: Start isEmpty. Operand 5957 states and 10455 transitions. [2024-11-10 00:56:42,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-10 00:56:42,092 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:56:42,093 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:56:42,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-10 00:56:42,093 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:56:42,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:56:42,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1769393264, now seen corresponding path program 1 times [2024-11-10 00:56:42,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:56:42,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927517925] [2024-11-10 00:56:42,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:42,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:56:42,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:42,197 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:56:42,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:56:42,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927517925] [2024-11-10 00:56:42,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927517925] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:56:42,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:56:42,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:56:42,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306945072] [2024-11-10 00:56:42,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:56:42,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:56:42,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:56:42,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:56:42,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:56:42,199 INFO L87 Difference]: Start difference. First operand 5957 states and 10455 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:42,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:56:42,267 INFO L93 Difference]: Finished difference Result 7783 states and 12929 transitions. [2024-11-10 00:56:42,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:56:42,268 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2024-11-10 00:56:42,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:56:42,276 INFO L225 Difference]: With dead ends: 7783 [2024-11-10 00:56:42,276 INFO L226 Difference]: Without dead ends: 4140 [2024-11-10 00:56:42,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:56:42,283 INFO L432 NwaCegarLoop]: 2249 mSDtfsCounter, 35 mSDsluCounter, 2192 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 4441 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:56:42,284 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 4441 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:56:42,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4140 states. [2024-11-10 00:56:42,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4140 to 4137. [2024-11-10 00:56:42,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4137 states, 4135 states have (on average 1.924788391777509) internal successors, (7959), 4136 states have internal predecessors, (7959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:42,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4137 states to 4137 states and 7959 transitions. [2024-11-10 00:56:42,360 INFO L78 Accepts]: Start accepts. Automaton has 4137 states and 7959 transitions. Word has length 87 [2024-11-10 00:56:42,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:56:42,361 INFO L471 AbstractCegarLoop]: Abstraction has 4137 states and 7959 transitions. [2024-11-10 00:56:42,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:42,361 INFO L276 IsEmpty]: Start isEmpty. Operand 4137 states and 7959 transitions. [2024-11-10 00:56:42,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-10 00:56:42,362 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:56:42,363 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:56:42,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-10 00:56:42,363 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:56:42,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:56:42,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1728874217, now seen corresponding path program 1 times [2024-11-10 00:56:42,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:56:42,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679022830] [2024-11-10 00:56:42,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:42,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:56:42,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:42,455 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:56:42,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:56:42,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679022830] [2024-11-10 00:56:42,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679022830] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:56:42,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:56:42,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:56:42,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056414477] [2024-11-10 00:56:42,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:56:42,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:56:42,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:56:42,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:56:42,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:56:42,457 INFO L87 Difference]: Start difference. First operand 4137 states and 7959 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:42,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:56:42,502 INFO L93 Difference]: Finished difference Result 5053 states and 9185 transitions. [2024-11-10 00:56:42,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:56:42,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2024-11-10 00:56:42,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:56:42,509 INFO L225 Difference]: With dead ends: 5053 [2024-11-10 00:56:42,509 INFO L226 Difference]: Without dead ends: 3230 [2024-11-10 00:56:42,512 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:56:42,513 INFO L432 NwaCegarLoop]: 2242 mSDtfsCounter, 32 mSDsluCounter, 2184 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 4426 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:56:42,513 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 4426 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:56:42,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3230 states. [2024-11-10 00:56:42,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3230 to 3227. [2024-11-10 00:56:42,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3227 states, 3225 states have (on average 2.0849612403100775) internal successors, (6724), 3226 states have internal predecessors, (6724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:42,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3227 states to 3227 states and 6724 transitions. [2024-11-10 00:56:42,565 INFO L78 Accepts]: Start accepts. Automaton has 3227 states and 6724 transitions. Word has length 89 [2024-11-10 00:56:42,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:56:42,566 INFO L471 AbstractCegarLoop]: Abstraction has 3227 states and 6724 transitions. [2024-11-10 00:56:42,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:42,566 INFO L276 IsEmpty]: Start isEmpty. Operand 3227 states and 6724 transitions. [2024-11-10 00:56:42,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-10 00:56:42,567 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:56:42,569 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:56:42,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-10 00:56:42,569 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:56:42,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:56:42,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1030885310, now seen corresponding path program 1 times [2024-11-10 00:56:42,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:56:42,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302982182] [2024-11-10 00:56:42,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:42,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:56:42,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:43,195 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:56:43,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:56:43,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302982182] [2024-11-10 00:56:43,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302982182] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:56:43,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139898183] [2024-11-10 00:56:43,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:43,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:56:43,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:56:43,199 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:56:43,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 00:56:43,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:43,408 INFO L255 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-10 00:56:43,416 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:56:44,624 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:56:44,625 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:56:46,482 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:56:46,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139898183] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:56:46,483 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:56:46,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15, 17] total 38 [2024-11-10 00:56:46,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905059408] [2024-11-10 00:56:46,483 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:56:46,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-10 00:56:46,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:56:46,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-10 00:56:46,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1249, Unknown=0, NotChecked=0, Total=1406 [2024-11-10 00:56:46,487 INFO L87 Difference]: Start difference. First operand 3227 states and 6724 transitions. Second operand has 38 states, 38 states have (on average 6.394736842105263) internal successors, (243), 38 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:51,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:56:51,024 INFO L93 Difference]: Finished difference Result 10797 states and 16679 transitions. [2024-11-10 00:56:51,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-11-10 00:56:51,024 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 6.394736842105263) internal successors, (243), 38 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2024-11-10 00:56:51,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:56:51,036 INFO L225 Difference]: With dead ends: 10797 [2024-11-10 00:56:51,036 INFO L226 Difference]: Without dead ends: 9884 [2024-11-10 00:56:51,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2706 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1693, Invalid=8207, Unknown=0, NotChecked=0, Total=9900 [2024-11-10 00:56:51,042 INFO L432 NwaCegarLoop]: 2183 mSDtfsCounter, 27017 mSDsluCounter, 25160 mSDsCounter, 0 mSdLazyCounter, 1902 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27017 SdHoareTripleChecker+Valid, 27343 SdHoareTripleChecker+Invalid, 1968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-10 00:56:51,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27017 Valid, 27343 Invalid, 1968 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [66 Valid, 1902 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-10 00:56:51,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9884 states. [2024-11-10 00:56:51,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9884 to 5905. [2024-11-10 00:56:51,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5905 states, 5903 states have (on average 1.7213281382347958) internal successors, (10161), 5904 states have internal predecessors, (10161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:51,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5905 states to 5905 states and 10161 transitions. [2024-11-10 00:56:51,199 INFO L78 Accepts]: Start accepts. Automaton has 5905 states and 10161 transitions. Word has length 91 [2024-11-10 00:56:51,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:56:51,200 INFO L471 AbstractCegarLoop]: Abstraction has 5905 states and 10161 transitions. [2024-11-10 00:56:51,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 6.394736842105263) internal successors, (243), 38 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:51,200 INFO L276 IsEmpty]: Start isEmpty. Operand 5905 states and 10161 transitions. [2024-11-10 00:56:51,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-10 00:56:51,202 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:56:51,202 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:56:51,222 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 00:56:51,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-10 00:56:51,407 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:56:51,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:56:51,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1605157303, now seen corresponding path program 1 times [2024-11-10 00:56:51,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:56:51,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654819153] [2024-11-10 00:56:51,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:51,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:56:51,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:51,764 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:56:51,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:56:51,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654819153] [2024-11-10 00:56:51,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654819153] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:56:51,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1261024801] [2024-11-10 00:56:51,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:51,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:56:51,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:56:51,767 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:56:51,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 00:56:51,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:51,938 INFO L255 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-10 00:56:51,941 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:56:52,415 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:56:52,415 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:56:53,123 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:56:53,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1261024801] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:56:53,123 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:56:53,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2024-11-10 00:56:53,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967634144] [2024-11-10 00:56:53,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:56:53,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-10 00:56:53,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:56:53,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-10 00:56:53,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2024-11-10 00:56:53,125 INFO L87 Difference]: Start difference. First operand 5905 states and 10161 transitions. Second operand has 23 states, 23 states have (on average 9.08695652173913) internal successors, (209), 22 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:53,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:56:53,746 INFO L93 Difference]: Finished difference Result 13378 states and 19891 transitions. [2024-11-10 00:56:53,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 00:56:53,746 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 9.08695652173913) internal successors, (209), 22 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2024-11-10 00:56:53,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:56:53,755 INFO L225 Difference]: With dead ends: 13378 [2024-11-10 00:56:53,756 INFO L226 Difference]: Without dead ends: 9787 [2024-11-10 00:56:53,759 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=278, Invalid=844, Unknown=0, NotChecked=0, Total=1122 [2024-11-10 00:56:53,759 INFO L432 NwaCegarLoop]: 2218 mSDtfsCounter, 15625 mSDsluCounter, 7126 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15625 SdHoareTripleChecker+Valid, 9344 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 00:56:53,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15625 Valid, 9344 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 00:56:53,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9787 states. [2024-11-10 00:56:53,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9787 to 9685. [2024-11-10 00:56:53,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9685 states, 9683 states have (on average 1.544046266652897) internal successors, (14951), 9684 states have internal predecessors, (14951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:53,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9685 states to 9685 states and 14951 transitions. [2024-11-10 00:56:53,992 INFO L78 Accepts]: Start accepts. Automaton has 9685 states and 14951 transitions. Word has length 92 [2024-11-10 00:56:53,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:56:53,992 INFO L471 AbstractCegarLoop]: Abstraction has 9685 states and 14951 transitions. [2024-11-10 00:56:53,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 9.08695652173913) internal successors, (209), 22 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:53,993 INFO L276 IsEmpty]: Start isEmpty. Operand 9685 states and 14951 transitions. [2024-11-10 00:56:53,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-10 00:56:53,995 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:56:53,995 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:56:54,014 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 00:56:54,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-10 00:56:54,196 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:56:54,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:56:54,197 INFO L85 PathProgramCache]: Analyzing trace with hash 772439075, now seen corresponding path program 1 times [2024-11-10 00:56:54,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:56:54,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078634139] [2024-11-10 00:56:54,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:54,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:56:54,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:54,575 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:56:54,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:56:54,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078634139] [2024-11-10 00:56:54,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078634139] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:56:54,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097375346] [2024-11-10 00:56:54,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:54,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:56:54,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:56:54,578 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:56:54,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 00:56:54,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:54,747 INFO L255 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-10 00:56:54,749 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:56:55,055 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:56:55,055 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:56:55,935 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:56:55,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1097375346] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:56:55,935 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:56:55,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2024-11-10 00:56:55,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257442145] [2024-11-10 00:56:55,935 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:56:55,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-10 00:56:55,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:56:55,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-10 00:56:55,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2024-11-10 00:56:55,937 INFO L87 Difference]: Start difference. First operand 9685 states and 14951 transitions. Second operand has 22 states, 22 states have (on average 9.181818181818182) internal successors, (202), 21 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:56,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:56:56,543 INFO L93 Difference]: Finished difference Result 24430 states and 33829 transitions. [2024-11-10 00:56:56,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 00:56:56,543 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 9.181818181818182) internal successors, (202), 21 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2024-11-10 00:56:56,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:56:56,563 INFO L225 Difference]: With dead ends: 24430 [2024-11-10 00:56:56,563 INFO L226 Difference]: Without dead ends: 17059 [2024-11-10 00:56:56,571 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=215, Invalid=655, Unknown=0, NotChecked=0, Total=870 [2024-11-10 00:56:56,572 INFO L432 NwaCegarLoop]: 2202 mSDtfsCounter, 26313 mSDsluCounter, 4629 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26313 SdHoareTripleChecker+Valid, 6831 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 00:56:56,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26313 Valid, 6831 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 00:56:56,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17059 states. [2024-11-10 00:56:56,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17059 to 17053. [2024-11-10 00:56:56,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17053 states, 17051 states have (on average 1.4246085273590992) internal successors, (24291), 17052 states have internal predecessors, (24291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:56,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17053 states to 17053 states and 24291 transitions. [2024-11-10 00:56:56,985 INFO L78 Accepts]: Start accepts. Automaton has 17053 states and 24291 transitions. Word has length 92 [2024-11-10 00:56:56,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:56:56,985 INFO L471 AbstractCegarLoop]: Abstraction has 17053 states and 24291 transitions. [2024-11-10 00:56:56,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 9.181818181818182) internal successors, (202), 21 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:56,985 INFO L276 IsEmpty]: Start isEmpty. Operand 17053 states and 24291 transitions. [2024-11-10 00:56:56,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-10 00:56:56,989 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:56:56,989 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:56:57,004 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-10 00:56:57,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:56:57,190 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:56:57,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:56:57,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1947591175, now seen corresponding path program 1 times [2024-11-10 00:56:57,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:56:57,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15197502] [2024-11-10 00:56:57,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:57,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:56:57,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:57,564 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:56:57,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:56:57,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15197502] [2024-11-10 00:56:57,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15197502] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:56:57,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868628223] [2024-11-10 00:56:57,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:57,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:56:57,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:56:57,567 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:56:57,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 00:56:57,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:57,747 INFO L255 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-10 00:56:57,750 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:56:58,403 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:56:58,403 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:56:59,500 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:56:59,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868628223] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:56:59,500 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:56:59,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 13] total 29 [2024-11-10 00:56:59,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163196381] [2024-11-10 00:56:59,500 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:56:59,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-10 00:56:59,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:56:59,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-10 00:56:59,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=664, Unknown=0, NotChecked=0, Total=812 [2024-11-10 00:56:59,502 INFO L87 Difference]: Start difference. First operand 17053 states and 24291 transitions. Second operand has 29 states, 29 states have (on average 8.448275862068966) internal successors, (245), 29 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:57:00,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:57:00,792 INFO L93 Difference]: Finished difference Result 47686 states and 63577 transitions. [2024-11-10 00:57:00,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-10 00:57:00,793 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 8.448275862068966) internal successors, (245), 29 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2024-11-10 00:57:00,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:57:00,832 INFO L225 Difference]: With dead ends: 47686 [2024-11-10 00:57:00,832 INFO L226 Difference]: Without dead ends: 32947 [2024-11-10 00:57:00,854 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=437, Invalid=1455, Unknown=0, NotChecked=0, Total=1892 [2024-11-10 00:57:00,855 INFO L432 NwaCegarLoop]: 2213 mSDtfsCounter, 17884 mSDsluCounter, 11504 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17884 SdHoareTripleChecker+Valid, 13717 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 00:57:00,855 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17884 Valid, 13717 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 670 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 00:57:00,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32947 states. [2024-11-10 00:57:01,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32947 to 32557. [2024-11-10 00:57:01,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32557 states, 32555 states have (on average 1.340592842881278) internal successors, (43643), 32556 states have internal predecessors, (43643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:57:01,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32557 states to 32557 states and 43643 transitions. [2024-11-10 00:57:01,772 INFO L78 Accepts]: Start accepts. Automaton has 32557 states and 43643 transitions. Word has length 93 [2024-11-10 00:57:01,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:57:01,773 INFO L471 AbstractCegarLoop]: Abstraction has 32557 states and 43643 transitions. [2024-11-10 00:57:01,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 8.448275862068966) internal successors, (245), 29 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:57:01,773 INFO L276 IsEmpty]: Start isEmpty. Operand 32557 states and 43643 transitions. [2024-11-10 00:57:01,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 00:57:01,778 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:57:01,779 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:57:01,799 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-10 00:57:01,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-10 00:57:01,980 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:57:01,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:57:01,980 INFO L85 PathProgramCache]: Analyzing trace with hash -911703645, now seen corresponding path program 1 times [2024-11-10 00:57:01,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:57:01,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966585504] [2024-11-10 00:57:01,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:57:01,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:57:02,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:57:04,200 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:57:04,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:57:04,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966585504] [2024-11-10 00:57:04,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966585504] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:57:04,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373157081] [2024-11-10 00:57:04,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:57:04,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:57:04,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:57:04,203 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:57:04,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-10 00:57:04,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:57:04,390 INFO L255 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-10 00:57:04,393 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:57:05,490 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:57:05,491 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:57:06,901 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:57:06,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1373157081] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:57:06,902 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:57:06,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 13, 13] total 42 [2024-11-10 00:57:06,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649853025] [2024-11-10 00:57:06,902 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:57:06,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-10 00:57:06,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:57:06,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-10 00:57:06,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1579, Unknown=0, NotChecked=0, Total=1722 [2024-11-10 00:57:06,904 INFO L87 Difference]: Start difference. First operand 32557 states and 43643 transitions. Second operand has 42 states, 42 states have (on average 6.142857142857143) internal successors, (258), 42 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:57:20,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:57:20,674 INFO L93 Difference]: Finished difference Result 92082 states and 118584 transitions. [2024-11-10 00:57:20,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2024-11-10 00:57:20,674 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 6.142857142857143) internal successors, (258), 42 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-11-10 00:57:20,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:57:20,772 INFO L225 Difference]: With dead ends: 92082 [2024-11-10 00:57:20,772 INFO L226 Difference]: Without dead ends: 81967 [2024-11-10 00:57:20,798 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5868 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=3236, Invalid=15670, Unknown=0, NotChecked=0, Total=18906 [2024-11-10 00:57:20,799 INFO L432 NwaCegarLoop]: 2243 mSDtfsCounter, 28655 mSDsluCounter, 38907 mSDsCounter, 0 mSdLazyCounter, 3020 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28655 SdHoareTripleChecker+Valid, 41150 SdHoareTripleChecker+Invalid, 3120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 3020 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:57:20,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28655 Valid, 41150 Invalid, 3120 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [100 Valid, 3020 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-10 00:57:20,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81967 states. [2024-11-10 00:57:22,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81967 to 30285. [2024-11-10 00:57:22,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30285 states, 30283 states have (on average 1.345012052967011) internal successors, (40731), 30284 states have internal predecessors, (40731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:57:22,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30285 states to 30285 states and 40731 transitions. [2024-11-10 00:57:22,067 INFO L78 Accepts]: Start accepts. Automaton has 30285 states and 40731 transitions. Word has length 94 [2024-11-10 00:57:22,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:57:22,068 INFO L471 AbstractCegarLoop]: Abstraction has 30285 states and 40731 transitions. [2024-11-10 00:57:22,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 6.142857142857143) internal successors, (258), 42 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:57:22,068 INFO L276 IsEmpty]: Start isEmpty. Operand 30285 states and 40731 transitions. [2024-11-10 00:57:22,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 00:57:22,072 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:57:22,072 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:57:22,091 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0