./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label07.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.ufo.BOUNDED-10.pals+Problem12_label07.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 c07e007f9f3a362ec25382ccff24a1aeded702728f7c63228a63ffce5d34476e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 00:54:35,002 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 00:54:35,098 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 00:54:35,105 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 00:54:35,105 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 00:54:35,133 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 00:54:35,137 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 00:54:35,137 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 00:54:35,138 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 00:54:35,138 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 00:54:35,138 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 00:54:35,139 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 00:54:35,140 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 00:54:35,140 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 00:54:35,143 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 00:54:35,143 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 00:54:35,143 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 00:54:35,143 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 00:54:35,144 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 00:54:35,144 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 00:54:35,144 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 00:54:35,151 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 00:54:35,151 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 00:54:35,151 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 00:54:35,151 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 00:54:35,152 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 00:54:35,152 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 00:54:35,152 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 00:54:35,152 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 00:54:35,153 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 00:54:35,153 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 00:54:35,153 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 00:54:35,153 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:54:35,154 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 00:54:35,154 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 00:54:35,154 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 00:54:35,154 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 00:54:35,155 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 00:54:35,155 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 00:54:35,155 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 00:54:35,156 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 00:54:35,156 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 00:54:35,157 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 -> c07e007f9f3a362ec25382ccff24a1aeded702728f7c63228a63ffce5d34476e [2024-11-10 00:54:35,388 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 00:54:35,414 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 00:54:35,417 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 00:54:35,418 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 00:54:35,418 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 00:54:35,420 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label07.c [2024-11-10 00:54:36,953 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 00:54:37,415 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 00:54:37,416 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label07.c [2024-11-10 00:54:37,454 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f9410ffd/4358eec9ff6b4bc1887a9c0f8a7658df/FLAGf703e03d4 [2024-11-10 00:54:37,533 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f9410ffd/4358eec9ff6b4bc1887a9c0f8a7658df [2024-11-10 00:54:37,535 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 00:54:37,537 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 00:54:37,538 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 00:54:37,538 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 00:54:37,543 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 00:54:37,543 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:54:37" (1/1) ... [2024-11-10 00:54:37,544 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72f8b5d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:54:37, skipping insertion in model container [2024-11-10 00:54:37,545 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:54:37" (1/1) ... [2024-11-10 00:54:37,689 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 00:54:38,080 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.ufo.BOUNDED-10.pals+Problem12_label07.c[11640,11653] [2024-11-10 00:54:38,100 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.ufo.BOUNDED-10.pals+Problem12_label07.c[12482,12495] [2024-11-10 00:54:38,761 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:54:38,774 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 00:54:38,871 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.ufo.BOUNDED-10.pals+Problem12_label07.c[11640,11653] [2024-11-10 00:54:38,874 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.ufo.BOUNDED-10.pals+Problem12_label07.c[12482,12495] [2024-11-10 00:54:39,228 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:54:39,257 INFO L204 MainTranslator]: Completed translation [2024-11-10 00:54:39,258 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:54:39 WrapperNode [2024-11-10 00:54:39,258 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 00:54:39,259 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 00:54:39,259 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 00:54:39,259 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 00:54:39,269 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:54:39" (1/1) ... [2024-11-10 00:54:39,324 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:54:39" (1/1) ... [2024-11-10 00:54:39,595 INFO L138 Inliner]: procedures = 36, calls = 22, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 5097 [2024-11-10 00:54:39,596 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 00:54:39,597 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 00:54:39,597 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 00:54:39,597 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 00:54:39,607 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:54:39" (1/1) ... [2024-11-10 00:54:39,607 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:54:39" (1/1) ... [2024-11-10 00:54:39,646 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:54:39" (1/1) ... [2024-11-10 00:54:39,865 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:54:39,866 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:54:39" (1/1) ... [2024-11-10 00:54:39,866 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:54:39" (1/1) ... [2024-11-10 00:54:40,067 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:54:39" (1/1) ... [2024-11-10 00:54:40,085 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:54:39" (1/1) ... [2024-11-10 00:54:40,106 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:54:39" (1/1) ... [2024-11-10 00:54:40,123 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:54:39" (1/1) ... [2024-11-10 00:54:40,166 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 00:54:40,168 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 00:54:40,168 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 00:54:40,168 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 00:54:40,170 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:54:39" (1/1) ... [2024-11-10 00:54:40,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:54:40,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:54:40,201 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:54:40,207 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:54:40,251 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 00:54:40,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 00:54:40,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 00:54:40,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 00:54:40,347 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 00:54:40,350 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 00:54:45,636 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2127: havoc calculate_output_#t~ret38#1; [2024-11-10 00:54:45,637 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3606: havoc calculate_output2_#t~ret39#1; [2024-11-10 00:54:45,637 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L5096: havoc calculate_output3_#t~ret40#1; [2024-11-10 00:54:45,995 INFO L? ?]: Removed 2081 outVars from TransFormulas that were not future-live. [2024-11-10 00:54:45,996 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 00:54:46,036 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 00:54:46,036 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 00:54:46,037 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:54:46 BoogieIcfgContainer [2024-11-10 00:54:46,037 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 00:54:46,039 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 00:54:46,040 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 00:54:46,043 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 00:54:46,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:54:37" (1/3) ... [2024-11-10 00:54:46,044 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2edcef7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:54:46, skipping insertion in model container [2024-11-10 00:54:46,045 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:54:39" (2/3) ... [2024-11-10 00:54:46,045 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2edcef7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:54:46, skipping insertion in model container [2024-11-10 00:54:46,046 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:54:46" (3/3) ... [2024-11-10 00:54:46,047 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.BOUNDED-10.pals+Problem12_label07.c [2024-11-10 00:54:46,063 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 00:54:46,064 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 00:54:46,165 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 00:54:46,171 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;@22d3e6d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 00:54:46,171 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-10 00:54:46,180 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:54:46,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-10 00:54:46,187 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:54:46,187 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:54:46,188 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:54:46,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:54:46,193 INFO L85 PathProgramCache]: Analyzing trace with hash -993173831, now seen corresponding path program 1 times [2024-11-10 00:54:46,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:54:46,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993574054] [2024-11-10 00:54:46,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:54:46,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:54:46,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:54:46,453 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:54:46,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:54:46,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993574054] [2024-11-10 00:54:46,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993574054] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:54:46,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:54:46,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 00:54:46,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936743064] [2024-11-10 00:54:46,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:54:46,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:54:46,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:54:46,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:54:46,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:54:46,486 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 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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:54:51,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:54:51,114 INFO L93 Difference]: Finished difference Result 2529 states and 6899 transitions. [2024-11-10 00:54:51,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:54:51,119 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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 9 [2024-11-10 00:54:51,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:54:51,154 INFO L225 Difference]: With dead ends: 2529 [2024-11-10 00:54:51,154 INFO L226 Difference]: Without dead ends: 1590 [2024-11-10 00:54:51,164 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:54:51,168 INFO L432 NwaCegarLoop]: 290 mSDtfsCounter, 1712 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 3797 mSolverCounterSat, 771 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1712 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 4568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 771 IncrementalHoareTripleChecker+Valid, 3797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-11-10 00:54:51,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1712 Valid, 303 Invalid, 4568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [771 Valid, 3797 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-11-10 00:54:51,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1590 states. [2024-11-10 00:54:51,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1590 to 1590. [2024-11-10 00:54:51,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1590 states, 1588 states have (on average 2.6945843828715366) internal successors, (4279), 1589 states have internal predecessors, (4279), 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:54:51,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1590 states to 1590 states and 4279 transitions. [2024-11-10 00:54:51,314 INFO L78 Accepts]: Start accepts. Automaton has 1590 states and 4279 transitions. Word has length 9 [2024-11-10 00:54:51,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:54:51,315 INFO L471 AbstractCegarLoop]: Abstraction has 1590 states and 4279 transitions. [2024-11-10 00:54:51,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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:54:51,316 INFO L276 IsEmpty]: Start isEmpty. Operand 1590 states and 4279 transitions. [2024-11-10 00:54:51,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-10 00:54:51,319 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:54:51,319 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:54:51,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 00:54:51,320 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:54:51,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:54:51,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1417825177, now seen corresponding path program 1 times [2024-11-10 00:54:51,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:54:51,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850170303] [2024-11-10 00:54:51,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:54:51,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:54:51,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:54:51,572 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:54:51,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:54:51,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850170303] [2024-11-10 00:54:51,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850170303] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:54:51,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:54:51,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:54:51,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581180531] [2024-11-10 00:54:51,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:54:51,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:54:51,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:54:51,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:54:51,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:54:51,580 INFO L87 Difference]: Start difference. First operand 1590 states and 4279 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:54:51,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:54:51,681 INFO L93 Difference]: Finished difference Result 1639 states and 4353 transitions. [2024-11-10 00:54:51,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:54:51,682 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:54:51,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:54:51,691 INFO L225 Difference]: With dead ends: 1639 [2024-11-10 00:54:51,691 INFO L226 Difference]: Without dead ends: 1590 [2024-11-10 00:54:51,692 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:54:51,693 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.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:54:51,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8992 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:54:51,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1590 states. [2024-11-10 00:54:51,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1590 to 1590. [2024-11-10 00:54:51,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1590 states, 1588 states have (on average 2.6750629722921913) internal successors, (4248), 1589 states have internal predecessors, (4248), 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:54:51,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1590 states to 1590 states and 4248 transitions. [2024-11-10 00:54:51,742 INFO L78 Accepts]: Start accepts. Automaton has 1590 states and 4248 transitions. Word has length 26 [2024-11-10 00:54:51,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:54:51,742 INFO L471 AbstractCegarLoop]: Abstraction has 1590 states and 4248 transitions. [2024-11-10 00:54:51,743 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:54:51,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1590 states and 4248 transitions. [2024-11-10 00:54:51,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-10 00:54:51,745 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:54:51,746 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:54:51,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 00:54:51,746 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:54:51,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:54:51,747 INFO L85 PathProgramCache]: Analyzing trace with hash -2138475845, now seen corresponding path program 1 times [2024-11-10 00:54:51,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:54:51,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645751517] [2024-11-10 00:54:51,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:54:51,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:54:51,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:54:51,960 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:54:51,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:54:51,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645751517] [2024-11-10 00:54:51,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645751517] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:54:51,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:54:51,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 00:54:51,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22020295] [2024-11-10 00:54:51,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:54:51,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:54:51,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:54:51,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:54:51,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:54:51,965 INFO L87 Difference]: Start difference. First operand 1590 states and 4248 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:54:52,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:54:52,230 INFO L93 Difference]: Finished difference Result 2040 states and 4948 transitions. [2024-11-10 00:54:52,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 00:54:52,231 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:54:52,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:54:52,242 INFO L225 Difference]: With dead ends: 2040 [2024-11-10 00:54:52,242 INFO L226 Difference]: Without dead ends: 1995 [2024-11-10 00:54:52,244 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:54:52,245 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.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:54:52,245 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.1s Time] [2024-11-10 00:54:52,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1995 states. [2024-11-10 00:54:52,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1995 to 1632. [2024-11-10 00:54:52,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1632 states, 1630 states have (on average 2.6466257668711655) internal successors, (4314), 1631 states have internal predecessors, (4314), 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:54:52,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1632 states to 1632 states and 4314 transitions. [2024-11-10 00:54:52,293 INFO L78 Accepts]: Start accepts. Automaton has 1632 states and 4314 transitions. Word has length 56 [2024-11-10 00:54:52,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:54:52,293 INFO L471 AbstractCegarLoop]: Abstraction has 1632 states and 4314 transitions. [2024-11-10 00:54:52,294 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:54:52,294 INFO L276 IsEmpty]: Start isEmpty. Operand 1632 states and 4314 transitions. [2024-11-10 00:54:52,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-10 00:54:52,295 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:54:52,296 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:54:52,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 00:54:52,296 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:54:52,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:54:52,297 INFO L85 PathProgramCache]: Analyzing trace with hash 208440989, now seen corresponding path program 1 times [2024-11-10 00:54:52,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:54:52,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506314624] [2024-11-10 00:54:52,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:54:52,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:54:52,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:54:52,546 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:54:52,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:54:52,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506314624] [2024-11-10 00:54:52,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506314624] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:54:52,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:54:52,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 00:54:52,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667023922] [2024-11-10 00:54:52,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:54:52,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:54:52,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:54:52,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:54:52,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:54:52,548 INFO L87 Difference]: Start difference. First operand 1632 states and 4314 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:54:52,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:54:52,809 INFO L93 Difference]: Finished difference Result 1722 states and 4452 transitions. [2024-11-10 00:54:52,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 00:54:52,810 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:54:52,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:54:52,818 INFO L225 Difference]: With dead ends: 1722 [2024-11-10 00:54:52,818 INFO L226 Difference]: Without dead ends: 1635 [2024-11-10 00:54:52,821 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:54:52,823 INFO L432 NwaCegarLoop]: 2221 mSDtfsCounter, 6531 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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:54:52,824 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:54:52,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1635 states. [2024-11-10 00:54:52,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1635 to 1632. [2024-11-10 00:54:52,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1632 states, 1630 states have (on average 2.6460122699386504) internal successors, (4313), 1631 states have internal predecessors, (4313), 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:54:52,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1632 states to 1632 states and 4313 transitions. [2024-11-10 00:54:52,863 INFO L78 Accepts]: Start accepts. Automaton has 1632 states and 4313 transitions. Word has length 58 [2024-11-10 00:54:52,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:54:52,863 INFO L471 AbstractCegarLoop]: Abstraction has 1632 states and 4313 transitions. [2024-11-10 00:54:52,864 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:54:52,865 INFO L276 IsEmpty]: Start isEmpty. Operand 1632 states and 4313 transitions. [2024-11-10 00:54:52,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-10 00:54:52,866 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:54:52,869 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:54:52,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 00:54:52,870 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:54:52,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:54:52,870 INFO L85 PathProgramCache]: Analyzing trace with hash -404444728, now seen corresponding path program 1 times [2024-11-10 00:54:52,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:54:52,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633213761] [2024-11-10 00:54:52,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:54:52,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:54:52,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:54:52,998 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:54:52,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:54:52,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633213761] [2024-11-10 00:54:52,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633213761] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:54:52,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:54:52,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:54:52,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387692033] [2024-11-10 00:54:52,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:54:53,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:54:53,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:54:53,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:54:53,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:54:53,000 INFO L87 Difference]: Start difference. First operand 1632 states and 4313 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:54:53,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:54:53,037 INFO L93 Difference]: Finished difference Result 1794 states and 4563 transitions. [2024-11-10 00:54:53,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:54:53,038 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:54:53,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:54:53,046 INFO L225 Difference]: With dead ends: 1794 [2024-11-10 00:54:53,046 INFO L226 Difference]: Without dead ends: 1707 [2024-11-10 00:54:53,047 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:54:53,050 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:54:53,050 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:54:53,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2024-11-10 00:54:53,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1704. [2024-11-10 00:54:53,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1704 states, 1702 states have (on average 2.5987074030552293) internal successors, (4423), 1703 states have internal predecessors, (4423), 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:54:53,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1704 states to 1704 states and 4423 transitions. [2024-11-10 00:54:53,089 INFO L78 Accepts]: Start accepts. Automaton has 1704 states and 4423 transitions. Word has length 59 [2024-11-10 00:54:53,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:54:53,089 INFO L471 AbstractCegarLoop]: Abstraction has 1704 states and 4423 transitions. [2024-11-10 00:54:53,089 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:54:53,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1704 states and 4423 transitions. [2024-11-10 00:54:53,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 00:54:53,093 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:54:53,093 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:54:53,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 00:54:53,094 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:54:53,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:54:53,095 INFO L85 PathProgramCache]: Analyzing trace with hash 788028767, now seen corresponding path program 1 times [2024-11-10 00:54:53,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:54:53,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75709266] [2024-11-10 00:54:53,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:54:53,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:54:53,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:54:53,168 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:54:53,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:54:53,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75709266] [2024-11-10 00:54:53,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75709266] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:54:53,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:54:53,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:54:53,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306751678] [2024-11-10 00:54:53,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:54:53,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:54:53,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:54:53,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:54:53,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:54:53,171 INFO L87 Difference]: Start difference. First operand 1704 states and 4423 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:54:53,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:54:53,207 INFO L93 Difference]: Finished difference Result 2006 states and 4885 transitions. [2024-11-10 00:54:53,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:54:53,208 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:54:53,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:54:53,216 INFO L225 Difference]: With dead ends: 2006 [2024-11-10 00:54:53,216 INFO L226 Difference]: Without dead ends: 1847 [2024-11-10 00:54:53,217 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:54:53,218 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:54:53,218 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:54:53,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1847 states. [2024-11-10 00:54:53,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1847 to 1844. [2024-11-10 00:54:53,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1844 states, 1842 states have (on average 2.515743756786102) internal successors, (4634), 1843 states have internal predecessors, (4634), 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:54:53,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1844 states to 1844 states and 4634 transitions. [2024-11-10 00:54:53,259 INFO L78 Accepts]: Start accepts. Automaton has 1844 states and 4634 transitions. Word has length 60 [2024-11-10 00:54:53,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:54:53,259 INFO L471 AbstractCegarLoop]: Abstraction has 1844 states and 4634 transitions. [2024-11-10 00:54:53,259 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:54:53,260 INFO L276 IsEmpty]: Start isEmpty. Operand 1844 states and 4634 transitions. [2024-11-10 00:54:53,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 00:54:53,260 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:54:53,261 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:54:53,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 00:54:53,261 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:54:53,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:54:53,262 INFO L85 PathProgramCache]: Analyzing trace with hash -213380961, now seen corresponding path program 1 times [2024-11-10 00:54:53,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:54:53,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56587783] [2024-11-10 00:54:53,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:54:53,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:54:53,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:54:53,319 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:54:53,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:54:53,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56587783] [2024-11-10 00:54:53,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56587783] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:54:53,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:54:53,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:54:53,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100122853] [2024-11-10 00:54:53,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:54:53,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:54:53,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:54:53,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:54:53,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:54:53,322 INFO L87 Difference]: Start difference. First operand 1844 states and 4634 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:54:53,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:54:53,363 INFO L93 Difference]: Finished difference Result 2410 states and 5490 transitions. [2024-11-10 00:54:53,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:54:53,364 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:54:53,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:54:53,373 INFO L225 Difference]: With dead ends: 2410 [2024-11-10 00:54:53,373 INFO L226 Difference]: Without dead ends: 2111 [2024-11-10 00:54:53,375 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:54:53,375 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:54:53,376 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:54:53,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2111 states. [2024-11-10 00:54:53,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2111 to 2108. [2024-11-10 00:54:53,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2108 states, 2106 states have (on average 2.385565052231719) internal successors, (5024), 2107 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:54:53,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2108 states to 2108 states and 5024 transitions. [2024-11-10 00:54:53,431 INFO L78 Accepts]: Start accepts. Automaton has 2108 states and 5024 transitions. Word has length 60 [2024-11-10 00:54:53,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:54:53,431 INFO L471 AbstractCegarLoop]: Abstraction has 2108 states and 5024 transitions. [2024-11-10 00:54:53,432 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:54:53,432 INFO L276 IsEmpty]: Start isEmpty. Operand 2108 states and 5024 transitions. [2024-11-10 00:54:53,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 00:54:53,433 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:54:53,433 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:54:53,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 00:54:53,433 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:54:53,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:54:53,434 INFO L85 PathProgramCache]: Analyzing trace with hash -227830817, now seen corresponding path program 1 times [2024-11-10 00:54:53,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:54:53,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777565987] [2024-11-10 00:54:53,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:54:53,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:54:53,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:54:53,488 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:54:53,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:54:53,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777565987] [2024-11-10 00:54:53,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777565987] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:54:53,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:54:53,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:54:53,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361473900] [2024-11-10 00:54:53,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:54:53,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:54:53,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:54:53,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:54:53,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:54:53,490 INFO L87 Difference]: Start difference. First operand 2108 states and 5024 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:54:53,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:54:53,534 INFO L93 Difference]: Finished difference Result 3170 states and 6604 transitions. [2024-11-10 00:54:53,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:54:53,535 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:54:53,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:54:53,545 INFO L225 Difference]: With dead ends: 3170 [2024-11-10 00:54:53,545 INFO L226 Difference]: Without dead ends: 2607 [2024-11-10 00:54:53,547 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:54:53,547 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:54:53,548 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:54:53,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2607 states. [2024-11-10 00:54:53,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2607 to 2604. [2024-11-10 00:54:53,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2604 states, 2602 states have (on average 2.2059953881629517) internal successors, (5740), 2603 states have internal predecessors, (5740), 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:54:53,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2604 states to 2604 states and 5740 transitions. [2024-11-10 00:54:53,608 INFO L78 Accepts]: Start accepts. Automaton has 2604 states and 5740 transitions. Word has length 60 [2024-11-10 00:54:53,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:54:53,608 INFO L471 AbstractCegarLoop]: Abstraction has 2604 states and 5740 transitions. [2024-11-10 00:54:53,608 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:54:53,609 INFO L276 IsEmpty]: Start isEmpty. Operand 2604 states and 5740 transitions. [2024-11-10 00:54:53,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 00:54:53,610 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:54:53,610 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:54:53,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 00:54:53,610 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:54:53,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:54:53,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1863771935, now seen corresponding path program 1 times [2024-11-10 00:54:53,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:54:53,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810315259] [2024-11-10 00:54:53,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:54:53,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:54:53,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:54:53,673 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:54:53,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:54:53,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810315259] [2024-11-10 00:54:53,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810315259] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:54:53,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:54:53,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:54:53,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142421199] [2024-11-10 00:54:53,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:54:53,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:54:53,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:54:53,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:54:53,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:54:53,678 INFO L87 Difference]: Start difference. First operand 2604 states and 5740 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:54:53,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:54:53,739 INFO L93 Difference]: Finished difference Result 4594 states and 8640 transitions. [2024-11-10 00:54:53,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:54:53,740 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:54:53,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:54:53,765 INFO L225 Difference]: With dead ends: 4594 [2024-11-10 00:54:53,765 INFO L226 Difference]: Without dead ends: 3535 [2024-11-10 00:54:53,768 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:54:53,772 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:54:53,773 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:54:53,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3535 states. [2024-11-10 00:54:53,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3535 to 3532. [2024-11-10 00:54:53,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3532 states, 3530 states have (on average 1.9954674220963173) internal successors, (7044), 3531 states have internal predecessors, (7044), 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:54:53,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3532 states to 3532 states and 7044 transitions. [2024-11-10 00:54:53,866 INFO L78 Accepts]: Start accepts. Automaton has 3532 states and 7044 transitions. Word has length 60 [2024-11-10 00:54:53,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:54:53,867 INFO L471 AbstractCegarLoop]: Abstraction has 3532 states and 7044 transitions. [2024-11-10 00:54:53,867 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:54:53,867 INFO L276 IsEmpty]: Start isEmpty. Operand 3532 states and 7044 transitions. [2024-11-10 00:54:53,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 00:54:53,868 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:54:53,868 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:54:53,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 00:54:53,868 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:54:53,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:54:53,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1339494880, now seen corresponding path program 1 times [2024-11-10 00:54:53,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:54:53,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890438133] [2024-11-10 00:54:53,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:54:53,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:54:53,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:54:54,133 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:54:54,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:54:54,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890438133] [2024-11-10 00:54:54,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890438133] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:54:54,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:54:54,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:54:54,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318255269] [2024-11-10 00:54:54,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:54:54,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:54:54,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:54:54,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:54:54,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:54:54,136 INFO L87 Difference]: Start difference. First operand 3532 states and 7044 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:54:54,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:54:54,253 INFO L93 Difference]: Finished difference Result 3631 states and 7174 transitions. [2024-11-10 00:54:54,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:54:54,253 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:54:54,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:54:54,267 INFO L225 Difference]: With dead ends: 3631 [2024-11-10 00:54:54,267 INFO L226 Difference]: Without dead ends: 3628 [2024-11-10 00:54:54,268 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:54:54,269 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:54:54,269 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:54:54,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3628 states. [2024-11-10 00:54:54,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3628 to 3628. [2024-11-10 00:54:54,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3628 states, 3626 states have (on average 1.9646993932708219) internal successors, (7124), 3627 states have internal predecessors, (7124), 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:54:54,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3628 states to 3628 states and 7124 transitions. [2024-11-10 00:54:54,370 INFO L78 Accepts]: Start accepts. Automaton has 3628 states and 7124 transitions. Word has length 60 [2024-11-10 00:54:54,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:54:54,370 INFO L471 AbstractCegarLoop]: Abstraction has 3628 states and 7124 transitions. [2024-11-10 00:54:54,371 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:54:54,371 INFO L276 IsEmpty]: Start isEmpty. Operand 3628 states and 7124 transitions. [2024-11-10 00:54:54,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 00:54:54,372 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:54:54,372 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:54:54,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 00:54:54,372 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:54:54,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:54:54,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1070103071, now seen corresponding path program 1 times [2024-11-10 00:54:54,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:54:54,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031045202] [2024-11-10 00:54:54,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:54:54,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:54:54,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:54:54,443 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:54:54,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:54:54,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031045202] [2024-11-10 00:54:54,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031045202] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:54:54,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:54:54,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:54:54,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308161306] [2024-11-10 00:54:54,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:54:54,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:54:54,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:54:54,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:54:54,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:54:54,445 INFO L87 Difference]: Start difference. First operand 3628 states and 7124 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:54:54,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:54:54,516 INFO L93 Difference]: Finished difference Result 5877 states and 10332 transitions. [2024-11-10 00:54:54,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:54:54,517 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:54:54,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:54:54,528 INFO L225 Difference]: With dead ends: 5877 [2024-11-10 00:54:54,528 INFO L226 Difference]: Without dead ends: 4690 [2024-11-10 00:54:54,531 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:54:54,532 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:54:54,532 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:54:54,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4690 states. [2024-11-10 00:54:54,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4690 to 4687. [2024-11-10 00:54:54,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4687 states, 4685 states have (on average 1.832017075773746) internal successors, (8583), 4686 states have internal predecessors, (8583), 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:54:54,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4687 states to 4687 states and 8583 transitions. [2024-11-10 00:54:54,662 INFO L78 Accepts]: Start accepts. Automaton has 4687 states and 8583 transitions. Word has length 60 [2024-11-10 00:54:54,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:54:54,662 INFO L471 AbstractCegarLoop]: Abstraction has 4687 states and 8583 transitions. [2024-11-10 00:54:54,662 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:54:54,663 INFO L276 IsEmpty]: Start isEmpty. Operand 4687 states and 8583 transitions. [2024-11-10 00:54:54,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-10 00:54:54,665 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:54:54,666 INFO L215 NwaCegarLoop]: trace histogram [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:54:54,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 00:54:54,666 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:54:54,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:54:54,667 INFO L85 PathProgramCache]: Analyzing trace with hash 314395133, now seen corresponding path program 1 times [2024-11-10 00:54:54,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:54:54,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577525546] [2024-11-10 00:54:54,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:54:54,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:54:54,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:54:54,820 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:54:54,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:54:54,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577525546] [2024-11-10 00:54:54,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577525546] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:54:54,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:54:54,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:54:54,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813933511] [2024-11-10 00:54:54,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:54:54,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 00:54:54,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:54:54,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 00:54:54,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 00:54:54,822 INFO L87 Difference]: Start difference. First operand 4687 states and 8583 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 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:55:01,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:01,951 INFO L93 Difference]: Finished difference Result 8450 states and 18879 transitions. [2024-11-10 00:55:01,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 00:55:01,952 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 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 79 [2024-11-10 00:55:01,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:01,968 INFO L225 Difference]: With dead ends: 8450 [2024-11-10 00:55:01,969 INFO L226 Difference]: Without dead ends: 6943 [2024-11-10 00:55:01,972 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:55:01,973 INFO L432 NwaCegarLoop]: 802 mSDtfsCounter, 4431 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 7874 mSolverCounterSat, 1148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4431 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 9022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1148 IncrementalHoareTripleChecker+Valid, 7874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2024-11-10 00:55:01,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4431 Valid, 825 Invalid, 9022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1148 Valid, 7874 Invalid, 0 Unknown, 0 Unchecked, 6.9s Time] [2024-11-10 00:55:01,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6943 states. [2024-11-10 00:55:02,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6943 to 6943. [2024-11-10 00:55:02,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6943 states, 6941 states have (on average 1.9817029246506268) internal successors, (13755), 6942 states have internal predecessors, (13755), 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:55:02,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6943 states to 6943 states and 13755 transitions. [2024-11-10 00:55:02,186 INFO L78 Accepts]: Start accepts. Automaton has 6943 states and 13755 transitions. Word has length 79 [2024-11-10 00:55:02,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:02,186 INFO L471 AbstractCegarLoop]: Abstraction has 6943 states and 13755 transitions. [2024-11-10 00:55:02,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 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:55:02,187 INFO L276 IsEmpty]: Start isEmpty. Operand 6943 states and 13755 transitions. [2024-11-10 00:55:02,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-10 00:55:02,189 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:02,189 INFO L215 NwaCegarLoop]: trace histogram [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:55:02,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 00:55:02,190 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:02,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:02,190 INFO L85 PathProgramCache]: Analyzing trace with hash -668078473, now seen corresponding path program 1 times [2024-11-10 00:55:02,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:02,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851849873] [2024-11-10 00:55:02,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:02,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:02,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:02,284 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:55:02,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:02,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851849873] [2024-11-10 00:55:02,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851849873] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:55:02,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:55:02,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:55:02,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139605968] [2024-11-10 00:55:02,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:55:02,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:55:02,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:02,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:55:02,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:55:02,287 INFO L87 Difference]: Start difference. First operand 6943 states and 13755 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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:55:06,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:06,172 INFO L93 Difference]: Finished difference Result 13714 states and 30937 transitions. [2024-11-10 00:55:06,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:55:06,173 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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:55:06,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:06,195 INFO L225 Difference]: With dead ends: 13714 [2024-11-10 00:55:06,195 INFO L226 Difference]: Without dead ends: 9951 [2024-11-10 00:55:06,202 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:55:06,203 INFO L432 NwaCegarLoop]: 1760 mSDtfsCounter, 1464 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 3679 mSolverCounterSat, 746 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1464 SdHoareTripleChecker+Valid, 1877 SdHoareTripleChecker+Invalid, 4425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 746 IncrementalHoareTripleChecker+Valid, 3679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-10 00:55:06,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1464 Valid, 1877 Invalid, 4425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [746 Valid, 3679 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-10 00:55:06,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9951 states. [2024-11-10 00:55:06,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9951 to 9951. [2024-11-10 00:55:06,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9951 states, 9949 states have (on average 2.106643883807418) internal successors, (20959), 9950 states have internal predecessors, (20959), 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:55:06,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9951 states to 9951 states and 20959 transitions. [2024-11-10 00:55:06,409 INFO L78 Accepts]: Start accepts. Automaton has 9951 states and 20959 transitions. Word has length 81 [2024-11-10 00:55:06,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:06,410 INFO L471 AbstractCegarLoop]: Abstraction has 9951 states and 20959 transitions. [2024-11-10 00:55:06,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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:55:06,410 INFO L276 IsEmpty]: Start isEmpty. Operand 9951 states and 20959 transitions. [2024-11-10 00:55:06,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-10 00:55:06,412 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:06,412 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:55:06,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 00:55:06,413 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:06,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:06,413 INFO L85 PathProgramCache]: Analyzing trace with hash 958545093, now seen corresponding path program 1 times [2024-11-10 00:55:06,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:06,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869108813] [2024-11-10 00:55:06,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:06,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:06,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:06,588 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:55:06,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:06,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869108813] [2024-11-10 00:55:06,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869108813] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:55:06,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:55:06,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 00:55:06,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722991533] [2024-11-10 00:55:06,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:55:06,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:55:06,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:06,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:55:06,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:55:06,591 INFO L87 Difference]: Start difference. First operand 9951 states and 20959 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:55:06,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:06,979 INFO L93 Difference]: Finished difference Result 26337 states and 43883 transitions. [2024-11-10 00:55:06,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 00:55:06,980 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:55:06,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:07,029 INFO L225 Difference]: With dead ends: 26337 [2024-11-10 00:55:07,030 INFO L226 Difference]: Without dead ends: 23198 [2024-11-10 00:55:07,043 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:55:07,044 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:55:07,044 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:55:07,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23198 states. [2024-11-10 00:55:07,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23198 to 13087. [2024-11-10 00:55:07,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13087 states, 13085 states have (on average 1.934352311807413) internal successors, (25311), 13086 states have internal predecessors, (25311), 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:55:07,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13087 states to 13087 states and 25311 transitions. [2024-11-10 00:55:07,400 INFO L78 Accepts]: Start accepts. Automaton has 13087 states and 25311 transitions. Word has length 81 [2024-11-10 00:55:07,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:07,400 INFO L471 AbstractCegarLoop]: Abstraction has 13087 states and 25311 transitions. [2024-11-10 00:55:07,400 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:55:07,400 INFO L276 IsEmpty]: Start isEmpty. Operand 13087 states and 25311 transitions. [2024-11-10 00:55:07,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-10 00:55:07,403 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:07,403 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:55:07,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 00:55:07,403 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:07,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:07,404 INFO L85 PathProgramCache]: Analyzing trace with hash -42864635, now seen corresponding path program 1 times [2024-11-10 00:55:07,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:07,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797310560] [2024-11-10 00:55:07,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:07,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:07,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:07,633 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:55:07,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:07,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797310560] [2024-11-10 00:55:07,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797310560] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:55:07,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:55:07,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 00:55:07,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003174041] [2024-11-10 00:55:07,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:55:07,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:55:07,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:07,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:55:07,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:55:07,636 INFO L87 Difference]: Start difference. First operand 13087 states and 25311 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:55:08,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:08,123 INFO L93 Difference]: Finished difference Result 29473 states and 48235 transitions. [2024-11-10 00:55:08,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 00:55:08,124 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:55:08,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:08,171 INFO L225 Difference]: With dead ends: 29473 [2024-11-10 00:55:08,172 INFO L226 Difference]: Without dead ends: 26334 [2024-11-10 00:55:08,187 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:55:08,187 INFO L432 NwaCegarLoop]: 2290 mSDtfsCounter, 9078 mSDsluCounter, 2666 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9078 SdHoareTripleChecker+Valid, 4956 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:55:08,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9078 Valid, 4956 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:55:08,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26334 states. [2024-11-10 00:55:08,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26334 to 17807. [2024-11-10 00:55:08,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17807 states, 17805 states have (on average 1.7864083122718337) internal successors, (31807), 17806 states have internal predecessors, (31807), 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:55:08,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17807 states to 17807 states and 31807 transitions. [2024-11-10 00:55:08,623 INFO L78 Accepts]: Start accepts. Automaton has 17807 states and 31807 transitions. Word has length 81 [2024-11-10 00:55:08,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:08,624 INFO L471 AbstractCegarLoop]: Abstraction has 17807 states and 31807 transitions. [2024-11-10 00:55:08,624 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:55:08,624 INFO L276 IsEmpty]: Start isEmpty. Operand 17807 states and 31807 transitions. [2024-11-10 00:55:08,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-10 00:55:08,628 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:08,628 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:55:08,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 00:55:08,628 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:08,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:08,629 INFO L85 PathProgramCache]: Analyzing trace with hash -57314491, now seen corresponding path program 1 times [2024-11-10 00:55:08,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:08,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179094954] [2024-11-10 00:55:08,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:08,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:08,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:08,790 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:55:08,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:08,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179094954] [2024-11-10 00:55:08,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179094954] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:55:08,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:55:08,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 00:55:08,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015498042] [2024-11-10 00:55:08,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:55:08,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:55:08,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:08,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:55:08,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:55:08,795 INFO L87 Difference]: Start difference. First operand 17807 states and 31807 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:55:09,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:09,356 INFO L93 Difference]: Finished difference Result 32609 states and 52587 transitions. [2024-11-10 00:55:09,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 00:55:09,357 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:55:09,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:09,401 INFO L225 Difference]: With dead ends: 32609 [2024-11-10 00:55:09,401 INFO L226 Difference]: Without dead ends: 29470 [2024-11-10 00:55:09,415 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:55:09,416 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:55:09,416 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:55:09,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29470 states. [2024-11-10 00:55:09,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29470 to 20943. [2024-11-10 00:55:09,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20943 states, 20941 states have (on average 1.726708371137959) internal successors, (36159), 20942 states have internal predecessors, (36159), 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:55:09,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20943 states to 20943 states and 36159 transitions. [2024-11-10 00:55:09,907 INFO L78 Accepts]: Start accepts. Automaton has 20943 states and 36159 transitions. Word has length 81 [2024-11-10 00:55:09,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:09,907 INFO L471 AbstractCegarLoop]: Abstraction has 20943 states and 36159 transitions. [2024-11-10 00:55:09,907 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:55:09,908 INFO L276 IsEmpty]: Start isEmpty. Operand 20943 states and 36159 transitions. [2024-11-10 00:55:09,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-10 00:55:09,910 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:09,910 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:55:09,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 00:55:09,911 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:09,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:09,912 INFO L85 PathProgramCache]: Analyzing trace with hash 2034288261, now seen corresponding path program 1 times [2024-11-10 00:55:09,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:09,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193178545] [2024-11-10 00:55:09,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:09,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:09,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:10,055 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:55:10,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:10,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193178545] [2024-11-10 00:55:10,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193178545] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:55:10,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:55:10,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 00:55:10,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329839089] [2024-11-10 00:55:10,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:55:10,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:55:10,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:10,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:55:10,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:55:10,058 INFO L87 Difference]: Start difference. First operand 20943 states and 36159 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:55:10,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:10,735 INFO L93 Difference]: Finished difference Result 35745 states and 56939 transitions. [2024-11-10 00:55:10,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 00:55:10,736 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:55:10,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:10,789 INFO L225 Difference]: With dead ends: 35745 [2024-11-10 00:55:10,789 INFO L226 Difference]: Without dead ends: 32606 [2024-11-10 00:55:10,806 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:55:10,807 INFO L432 NwaCegarLoop]: 2297 mSDtfsCounter, 9071 mSDsluCounter, 2699 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9071 SdHoareTripleChecker+Valid, 4996 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:55:10,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9071 Valid, 4996 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:55:10,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32606 states. [2024-11-10 00:55:11,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32606 to 24079. [2024-11-10 00:55:11,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24079 states, 24077 states have (on average 1.6825601196162312) internal successors, (40511), 24078 states have internal predecessors, (40511), 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:55:11,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24079 states to 24079 states and 40511 transitions. [2024-11-10 00:55:11,330 INFO L78 Accepts]: Start accepts. Automaton has 24079 states and 40511 transitions. Word has length 81 [2024-11-10 00:55:11,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:11,331 INFO L471 AbstractCegarLoop]: Abstraction has 24079 states and 40511 transitions. [2024-11-10 00:55:11,331 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:55:11,331 INFO L276 IsEmpty]: Start isEmpty. Operand 24079 states and 40511 transitions. [2024-11-10 00:55:11,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-10 00:55:11,338 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:11,338 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:55:11,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 00:55:11,338 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:11,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:11,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1240619397, now seen corresponding path program 1 times [2024-11-10 00:55:11,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:11,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561173677] [2024-11-10 00:55:11,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:11,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:11,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:11,486 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:55:11,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:11,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561173677] [2024-11-10 00:55:11,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561173677] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:55:11,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:55:11,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 00:55:11,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354438168] [2024-11-10 00:55:11,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:55:11,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:55:11,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:11,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:55:11,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:55:11,489 INFO L87 Difference]: Start difference. First operand 24079 states and 40511 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:55:12,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:12,112 INFO L93 Difference]: Finished difference Result 37089 states and 58827 transitions. [2024-11-10 00:55:12,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 00:55:12,113 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:55:12,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:12,163 INFO L225 Difference]: With dead ends: 37089 [2024-11-10 00:55:12,163 INFO L226 Difference]: Without dead ends: 34846 [2024-11-10 00:55:12,176 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:55:12,177 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:55:12,177 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:55:12,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34846 states. [2024-11-10 00:55:12,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34846 to 26319. [2024-11-10 00:55:12,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26319 states, 26317 states have (on average 1.6585097085534066) internal successors, (43647), 26318 states have internal predecessors, (43647), 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:55:12,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26319 states to 26319 states and 43647 transitions. [2024-11-10 00:55:12,755 INFO L78 Accepts]: Start accepts. Automaton has 26319 states and 43647 transitions. Word has length 81 [2024-11-10 00:55:12,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:12,756 INFO L471 AbstractCegarLoop]: Abstraction has 26319 states and 43647 transitions. [2024-11-10 00:55:12,756 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:55:12,756 INFO L276 IsEmpty]: Start isEmpty. Operand 26319 states and 43647 transitions. [2024-11-10 00:55:12,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 00:55:12,760 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:12,761 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:55:12,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 00:55:12,761 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:12,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:12,761 INFO L85 PathProgramCache]: Analyzing trace with hash 33226279, now seen corresponding path program 1 times [2024-11-10 00:55:12,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:12,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032300162] [2024-11-10 00:55:12,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:12,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:12,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:12,868 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:55:12,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:12,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032300162] [2024-11-10 00:55:12,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032300162] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:55:12,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:55:12,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:55:12,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723149991] [2024-11-10 00:55:12,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:55:12,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:55:12,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:12,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:55:12,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:55:12,872 INFO L87 Difference]: Start difference. First operand 26319 states and 43647 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:55:13,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:13,326 INFO L93 Difference]: Finished difference Result 40906 states and 64057 transitions. [2024-11-10 00:55:13,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:55:13,327 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:55:13,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:13,357 INFO L225 Difference]: With dead ends: 40906 [2024-11-10 00:55:13,357 INFO L226 Difference]: Without dead ends: 21399 [2024-11-10 00:55:13,377 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:55:13,377 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:55:13,378 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:55:13,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21399 states. [2024-11-10 00:55:13,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21399 to 21389. [2024-11-10 00:55:13,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21389 states, 21387 states have (on average 1.7182868097442372) internal successors, (36749), 21388 states have internal predecessors, (36749), 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:55:13,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21389 states to 21389 states and 36749 transitions. [2024-11-10 00:55:13,763 INFO L78 Accepts]: Start accepts. Automaton has 21389 states and 36749 transitions. Word has length 83 [2024-11-10 00:55:13,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:13,763 INFO L471 AbstractCegarLoop]: Abstraction has 21389 states and 36749 transitions. [2024-11-10 00:55:13,763 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:55:13,763 INFO L276 IsEmpty]: Start isEmpty. Operand 21389 states and 36749 transitions. [2024-11-10 00:55:13,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 00:55:13,766 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:13,766 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:55:13,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 00:55:13,766 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:13,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:13,766 INFO L85 PathProgramCache]: Analyzing trace with hash 523692775, now seen corresponding path program 1 times [2024-11-10 00:55:13,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:13,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169490539] [2024-11-10 00:55:13,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:13,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:13,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:13,887 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:55:13,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:13,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169490539] [2024-11-10 00:55:13,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169490539] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:55:13,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:55:13,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:55:13,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207867008] [2024-11-10 00:55:13,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:55:13,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:55:13,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:13,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:55:13,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:55:13,889 INFO L87 Difference]: Start difference. First operand 21389 states and 36749 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:55:14,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:14,098 INFO L93 Difference]: Finished difference Result 28675 states and 46841 transitions. [2024-11-10 00:55:14,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:55:14,098 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:55:14,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:14,122 INFO L225 Difference]: With dead ends: 28675 [2024-11-10 00:55:14,123 INFO L226 Difference]: Without dead ends: 14112 [2024-11-10 00:55:14,141 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:55:14,143 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:55:14,143 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:55:14,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14112 states. [2024-11-10 00:55:14,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14112 to 14109. [2024-11-10 00:55:14,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14109 states, 14107 states have (on average 1.882540582689445) internal successors, (26557), 14108 states have internal predecessors, (26557), 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:55:14,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14109 states to 14109 states and 26557 transitions. [2024-11-10 00:55:14,587 INFO L78 Accepts]: Start accepts. Automaton has 14109 states and 26557 transitions. Word has length 83 [2024-11-10 00:55:14,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:14,588 INFO L471 AbstractCegarLoop]: Abstraction has 14109 states and 26557 transitions. [2024-11-10 00:55:14,588 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:55:14,588 INFO L276 IsEmpty]: Start isEmpty. Operand 14109 states and 26557 transitions. [2024-11-10 00:55:14,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-10 00:55:14,590 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:14,590 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:55:14,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-10 00:55:14,591 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:14,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:14,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1197682903, now seen corresponding path program 1 times [2024-11-10 00:55:14,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:14,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244146445] [2024-11-10 00:55:14,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:14,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:14,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:14,715 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:55:14,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:14,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244146445] [2024-11-10 00:55:14,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244146445] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:55:14,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:55:14,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:55:14,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401307435] [2024-11-10 00:55:14,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:55:14,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:55:14,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:14,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:55:14,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:55:14,716 INFO L87 Difference]: Start difference. First operand 14109 states and 26557 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:55:14,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:14,824 INFO L93 Difference]: Finished difference Result 17755 states and 31553 transitions. [2024-11-10 00:55:14,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:55:14,825 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:55:14,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:14,843 INFO L225 Difference]: With dead ends: 17755 [2024-11-10 00:55:14,843 INFO L226 Difference]: Without dead ends: 10472 [2024-11-10 00:55:14,852 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:55:14,853 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:55:14,853 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:55:14,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10472 states. [2024-11-10 00:55:15,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10472 to 10469. [2024-11-10 00:55:15,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10469 states, 10467 states have (on average 2.055316709658928) internal successors, (21513), 10468 states have internal predecessors, (21513), 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:55:15,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10469 states to 10469 states and 21513 transitions. [2024-11-10 00:55:15,041 INFO L78 Accepts]: Start accepts. Automaton has 10469 states and 21513 transitions. Word has length 85 [2024-11-10 00:55:15,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:15,042 INFO L471 AbstractCegarLoop]: Abstraction has 10469 states and 21513 transitions. [2024-11-10 00:55:15,042 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:55:15,042 INFO L276 IsEmpty]: Start isEmpty. Operand 10469 states and 21513 transitions. [2024-11-10 00:55:15,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-10 00:55:15,043 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:15,044 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:55:15,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-10 00:55:15,044 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:15,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:15,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1769393264, now seen corresponding path program 1 times [2024-11-10 00:55:15,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:15,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010567459] [2024-11-10 00:55:15,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:15,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:15,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:15,136 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:55:15,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:15,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010567459] [2024-11-10 00:55:15,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010567459] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:55:15,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:55:15,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:55:15,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069948459] [2024-11-10 00:55:15,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:55:15,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:55:15,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:15,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:55:15,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:55:15,138 INFO L87 Difference]: Start difference. First operand 10469 states and 21513 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:55:15,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:15,224 INFO L93 Difference]: Finished difference Result 12295 states and 23987 transitions. [2024-11-10 00:55:15,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:55:15,225 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:55:15,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:15,239 INFO L225 Difference]: With dead ends: 12295 [2024-11-10 00:55:15,239 INFO L226 Difference]: Without dead ends: 8652 [2024-11-10 00:55:15,246 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:55:15,247 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:55:15,247 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:55:15,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8652 states. [2024-11-10 00:55:15,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8652 to 8649. [2024-11-10 00:55:15,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8649 states, 8647 states have (on average 2.199259858910605) internal successors, (19017), 8648 states have internal predecessors, (19017), 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:55:15,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8649 states to 8649 states and 19017 transitions. [2024-11-10 00:55:15,357 INFO L78 Accepts]: Start accepts. Automaton has 8649 states and 19017 transitions. Word has length 87 [2024-11-10 00:55:15,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:15,357 INFO L471 AbstractCegarLoop]: Abstraction has 8649 states and 19017 transitions. [2024-11-10 00:55:15,357 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:55:15,358 INFO L276 IsEmpty]: Start isEmpty. Operand 8649 states and 19017 transitions. [2024-11-10 00:55:15,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-10 00:55:15,359 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:15,359 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:55:15,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-10 00:55:15,360 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:15,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:15,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1728874217, now seen corresponding path program 1 times [2024-11-10 00:55:15,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:15,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666298527] [2024-11-10 00:55:15,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:15,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:15,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:15,444 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:55:15,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:15,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666298527] [2024-11-10 00:55:15,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666298527] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:55:15,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:55:15,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:55:15,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628697196] [2024-11-10 00:55:15,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:55:15,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:55:15,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:15,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:55:15,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:55:15,447 INFO L87 Difference]: Start difference. First operand 8649 states and 19017 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:55:15,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:15,509 INFO L93 Difference]: Finished difference Result 9565 states and 20243 transitions. [2024-11-10 00:55:15,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:55:15,509 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:55:15,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:15,522 INFO L225 Difference]: With dead ends: 9565 [2024-11-10 00:55:15,522 INFO L226 Difference]: Without dead ends: 7742 [2024-11-10 00:55:15,526 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:55:15,527 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:55:15,527 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:55:15,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7742 states. [2024-11-10 00:55:15,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7742 to 7739. [2024-11-10 00:55:15,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7739 states, 7737 states have (on average 2.2983068372754296) internal successors, (17782), 7738 states have internal predecessors, (17782), 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:55:15,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7739 states to 7739 states and 17782 transitions. [2024-11-10 00:55:15,633 INFO L78 Accepts]: Start accepts. Automaton has 7739 states and 17782 transitions. Word has length 89 [2024-11-10 00:55:15,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:15,633 INFO L471 AbstractCegarLoop]: Abstraction has 7739 states and 17782 transitions. [2024-11-10 00:55:15,633 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:55:15,634 INFO L276 IsEmpty]: Start isEmpty. Operand 7739 states and 17782 transitions. [2024-11-10 00:55:15,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-10 00:55:15,635 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:15,635 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:55:15,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-10 00:55:15,636 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:15,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:15,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1030885310, now seen corresponding path program 1 times [2024-11-10 00:55:15,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:15,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652296486] [2024-11-10 00:55:15,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:15,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:15,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:15,960 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:55:15,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:15,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652296486] [2024-11-10 00:55:15,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652296486] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:55:15,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945327029] [2024-11-10 00:55:15,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:15,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:55:15,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:55:15,964 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:55:15,968 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:55:16,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:16,140 INFO L255 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-10 00:55:16,147 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:55:16,843 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:55:16,843 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:55:18,302 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:55:18,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1945327029] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:55:18,303 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:55:18,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2024-11-10 00:55:18,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137620224] [2024-11-10 00:55:18,303 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:55:18,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-10 00:55:18,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:18,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-10 00:55:18,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2024-11-10 00:55:18,307 INFO L87 Difference]: Start difference. First operand 7739 states and 17782 transitions. Second operand has 26 states, 26 states have (on average 9.884615384615385) internal successors, (257), 25 states have internal predecessors, (257), 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:55:19,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:19,935 INFO L93 Difference]: Finished difference Result 11660 states and 22996 transitions. [2024-11-10 00:55:19,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-10 00:55:19,936 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 9.884615384615385) internal successors, (257), 25 states have internal predecessors, (257), 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:55:19,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:19,951 INFO L225 Difference]: With dead ends: 11660 [2024-11-10 00:55:19,951 INFO L226 Difference]: Without dead ends: 10747 [2024-11-10 00:55:19,957 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 661 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=656, Invalid=2536, Unknown=0, NotChecked=0, Total=3192 [2024-11-10 00:55:19,957 INFO L432 NwaCegarLoop]: 2185 mSDtfsCounter, 27534 mSDsluCounter, 9220 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27534 SdHoareTripleChecker+Valid, 11405 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 00:55:19,958 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27534 Valid, 11405 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 00:55:19,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10747 states. [2024-11-10 00:55:20,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10747 to 10677. [2024-11-10 00:55:20,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10677 states, 10675 states have (on average 2.0201405152224825) internal successors, (21565), 10676 states have internal predecessors, (21565), 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:55:20,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10677 states to 10677 states and 21565 transitions. [2024-11-10 00:55:20,142 INFO L78 Accepts]: Start accepts. Automaton has 10677 states and 21565 transitions. Word has length 91 [2024-11-10 00:55:20,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:20,143 INFO L471 AbstractCegarLoop]: Abstraction has 10677 states and 21565 transitions. [2024-11-10 00:55:20,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 9.884615384615385) internal successors, (257), 25 states have internal predecessors, (257), 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:55:20,143 INFO L276 IsEmpty]: Start isEmpty. Operand 10677 states and 21565 transitions. [2024-11-10 00:55:20,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-10 00:55:20,145 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:20,145 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:55:20,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-10 00:55:20,345 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,SelfDestructingSolverStorable23 [2024-11-10 00:55:20,346 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:20,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:20,346 INFO L85 PathProgramCache]: Analyzing trace with hash -163823330, now seen corresponding path program 1 times [2024-11-10 00:55:20,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:20,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969108370] [2024-11-10 00:55:20,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:20,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:20,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:21,491 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:55:21,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:21,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969108370] [2024-11-10 00:55:21,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969108370] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:55:21,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [970438996] [2024-11-10 00:55:21,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:21,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:55:21,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:55:21,494 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:55:21,496 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:55:21,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:21,667 INFO L255 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-10 00:55:21,670 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:55:22,162 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:55:22,162 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:55:22,987 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:55:22,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [970438996] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:55:22,988 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:55:22,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 27 [2024-11-10 00:55:22,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7915565] [2024-11-10 00:55:22,988 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:55:22,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-10 00:55:22,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:22,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-10 00:55:22,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=661, Unknown=0, NotChecked=0, Total=756 [2024-11-10 00:55:22,990 INFO L87 Difference]: Start difference. First operand 10677 states and 21565 transitions. Second operand has 28 states, 28 states have (on average 8.321428571428571) internal successors, (233), 27 states have internal predecessors, (233), 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:55:25,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:25,838 INFO L93 Difference]: Finished difference Result 29210 states and 45759 transitions. [2024-11-10 00:55:25,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-11-10 00:55:25,839 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 8.321428571428571) internal successors, (233), 27 states have internal predecessors, (233), 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:55:25,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:25,868 INFO L225 Difference]: With dead ends: 29210 [2024-11-10 00:55:25,869 INFO L226 Difference]: Without dead ends: 25359 [2024-11-10 00:55:25,880 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1281 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=990, Invalid=4266, Unknown=0, NotChecked=0, Total=5256 [2024-11-10 00:55:25,880 INFO L432 NwaCegarLoop]: 2252 mSDtfsCounter, 37618 mSDsluCounter, 10078 mSDsCounter, 0 mSdLazyCounter, 1370 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37618 SdHoareTripleChecker+Valid, 12330 SdHoareTripleChecker+Invalid, 1405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 00:55:25,881 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37618 Valid, 12330 Invalid, 1405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1370 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 00:55:25,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25359 states. [2024-11-10 00:55:26,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25359 to 24925. [2024-11-10 00:55:26,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24925 states, 24923 states have (on average 1.5913413313004052) internal successors, (39661), 24924 states have internal predecessors, (39661), 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:55:26,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24925 states to 24925 states and 39661 transitions. [2024-11-10 00:55:26,475 INFO L78 Accepts]: Start accepts. Automaton has 24925 states and 39661 transitions. Word has length 91 [2024-11-10 00:55:26,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:26,475 INFO L471 AbstractCegarLoop]: Abstraction has 24925 states and 39661 transitions. [2024-11-10 00:55:26,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 8.321428571428571) internal successors, (233), 27 states have internal predecessors, (233), 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:55:26,476 INFO L276 IsEmpty]: Start isEmpty. Operand 24925 states and 39661 transitions. [2024-11-10 00:55:26,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-10 00:55:26,480 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:26,480 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:55:26,500 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:55:26,681 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,SelfDestructingSolverStorable24 [2024-11-10 00:55:26,681 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:26,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:26,682 INFO L85 PathProgramCache]: Analyzing trace with hash -451532262, now seen corresponding path program 1 times [2024-11-10 00:55:26,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:26,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265953364] [2024-11-10 00:55:26,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:26,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:26,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:27,103 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:55:27,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:27,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265953364] [2024-11-10 00:55:27,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265953364] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:55:27,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880077317] [2024-11-10 00:55:27,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:27,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:55:27,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:55:27,106 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:55:27,108 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:55:27,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:27,288 INFO L255 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-10 00:55:27,291 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:55:27,846 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:55:27,847 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:55:28,720 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:55:28,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880077317] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:55:28,720 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:55:28,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 13] total 32 [2024-11-10 00:55:28,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239212416] [2024-11-10 00:55:28,721 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:55:28,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-10 00:55:28,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:28,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-10 00:55:28,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=882, Unknown=0, NotChecked=0, Total=992 [2024-11-10 00:55:28,722 INFO L87 Difference]: Start difference. First operand 24925 states and 39661 transitions. Second operand has 32 states, 32 states have (on average 7.5) internal successors, (240), 32 states have internal predecessors, (240), 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:55:32,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:32,704 INFO L93 Difference]: Finished difference Result 53211 states and 75849 transitions. [2024-11-10 00:55:32,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-11-10 00:55:32,704 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 7.5) internal successors, (240), 32 states have internal predecessors, (240), 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:55:32,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:32,752 INFO L225 Difference]: With dead ends: 53211 [2024-11-10 00:55:32,753 INFO L226 Difference]: Without dead ends: 35112 [2024-11-10 00:55:32,772 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2315 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1378, Invalid=6994, Unknown=0, NotChecked=0, Total=8372 [2024-11-10 00:55:32,773 INFO L432 NwaCegarLoop]: 2211 mSDtfsCounter, 30434 mSDsluCounter, 23277 mSDsCounter, 0 mSdLazyCounter, 2078 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30434 SdHoareTripleChecker+Valid, 25488 SdHoareTripleChecker+Invalid, 2131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 2078 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:55:32,773 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30434 Valid, 25488 Invalid, 2131 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [53 Valid, 2078 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-10 00:55:32,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35112 states. [2024-11-10 00:55:33,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35112 to 21949. [2024-11-10 00:55:33,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21949 states, 21947 states have (on average 1.628149633207272) internal successors, (35733), 21948 states have internal predecessors, (35733), 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:55:33,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21949 states to 21949 states and 35733 transitions. [2024-11-10 00:55:33,292 INFO L78 Accepts]: Start accepts. Automaton has 21949 states and 35733 transitions. Word has length 93 [2024-11-10 00:55:33,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:33,292 INFO L471 AbstractCegarLoop]: Abstraction has 21949 states and 35733 transitions. [2024-11-10 00:55:33,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 7.5) internal successors, (240), 32 states have internal predecessors, (240), 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:55:33,292 INFO L276 IsEmpty]: Start isEmpty. Operand 21949 states and 35733 transitions. [2024-11-10 00:55:33,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-10 00:55:33,295 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:33,295 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:55:33,310 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:55:33,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:55:33,496 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:33,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:33,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1804855481, now seen corresponding path program 1 times [2024-11-10 00:55:33,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:33,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270175958] [2024-11-10 00:55:33,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:33,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:33,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:33,866 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:55:33,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:33,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270175958] [2024-11-10 00:55:33,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270175958] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:55:33,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564489250] [2024-11-10 00:55:33,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:33,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:55:33,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:55:33,869 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:55:33,871 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:55:34,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:34,033 INFO L255 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-10 00:55:34,036 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:55:34,818 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:55:34,818 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:55:35,893 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:55:35,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1564489250] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:55:35,894 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:55:35,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 13] total 32 [2024-11-10 00:55:35,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769243993] [2024-11-10 00:55:35,894 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:55:35,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-10 00:55:35,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:35,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-10 00:55:35,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=882, Unknown=0, NotChecked=0, Total=992 [2024-11-10 00:55:35,896 INFO L87 Difference]: Start difference. First operand 21949 states and 35733 transitions. Second operand has 32 states, 32 states have (on average 7.78125) internal successors, (249), 32 states have internal predecessors, (249), 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:55:40,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:40,193 INFO L93 Difference]: Finished difference Result 65375 states and 90605 transitions. [2024-11-10 00:55:40,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-11-10 00:55:40,193 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 7.78125) internal successors, (249), 32 states have internal predecessors, (249), 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:55:40,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:40,258 INFO L225 Difference]: With dead ends: 65375 [2024-11-10 00:55:40,258 INFO L226 Difference]: Without dead ends: 50252 [2024-11-10 00:55:40,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1664 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1114, Invalid=5528, Unknown=0, NotChecked=0, Total=6642 [2024-11-10 00:55:40,283 INFO L432 NwaCegarLoop]: 2212 mSDtfsCounter, 24469 mSDsluCounter, 25295 mSDsCounter, 0 mSdLazyCounter, 1743 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24469 SdHoareTripleChecker+Valid, 27507 SdHoareTripleChecker+Invalid, 1801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-10 00:55:40,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24469 Valid, 27507 Invalid, 1801 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [58 Valid, 1743 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-10 00:55:40,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50252 states. [2024-11-10 00:55:41,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50252 to 34797. [2024-11-10 00:55:41,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34797 states, 34795 states have (on average 1.488403506250898) internal successors, (51789), 34796 states have internal predecessors, (51789), 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:55:41,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34797 states to 34797 states and 51789 transitions. [2024-11-10 00:55:41,343 INFO L78 Accepts]: Start accepts. Automaton has 34797 states and 51789 transitions. Word has length 93 [2024-11-10 00:55:41,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:41,343 INFO L471 AbstractCegarLoop]: Abstraction has 34797 states and 51789 transitions. [2024-11-10 00:55:41,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 7.78125) internal successors, (249), 32 states have internal predecessors, (249), 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:55:41,344 INFO L276 IsEmpty]: Start isEmpty. Operand 34797 states and 51789 transitions. [2024-11-10 00:55:41,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 00:55:41,347 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:41,347 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:55:41,364 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:55:41,551 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,SelfDestructingSolverStorable26 [2024-11-10 00:55:41,552 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:41,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:41,552 INFO L85 PathProgramCache]: Analyzing trace with hash 205112900, now seen corresponding path program 1 times [2024-11-10 00:55:41,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:41,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216778769] [2024-11-10 00:55:41,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:41,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:41,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:42,247 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:55:42,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:42,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216778769] [2024-11-10 00:55:42,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216778769] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:55:42,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [247046674] [2024-11-10 00:55:42,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:42,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:55:42,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:55:42,251 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:55:42,252 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:55:42,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:42,427 INFO L255 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-10 00:55:42,432 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:55:45,271 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:55:45,271 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:55:47,018 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:55:47,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [247046674] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:55:47,019 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:55:47,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 18, 16] total 42 [2024-11-10 00:55:47,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840393489] [2024-11-10 00:55:47,019 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:55:47,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-10 00:55:47,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:47,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-10 00:55:47,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=1509, Unknown=0, NotChecked=0, Total=1722 [2024-11-10 00:55:47,021 INFO L87 Difference]: Start difference. First operand 34797 states and 51789 transitions. Second operand has 42 states, 42 states have (on average 5.666666666666667) internal successors, (238), 42 states have internal predecessors, (238), 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)