./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.3_overflow.ufo.UNBOUNDED.pals+Problem12_label01.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d 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.3_overflow.ufo.UNBOUNDED.pals+Problem12_label01.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 7fcfcf7d93c3fc85869efa536862a56a3ba120e3589f116e608720bbd1f279d7 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 09:35:21,223 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 09:35:21,294 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 09:35:21,298 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 09:35:21,299 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 09:35:21,317 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 09:35:21,318 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 09:35:21,318 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 09:35:21,319 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 09:35:21,322 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 09:35:21,322 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 09:35:21,323 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 09:35:21,323 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 09:35:21,323 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 09:35:21,323 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 09:35:21,324 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 09:35:21,324 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 09:35:21,324 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 09:35:21,324 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 09:35:21,324 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 09:35:21,325 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 09:35:21,328 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 09:35:21,328 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 09:35:21,328 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 09:35:21,328 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 09:35:21,329 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 09:35:21,329 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 09:35:21,329 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 09:35:21,329 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 09:35:21,329 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 09:35:21,330 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 09:35:21,330 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 09:35:21,330 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 09:35:21,330 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 09:35:21,330 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 09:35:21,330 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 09:35:21,331 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 09:35:21,331 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 09:35:21,331 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 09:35:21,332 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 09:35:21,332 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 09:35:21,332 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 09:35:21,333 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 -> 7fcfcf7d93c3fc85869efa536862a56a3ba120e3589f116e608720bbd1f279d7 [2024-11-16 09:35:21,547 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 09:35:21,570 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 09:35:21,573 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 09:35:21,574 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 09:35:21,574 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 09:35:21,576 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.3_overflow.ufo.UNBOUNDED.pals+Problem12_label01.c [2024-11-16 09:35:22,822 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 09:35:23,198 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 09:35:23,199 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3_overflow.ufo.UNBOUNDED.pals+Problem12_label01.c [2024-11-16 09:35:23,241 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aef0cf9cf/bc4e9e0b5bac4e6bb1d36342d342081d/FLAGab45db5a3 [2024-11-16 09:35:23,256 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aef0cf9cf/bc4e9e0b5bac4e6bb1d36342d342081d [2024-11-16 09:35:23,260 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 09:35:23,261 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 09:35:23,262 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 09:35:23,262 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 09:35:23,267 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 09:35:23,268 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 09:35:23" (1/1) ... [2024-11-16 09:35:23,268 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f89885e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:35:23, skipping insertion in model container [2024-11-16 09:35:23,269 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 09:35:23" (1/1) ... [2024-11-16 09:35:23,346 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 09:35:23,592 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.3_overflow.ufo.UNBOUNDED.pals+Problem12_label01.c[6524,6537] [2024-11-16 09:35:23,636 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.3_overflow.ufo.UNBOUNDED.pals+Problem12_label01.c[12079,12092] [2024-11-16 09:35:24,196 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 09:35:24,221 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 09:35:24,274 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.3_overflow.ufo.UNBOUNDED.pals+Problem12_label01.c[6524,6537] [2024-11-16 09:35:24,296 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.3_overflow.ufo.UNBOUNDED.pals+Problem12_label01.c[12079,12092] [2024-11-16 09:35:24,564 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 09:35:24,625 INFO L204 MainTranslator]: Completed translation [2024-11-16 09:35:24,625 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:35:24 WrapperNode [2024-11-16 09:35:24,625 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 09:35:24,626 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 09:35:24,626 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 09:35:24,626 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 09:35:24,632 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:35:24" (1/1) ... [2024-11-16 09:35:24,703 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:35:24" (1/1) ... [2024-11-16 09:35:24,926 INFO L138 Inliner]: procedures = 35, calls = 20, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 4979 [2024-11-16 09:35:24,926 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 09:35:24,927 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 09:35:24,927 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 09:35:24,927 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 09:35:24,936 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:35:24" (1/1) ... [2024-11-16 09:35:24,936 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:35:24" (1/1) ... [2024-11-16 09:35:24,974 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:35:24" (1/1) ... [2024-11-16 09:35:25,154 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-16 09:35:25,154 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:35:24" (1/1) ... [2024-11-16 09:35:25,154 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:35:24" (1/1) ... [2024-11-16 09:35:25,281 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:35:24" (1/1) ... [2024-11-16 09:35:25,296 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:35:24" (1/1) ... [2024-11-16 09:35:25,313 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:35:24" (1/1) ... [2024-11-16 09:35:25,325 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:35:24" (1/1) ... [2024-11-16 09:35:25,371 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 09:35:25,373 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 09:35:25,373 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 09:35:25,373 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 09:35:25,374 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:35:24" (1/1) ... [2024-11-16 09:35:25,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 09:35:25,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 09:35:25,406 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-16 09:35:25,408 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-16 09:35:25,448 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 09:35:25,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 09:35:25,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 09:35:25,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 09:35:25,527 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 09:35:25,528 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 09:35:28,959 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L1986: havoc calculate_output_#t~ret29#1; [2024-11-16 09:35:28,959 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L3465: havoc calculate_output2_#t~ret30#1; [2024-11-16 09:35:28,959 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L4955: havoc calculate_output3_#t~ret31#1; [2024-11-16 09:35:29,112 INFO L? ?]: Removed 734 outVars from TransFormulas that were not future-live. [2024-11-16 09:35:29,113 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 09:35:29,141 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 09:35:29,142 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 09:35:29,142 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 09:35:29 BoogieIcfgContainer [2024-11-16 09:35:29,142 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 09:35:29,143 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 09:35:29,144 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 09:35:29,146 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 09:35:29,146 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 09:35:23" (1/3) ... [2024-11-16 09:35:29,147 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@445b4c8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 09:35:29, skipping insertion in model container [2024-11-16 09:35:29,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:35:24" (2/3) ... [2024-11-16 09:35:29,147 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@445b4c8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 09:35:29, skipping insertion in model container [2024-11-16 09:35:29,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 09:35:29" (3/3) ... [2024-11-16 09:35:29,148 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3_overflow.ufo.UNBOUNDED.pals+Problem12_label01.c [2024-11-16 09:35:29,162 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 09:35:29,162 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-16 09:35:29,257 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 09:35:29,262 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;@1601f9b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 09:35:29,263 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-16 09:35:29,270 INFO L276 IsEmpty]: Start isEmpty. Operand has 879 states, 876 states have (on average 1.8995433789954337) internal successors, (1664), 878 states have internal predecessors, (1664), 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-16 09:35:29,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-16 09:35:29,276 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:35:29,277 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] [2024-11-16 09:35:29,278 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:35:29,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:35:29,283 INFO L85 PathProgramCache]: Analyzing trace with hash 159669486, now seen corresponding path program 1 times [2024-11-16 09:35:29,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:35:29,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484988192] [2024-11-16 09:35:29,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:35:29,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:35:29,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:35:29,477 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-16 09:35:29,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:35:29,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484988192] [2024-11-16 09:35:29,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484988192] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:35:29,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:35:29,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 09:35:29,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212736519] [2024-11-16 09:35:29,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:35:29,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 09:35:29,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:35:29,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 09:35:29,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 09:35:29,517 INFO L87 Difference]: Start difference. First operand has 879 states, 876 states have (on average 1.8995433789954337) internal successors, (1664), 878 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 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-16 09:35:29,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:35:29,588 INFO L93 Difference]: Finished difference Result 1732 states and 3284 transitions. [2024-11-16 09:35:29,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 09:35:29,590 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 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 22 [2024-11-16 09:35:29,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:35:29,609 INFO L225 Difference]: With dead ends: 1732 [2024-11-16 09:35:29,610 INFO L226 Difference]: Without dead ends: 811 [2024-11-16 09:35:29,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 09:35:29,617 INFO L432 NwaCegarLoop]: 1593 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1593 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 09:35:29,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1593 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:35:29,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2024-11-16 09:35:29,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 811. [2024-11-16 09:35:29,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 809 states have (on average 1.8899876390605685) internal successors, (1529), 810 states have internal predecessors, (1529), 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-16 09:35:29,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1529 transitions. [2024-11-16 09:35:29,689 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1529 transitions. Word has length 22 [2024-11-16 09:35:29,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:35:29,690 INFO L471 AbstractCegarLoop]: Abstraction has 811 states and 1529 transitions. [2024-11-16 09:35:29,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 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-16 09:35:29,690 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1529 transitions. [2024-11-16 09:35:29,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-16 09:35:29,696 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:35:29,696 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] [2024-11-16 09:35:29,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 09:35:29,697 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:35:29,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:35:29,697 INFO L85 PathProgramCache]: Analyzing trace with hash -350864691, now seen corresponding path program 1 times [2024-11-16 09:35:29,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:35:29,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536107249] [2024-11-16 09:35:29,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:35:29,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:35:29,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:35:29,890 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-16 09:35:29,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:35:29,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536107249] [2024-11-16 09:35:29,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536107249] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:35:29,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:35:29,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 09:35:29,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417796979] [2024-11-16 09:35:29,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:35:29,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 09:35:29,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:35:29,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 09:35:29,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 09:35:29,895 INFO L87 Difference]: Start difference. First operand 811 states and 1529 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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-16 09:35:29,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:35:29,971 INFO L93 Difference]: Finished difference Result 848 states and 1583 transitions. [2024-11-16 09:35:29,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 09:35:29,976 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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 22 [2024-11-16 09:35:29,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:35:29,979 INFO L225 Difference]: With dead ends: 848 [2024-11-16 09:35:29,981 INFO L226 Difference]: Without dead ends: 811 [2024-11-16 09:35:29,982 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-16 09:35:29,983 INFO L432 NwaCegarLoop]: 1527 mSDtfsCounter, 0 mSDsluCounter, 4560 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6087 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 09:35:29,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6087 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:35:29,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2024-11-16 09:35:30,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 811. [2024-11-16 09:35:30,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 809 states have (on average 1.8702101359703338) internal successors, (1513), 810 states have internal predecessors, (1513), 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-16 09:35:30,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1513 transitions. [2024-11-16 09:35:30,005 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1513 transitions. Word has length 22 [2024-11-16 09:35:30,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:35:30,005 INFO L471 AbstractCegarLoop]: Abstraction has 811 states and 1513 transitions. [2024-11-16 09:35:30,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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-16 09:35:30,006 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1513 transitions. [2024-11-16 09:35:30,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-16 09:35:30,007 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:35:30,007 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] [2024-11-16 09:35:30,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 09:35:30,007 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:35:30,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:35:30,008 INFO L85 PathProgramCache]: Analyzing trace with hash 644860677, now seen corresponding path program 1 times [2024-11-16 09:35:30,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:35:30,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039227945] [2024-11-16 09:35:30,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:35:30,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:35:30,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:35:30,140 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-16 09:35:30,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:35:30,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039227945] [2024-11-16 09:35:30,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039227945] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:35:30,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:35:30,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 09:35:30,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026465590] [2024-11-16 09:35:30,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:35:30,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 09:35:30,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:35:30,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 09:35:30,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 09:35:30,145 INFO L87 Difference]: Start difference. First operand 811 states and 1513 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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-16 09:35:30,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:35:30,282 INFO L93 Difference]: Finished difference Result 1009 states and 1813 transitions. [2024-11-16 09:35:30,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 09:35:30,284 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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 37 [2024-11-16 09:35:30,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:35:30,288 INFO L225 Difference]: With dead ends: 1009 [2024-11-16 09:35:30,289 INFO L226 Difference]: Without dead ends: 976 [2024-11-16 09:35:30,289 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-16 09:35:30,291 INFO L432 NwaCegarLoop]: 1509 mSDtfsCounter, 4611 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4611 SdHoareTripleChecker+Valid, 1897 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 09:35:30,293 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4611 Valid, 1897 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 09:35:30,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2024-11-16 09:35:30,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 841. [2024-11-16 09:35:30,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 839 states have (on average 1.8581644815256257) internal successors, (1559), 840 states have internal predecessors, (1559), 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-16 09:35:30,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1559 transitions. [2024-11-16 09:35:30,312 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1559 transitions. Word has length 37 [2024-11-16 09:35:30,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:35:30,312 INFO L471 AbstractCegarLoop]: Abstraction has 841 states and 1559 transitions. [2024-11-16 09:35:30,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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-16 09:35:30,313 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1559 transitions. [2024-11-16 09:35:30,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-16 09:35:30,314 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:35:30,314 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] [2024-11-16 09:35:30,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 09:35:30,314 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:35:30,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:35:30,315 INFO L85 PathProgramCache]: Analyzing trace with hash -769786777, now seen corresponding path program 1 times [2024-11-16 09:35:30,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:35:30,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476904638] [2024-11-16 09:35:30,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:35:30,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:35:30,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:35:30,510 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-16 09:35:30,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:35:30,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476904638] [2024-11-16 09:35:30,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476904638] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:35:30,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:35:30,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 09:35:30,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24352835] [2024-11-16 09:35:30,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:35:30,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 09:35:30,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:35:30,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 09:35:30,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 09:35:30,514 INFO L87 Difference]: Start difference. First operand 841 states and 1559 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 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-16 09:35:30,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:35:30,600 INFO L93 Difference]: Finished difference Result 907 states and 1657 transitions. [2024-11-16 09:35:30,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 09:35:30,601 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 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 39 [2024-11-16 09:35:30,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:35:30,603 INFO L225 Difference]: With dead ends: 907 [2024-11-16 09:35:30,603 INFO L226 Difference]: Without dead ends: 844 [2024-11-16 09:35:30,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-16 09:35:30,605 INFO L432 NwaCegarLoop]: 1508 mSDtfsCounter, 4429 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4429 SdHoareTripleChecker+Valid, 1600 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 09:35:30,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4429 Valid, 1600 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:35:30,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2024-11-16 09:35:30,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 841. [2024-11-16 09:35:30,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 839 states have (on average 1.8569725864123956) internal successors, (1558), 840 states have internal predecessors, (1558), 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-16 09:35:30,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1558 transitions. [2024-11-16 09:35:30,623 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1558 transitions. Word has length 39 [2024-11-16 09:35:30,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:35:30,623 INFO L471 AbstractCegarLoop]: Abstraction has 841 states and 1558 transitions. [2024-11-16 09:35:30,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 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-16 09:35:30,624 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1558 transitions. [2024-11-16 09:35:30,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-16 09:35:30,625 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:35:30,625 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] [2024-11-16 09:35:30,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 09:35:30,625 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:35:30,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:35:30,626 INFO L85 PathProgramCache]: Analyzing trace with hash -664734402, now seen corresponding path program 1 times [2024-11-16 09:35:30,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:35:30,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151711922] [2024-11-16 09:35:30,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:35:30,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:35:30,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:35:30,696 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-16 09:35:30,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:35:30,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151711922] [2024-11-16 09:35:30,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151711922] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:35:30,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:35:30,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 09:35:30,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075346202] [2024-11-16 09:35:30,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:35:30,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 09:35:30,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:35:30,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 09:35:30,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:35:30,702 INFO L87 Difference]: Start difference. First operand 841 states and 1558 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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-16 09:35:30,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:35:30,730 INFO L93 Difference]: Finished difference Result 955 states and 1728 transitions. [2024-11-16 09:35:30,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 09:35:30,730 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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 40 [2024-11-16 09:35:30,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:35:30,733 INFO L225 Difference]: With dead ends: 955 [2024-11-16 09:35:30,734 INFO L226 Difference]: Without dead ends: 892 [2024-11-16 09:35:30,734 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-16 09:35:30,736 INFO L432 NwaCegarLoop]: 1519 mSDtfsCounter, 1470 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1470 SdHoareTripleChecker+Valid, 1564 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-16 09:35:30,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1470 Valid, 1564 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:35:30,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2024-11-16 09:35:30,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 889. [2024-11-16 09:35:30,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 889 states, 887 states have (on average 1.8354002254791433) internal successors, (1628), 888 states have internal predecessors, (1628), 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-16 09:35:30,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1628 transitions. [2024-11-16 09:35:30,758 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1628 transitions. Word has length 40 [2024-11-16 09:35:30,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:35:30,760 INFO L471 AbstractCegarLoop]: Abstraction has 889 states and 1628 transitions. [2024-11-16 09:35:30,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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-16 09:35:30,760 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1628 transitions. [2024-11-16 09:35:30,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-16 09:35:30,762 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:35:30,763 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] [2024-11-16 09:35:30,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 09:35:30,763 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:35:30,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:35:30,764 INFO L85 PathProgramCache]: Analyzing trace with hash 307573737, now seen corresponding path program 1 times [2024-11-16 09:35:30,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:35:30,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087910002] [2024-11-16 09:35:30,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:35:30,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:35:30,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:35:30,824 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-16 09:35:30,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:35:30,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087910002] [2024-11-16 09:35:30,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087910002] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:35:30,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:35:30,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 09:35:30,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694619866] [2024-11-16 09:35:30,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:35:30,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 09:35:30,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:35:30,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 09:35:30,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:35:30,826 INFO L87 Difference]: Start difference. First operand 889 states and 1628 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-16 09:35:30,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:35:30,850 INFO L93 Difference]: Finished difference Result 1010 states and 1808 transitions. [2024-11-16 09:35:30,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 09:35:30,851 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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 41 [2024-11-16 09:35:30,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:35:30,854 INFO L225 Difference]: With dead ends: 1010 [2024-11-16 09:35:30,854 INFO L226 Difference]: Without dead ends: 947 [2024-11-16 09:35:30,854 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-16 09:35:30,855 INFO L432 NwaCegarLoop]: 1547 mSDtfsCounter, 1480 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1480 SdHoareTripleChecker+Valid, 1598 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-16 09:35:30,855 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1480 Valid, 1598 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:35:30,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2024-11-16 09:35:30,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 944. [2024-11-16 09:35:30,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 944 states, 942 states have (on average 1.813163481953291) internal successors, (1708), 943 states have internal predecessors, (1708), 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-16 09:35:30,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1708 transitions. [2024-11-16 09:35:30,874 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 1708 transitions. Word has length 41 [2024-11-16 09:35:30,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:35:30,875 INFO L471 AbstractCegarLoop]: Abstraction has 944 states and 1708 transitions. [2024-11-16 09:35:30,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-16 09:35:30,875 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1708 transitions. [2024-11-16 09:35:30,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-16 09:35:30,877 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:35:30,877 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] [2024-11-16 09:35:30,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 09:35:30,877 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:35:30,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:35:30,877 INFO L85 PathProgramCache]: Analyzing trace with hash 293123881, now seen corresponding path program 1 times [2024-11-16 09:35:30,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:35:30,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358027371] [2024-11-16 09:35:30,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:35:30,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:35:30,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:35:30,918 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-16 09:35:30,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:35:30,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358027371] [2024-11-16 09:35:30,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358027371] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:35:30,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:35:30,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 09:35:30,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060011223] [2024-11-16 09:35:30,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:35:30,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 09:35:30,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:35:30,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 09:35:30,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:35:30,920 INFO L87 Difference]: Start difference. First operand 944 states and 1708 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-16 09:35:30,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:35:30,944 INFO L93 Difference]: Finished difference Result 1246 states and 2150 transitions. [2024-11-16 09:35:30,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 09:35:30,944 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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 41 [2024-11-16 09:35:30,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:35:30,947 INFO L225 Difference]: With dead ends: 1246 [2024-11-16 09:35:30,947 INFO L226 Difference]: Without dead ends: 1083 [2024-11-16 09:35:30,949 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-16 09:35:30,950 INFO L432 NwaCegarLoop]: 1549 mSDtfsCounter, 1478 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1478 SdHoareTripleChecker+Valid, 1604 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-16 09:35:30,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1478 Valid, 1604 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:35:30,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2024-11-16 09:35:30,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 1080. [2024-11-16 09:35:30,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1080 states, 1078 states have (on average 1.7625231910946197) internal successors, (1900), 1079 states have internal predecessors, (1900), 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-16 09:35:30,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 1900 transitions. [2024-11-16 09:35:30,972 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 1900 transitions. Word has length 41 [2024-11-16 09:35:30,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:35:30,973 INFO L471 AbstractCegarLoop]: Abstraction has 1080 states and 1900 transitions. [2024-11-16 09:35:30,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-16 09:35:30,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 1900 transitions. [2024-11-16 09:35:30,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-16 09:35:30,974 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:35:30,974 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] [2024-11-16 09:35:30,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 09:35:30,975 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:35:30,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:35:30,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1910240663, now seen corresponding path program 1 times [2024-11-16 09:35:30,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:35:30,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581039053] [2024-11-16 09:35:30,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:35:30,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:35:30,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:35:31,023 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-16 09:35:31,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:35:31,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581039053] [2024-11-16 09:35:31,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581039053] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:35:31,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:35:31,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 09:35:31,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611789597] [2024-11-16 09:35:31,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:35:31,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 09:35:31,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:35:31,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 09:35:31,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:35:31,026 INFO L87 Difference]: Start difference. First operand 1080 states and 1900 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-16 09:35:31,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:35:31,052 INFO L93 Difference]: Finished difference Result 1630 states and 2684 transitions. [2024-11-16 09:35:31,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 09:35:31,053 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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 41 [2024-11-16 09:35:31,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:35:31,058 INFO L225 Difference]: With dead ends: 1630 [2024-11-16 09:35:31,058 INFO L226 Difference]: Without dead ends: 1331 [2024-11-16 09:35:31,059 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-16 09:35:31,060 INFO L432 NwaCegarLoop]: 1547 mSDtfsCounter, 1476 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1476 SdHoareTripleChecker+Valid, 1606 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-16 09:35:31,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1476 Valid, 1606 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:35:31,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1331 states. [2024-11-16 09:35:31,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1331 to 1328. [2024-11-16 09:35:31,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1328 states, 1326 states have (on average 1.6862745098039216) internal successors, (2236), 1327 states have internal predecessors, (2236), 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-16 09:35:31,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 2236 transitions. [2024-11-16 09:35:31,087 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 2236 transitions. Word has length 41 [2024-11-16 09:35:31,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:35:31,087 INFO L471 AbstractCegarLoop]: Abstraction has 1328 states and 2236 transitions. [2024-11-16 09:35:31,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-16 09:35:31,087 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 2236 transitions. [2024-11-16 09:35:31,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-16 09:35:31,087 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:35:31,087 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] [2024-11-16 09:35:31,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 09:35:31,088 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:35:31,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:35:31,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1860449578, now seen corresponding path program 1 times [2024-11-16 09:35:31,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:35:31,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402928296] [2024-11-16 09:35:31,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:35:31,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:35:31,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:35:31,221 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-16 09:35:31,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:35:31,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402928296] [2024-11-16 09:35:31,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402928296] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:35:31,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:35:31,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 09:35:31,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891296650] [2024-11-16 09:35:31,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:35:31,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 09:35:31,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:35:31,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 09:35:31,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 09:35:31,226 INFO L87 Difference]: Start difference. First operand 1328 states and 2236 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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-16 09:35:31,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:35:31,295 INFO L93 Difference]: Finished difference Result 1379 states and 2302 transitions. [2024-11-16 09:35:31,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 09:35:31,296 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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 41 [2024-11-16 09:35:31,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:35:31,299 INFO L225 Difference]: With dead ends: 1379 [2024-11-16 09:35:31,302 INFO L226 Difference]: Without dead ends: 1376 [2024-11-16 09:35:31,302 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-16 09:35:31,303 INFO L432 NwaCegarLoop]: 1510 mSDtfsCounter, 0 mSDsluCounter, 4521 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6031 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 09:35:31,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6031 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:35:31,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2024-11-16 09:35:31,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 1376. [2024-11-16 09:35:31,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1376 states, 1374 states have (on average 1.6593886462882097) internal successors, (2280), 1375 states have internal predecessors, (2280), 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-16 09:35:31,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1376 states to 1376 states and 2280 transitions. [2024-11-16 09:35:31,325 INFO L78 Accepts]: Start accepts. Automaton has 1376 states and 2280 transitions. Word has length 41 [2024-11-16 09:35:31,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:35:31,326 INFO L471 AbstractCegarLoop]: Abstraction has 1376 states and 2280 transitions. [2024-11-16 09:35:31,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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-16 09:35:31,326 INFO L276 IsEmpty]: Start isEmpty. Operand 1376 states and 2280 transitions. [2024-11-16 09:35:31,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-16 09:35:31,327 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:35:31,327 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] [2024-11-16 09:35:31,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 09:35:31,327 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:35:31,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:35:31,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1404140505, now seen corresponding path program 1 times [2024-11-16 09:35:31,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:35:31,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024391505] [2024-11-16 09:35:31,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:35:31,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:35:31,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:35:31,450 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-16 09:35:31,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:35:31,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024391505] [2024-11-16 09:35:31,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024391505] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:35:31,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:35:31,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 09:35:31,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444671101] [2024-11-16 09:35:31,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:35:31,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 09:35:31,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:35:31,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 09:35:31,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 09:35:31,452 INFO L87 Difference]: Start difference. First operand 1376 states and 2280 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 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-16 09:35:36,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:35:36,087 INFO L93 Difference]: Finished difference Result 3635 states and 6593 transitions. [2024-11-16 09:35:36,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 09:35:36,088 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 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 50 [2024-11-16 09:35:36,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:35:36,095 INFO L225 Difference]: With dead ends: 3635 [2024-11-16 09:35:36,095 INFO L226 Difference]: Without dead ends: 2880 [2024-11-16 09:35:36,097 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-16 09:35:36,097 INFO L432 NwaCegarLoop]: 749 mSDtfsCounter, 2363 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 5354 mSolverCounterSat, 1153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2363 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 6507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1153 IncrementalHoareTripleChecker+Valid, 5354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-11-16 09:35:36,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2363 Valid, 772 Invalid, 6507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1153 Valid, 5354 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-11-16 09:35:36,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2880 states. [2024-11-16 09:35:36,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2880 to 2880. [2024-11-16 09:35:36,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2880 states, 2878 states have (on average 1.527449617790132) internal successors, (4396), 2879 states have internal predecessors, (4396), 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-16 09:35:36,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2880 states to 2880 states and 4396 transitions. [2024-11-16 09:35:36,142 INFO L78 Accepts]: Start accepts. Automaton has 2880 states and 4396 transitions. Word has length 50 [2024-11-16 09:35:36,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:35:36,142 INFO L471 AbstractCegarLoop]: Abstraction has 2880 states and 4396 transitions. [2024-11-16 09:35:36,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 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-16 09:35:36,142 INFO L276 IsEmpty]: Start isEmpty. Operand 2880 states and 4396 transitions. [2024-11-16 09:35:36,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-16 09:35:36,143 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:35:36,143 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] [2024-11-16 09:35:36,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 09:35:36,143 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:35:36,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:35:36,144 INFO L85 PathProgramCache]: Analyzing trace with hash -636110161, now seen corresponding path program 1 times [2024-11-16 09:35:36,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:35:36,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912549695] [2024-11-16 09:35:36,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:35:36,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:35:36,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:35:36,247 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-16 09:35:36,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:35:36,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912549695] [2024-11-16 09:35:36,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912549695] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:35:36,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:35:36,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 09:35:36,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013722051] [2024-11-16 09:35:36,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:35:36,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 09:35:36,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:35:36,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 09:35:36,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 09:35:36,251 INFO L87 Difference]: Start difference. First operand 2880 states and 4396 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 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-16 09:35:36,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:35:36,326 INFO L93 Difference]: Finished difference Result 4648 states and 6808 transitions. [2024-11-16 09:35:36,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 09:35:36,327 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 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 58 [2024-11-16 09:35:36,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:35:36,337 INFO L225 Difference]: With dead ends: 4648 [2024-11-16 09:35:36,338 INFO L226 Difference]: Without dead ends: 4213 [2024-11-16 09:35:36,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-16 09:35:36,340 INFO L432 NwaCegarLoop]: 1555 mSDtfsCounter, 3050 mSDsluCounter, 1640 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3050 SdHoareTripleChecker+Valid, 3195 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 09:35:36,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3050 Valid, 3195 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:35:36,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4213 states. [2024-11-16 09:35:36,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4213 to 3396. [2024-11-16 09:35:36,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3396 states, 3394 states have (on average 1.5002946375957573) internal successors, (5092), 3395 states have internal predecessors, (5092), 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-16 09:35:36,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3396 states to 3396 states and 5092 transitions. [2024-11-16 09:35:36,401 INFO L78 Accepts]: Start accepts. Automaton has 3396 states and 5092 transitions. Word has length 58 [2024-11-16 09:35:36,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:35:36,401 INFO L471 AbstractCegarLoop]: Abstraction has 3396 states and 5092 transitions. [2024-11-16 09:35:36,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 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-16 09:35:36,402 INFO L276 IsEmpty]: Start isEmpty. Operand 3396 states and 5092 transitions. [2024-11-16 09:35:36,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-16 09:35:36,402 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:35:36,402 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] [2024-11-16 09:35:36,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 09:35:36,403 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:35:36,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:35:36,403 INFO L85 PathProgramCache]: Analyzing trace with hash -650560017, now seen corresponding path program 1 times [2024-11-16 09:35:36,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:35:36,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477464822] [2024-11-16 09:35:36,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:35:36,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:35:36,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:35:36,498 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-16 09:35:36,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:35:36,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477464822] [2024-11-16 09:35:36,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477464822] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:35:36,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:35:36,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 09:35:36,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768104929] [2024-11-16 09:35:36,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:35:36,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 09:35:36,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:35:36,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 09:35:36,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 09:35:36,500 INFO L87 Difference]: Start difference. First operand 3396 states and 5092 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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-16 09:35:36,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:35:36,629 INFO L93 Difference]: Finished difference Result 5240 states and 7612 transitions. [2024-11-16 09:35:36,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 09:35:36,630 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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-16 09:35:36,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:35:36,643 INFO L225 Difference]: With dead ends: 5240 [2024-11-16 09:35:36,643 INFO L226 Difference]: Without dead ends: 4645 [2024-11-16 09:35:36,646 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-16 09:35:36,647 INFO L432 NwaCegarLoop]: 1556 mSDtfsCounter, 3054 mSDsluCounter, 1612 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3054 SdHoareTripleChecker+Valid, 3168 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 09:35:36,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3054 Valid, 3168 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:35:36,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4645 states. [2024-11-16 09:35:36,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4645 to 4204. [2024-11-16 09:35:36,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4204 states, 4202 states have (on average 1.4707282246549263) internal successors, (6180), 4203 states have internal predecessors, (6180), 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-16 09:35:36,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4204 states to 4204 states and 6180 transitions. [2024-11-16 09:35:36,725 INFO L78 Accepts]: Start accepts. Automaton has 4204 states and 6180 transitions. Word has length 58 [2024-11-16 09:35:36,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:35:36,725 INFO L471 AbstractCegarLoop]: Abstraction has 4204 states and 6180 transitions. [2024-11-16 09:35:36,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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-16 09:35:36,725 INFO L276 IsEmpty]: Start isEmpty. Operand 4204 states and 6180 transitions. [2024-11-16 09:35:36,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-16 09:35:36,726 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:35:36,726 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] [2024-11-16 09:35:36,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 09:35:36,726 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:35:36,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:35:36,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1441042735, now seen corresponding path program 1 times [2024-11-16 09:35:36,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:35:36,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140766181] [2024-11-16 09:35:36,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:35:36,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:35:36,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:35:36,809 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-16 09:35:36,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:35:36,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140766181] [2024-11-16 09:35:36,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140766181] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:35:36,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:35:36,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 09:35:36,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715362822] [2024-11-16 09:35:36,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:35:36,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 09:35:36,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:35:36,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 09:35:36,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 09:35:36,812 INFO L87 Difference]: Start difference. First operand 4204 states and 6180 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-16 09:35:36,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:35:36,900 INFO L93 Difference]: Finished difference Result 5832 states and 8412 transitions. [2024-11-16 09:35:36,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 09:35:36,901 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-16 09:35:36,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:35:36,924 INFO L225 Difference]: With dead ends: 5832 [2024-11-16 09:35:36,924 INFO L226 Difference]: Without dead ends: 5237 [2024-11-16 09:35:36,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-16 09:35:36,927 INFO L432 NwaCegarLoop]: 1557 mSDtfsCounter, 3061 mSDsluCounter, 1621 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3061 SdHoareTripleChecker+Valid, 3178 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 09:35:36,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3061 Valid, 3178 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:35:36,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5237 states. [2024-11-16 09:35:37,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5237 to 4796. [2024-11-16 09:35:37,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4796 states, 4794 states have (on average 1.4559866499791405) internal successors, (6980), 4795 states have internal predecessors, (6980), 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-16 09:35:37,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4796 states to 4796 states and 6980 transitions. [2024-11-16 09:35:37,023 INFO L78 Accepts]: Start accepts. Automaton has 4796 states and 6980 transitions. Word has length 58 [2024-11-16 09:35:37,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:35:37,024 INFO L471 AbstractCegarLoop]: Abstraction has 4796 states and 6980 transitions. [2024-11-16 09:35:37,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-16 09:35:37,024 INFO L276 IsEmpty]: Start isEmpty. Operand 4796 states and 6980 transitions. [2024-11-16 09:35:37,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-16 09:35:37,025 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:35:37,025 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] [2024-11-16 09:35:37,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-16 09:35:37,025 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:35:37,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:35:37,026 INFO L85 PathProgramCache]: Analyzing trace with hash 872851857, now seen corresponding path program 1 times [2024-11-16 09:35:37,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:35:37,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915523384] [2024-11-16 09:35:37,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:35:37,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:35:37,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:35:37,089 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:35:37,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:35:37,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915523384] [2024-11-16 09:35:37,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915523384] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:35:37,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:35:37,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 09:35:37,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024946980] [2024-11-16 09:35:37,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:35:37,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 09:35:37,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:35:37,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 09:35:37,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:35:37,091 INFO L87 Difference]: Start difference. First operand 4796 states and 6980 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-16 09:35:37,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:35:37,155 INFO L93 Difference]: Finished difference Result 7310 states and 10380 transitions. [2024-11-16 09:35:37,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 09:35:37,156 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-16 09:35:37,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:35:37,163 INFO L225 Difference]: With dead ends: 7310 [2024-11-16 09:35:37,164 INFO L226 Difference]: Without dead ends: 4799 [2024-11-16 09:35:37,167 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-16 09:35:37,168 INFO L432 NwaCegarLoop]: 1533 mSDtfsCounter, 28 mSDsluCounter, 1501 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 3034 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-16 09:35:37,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 3034 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:35:37,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4799 states. [2024-11-16 09:35:37,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4799 to 4796. [2024-11-16 09:35:37,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4796 states, 4794 states have (on average 1.4455569461827285) internal successors, (6930), 4795 states have internal predecessors, (6930), 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-16 09:35:37,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4796 states to 4796 states and 6930 transitions. [2024-11-16 09:35:37,256 INFO L78 Accepts]: Start accepts. Automaton has 4796 states and 6930 transitions. Word has length 60 [2024-11-16 09:35:37,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:35:37,257 INFO L471 AbstractCegarLoop]: Abstraction has 4796 states and 6930 transitions. [2024-11-16 09:35:37,257 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-16 09:35:37,257 INFO L276 IsEmpty]: Start isEmpty. Operand 4796 states and 6930 transitions. [2024-11-16 09:35:37,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-16 09:35:37,258 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:35:37,258 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] [2024-11-16 09:35:37,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-16 09:35:37,259 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:35:37,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:35:37,259 INFO L85 PathProgramCache]: Analyzing trace with hash -128557871, now seen corresponding path program 1 times [2024-11-16 09:35:37,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:35:37,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288906765] [2024-11-16 09:35:37,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:35:37,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:35:37,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:35:37,327 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:35:37,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:35:37,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288906765] [2024-11-16 09:35:37,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288906765] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:35:37,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:35:37,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 09:35:37,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177196089] [2024-11-16 09:35:37,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:35:37,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 09:35:37,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:35:37,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 09:35:37,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:35:37,330 INFO L87 Difference]: Start difference. First operand 4796 states and 6930 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-16 09:35:37,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:35:37,368 INFO L93 Difference]: Finished difference Result 5791 states and 8266 transitions. [2024-11-16 09:35:37,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 09:35:37,369 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-16 09:35:37,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:35:37,374 INFO L225 Difference]: With dead ends: 5791 [2024-11-16 09:35:37,374 INFO L226 Difference]: Without dead ends: 3280 [2024-11-16 09:35:37,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-16 09:35:37,378 INFO L432 NwaCegarLoop]: 1531 mSDtfsCounter, 24 mSDsluCounter, 1500 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 3031 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-16 09:35:37,378 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 3031 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:35:37,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3280 states. [2024-11-16 09:35:37,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3280 to 3270. [2024-11-16 09:35:37,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3270 states, 3268 states have (on average 1.496328029375765) internal successors, (4890), 3269 states have internal predecessors, (4890), 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-16 09:35:37,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3270 states to 3270 states and 4890 transitions. [2024-11-16 09:35:37,491 INFO L78 Accepts]: Start accepts. Automaton has 3270 states and 4890 transitions. Word has length 60 [2024-11-16 09:35:37,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:35:37,491 INFO L471 AbstractCegarLoop]: Abstraction has 3270 states and 4890 transitions. [2024-11-16 09:35:37,492 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-16 09:35:37,492 INFO L276 IsEmpty]: Start isEmpty. Operand 3270 states and 4890 transitions. [2024-11-16 09:35:37,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-16 09:35:37,493 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:35:37,493 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-16 09:35:37,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-16 09:35:37,493 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:35:37,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:35:37,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1679113773, now seen corresponding path program 1 times [2024-11-16 09:35:37,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:35:37,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589013452] [2024-11-16 09:35:37,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:35:37,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:35:37,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:35:37,562 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:35:37,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:35:37,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589013452] [2024-11-16 09:35:37,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589013452] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:35:37,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:35:37,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 09:35:37,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569903266] [2024-11-16 09:35:37,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:35:37,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 09:35:37,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:35:37,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 09:35:37,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:35:37,564 INFO L87 Difference]: Start difference. First operand 3270 states and 4890 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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-16 09:35:37,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:35:37,596 INFO L93 Difference]: Finished difference Result 3762 states and 5542 transitions. [2024-11-16 09:35:37,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 09:35:37,597 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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 62 [2024-11-16 09:35:37,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:35:37,602 INFO L225 Difference]: With dead ends: 3762 [2024-11-16 09:35:37,602 INFO L226 Difference]: Without dead ends: 2787 [2024-11-16 09:35:37,604 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-16 09:35:37,605 INFO L432 NwaCegarLoop]: 1525 mSDtfsCounter, 22 mSDsluCounter, 1485 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 3010 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-16 09:35:37,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 3010 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:35:37,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2787 states. [2024-11-16 09:35:37,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2787 to 2784. [2024-11-16 09:35:37,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2784 states, 2782 states have (on average 1.5215672178289001) internal successors, (4233), 2783 states have internal predecessors, (4233), 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-16 09:35:37,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2784 states to 2784 states and 4233 transitions. [2024-11-16 09:35:37,662 INFO L78 Accepts]: Start accepts. Automaton has 2784 states and 4233 transitions. Word has length 62 [2024-11-16 09:35:37,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:35:37,663 INFO L471 AbstractCegarLoop]: Abstraction has 2784 states and 4233 transitions. [2024-11-16 09:35:37,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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-16 09:35:37,663 INFO L276 IsEmpty]: Start isEmpty. Operand 2784 states and 4233 transitions. [2024-11-16 09:35:37,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-16 09:35:37,664 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:35:37,664 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-16 09:35:37,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-16 09:35:37,665 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:35:37,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:35:37,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1606031738, now seen corresponding path program 1 times [2024-11-16 09:35:37,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:35:37,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145454819] [2024-11-16 09:35:37,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:35:37,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:35:37,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:35:38,018 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:35:38,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:35:38,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145454819] [2024-11-16 09:35:38,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145454819] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 09:35:38,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589829165] [2024-11-16 09:35:38,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:35:38,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 09:35:38,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 09:35:38,021 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-16 09:35:38,022 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-16 09:35:38,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:35:38,162 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-16 09:35:38,167 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 09:35:40,868 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:35:40,868 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 09:35:43,859 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:35:43,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [589829165] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 09:35:43,859 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 09:35:43,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 18, 20] total 42 [2024-11-16 09:35:43,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563050800] [2024-11-16 09:35:43,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 09:35:43,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-16 09:35:43,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:35:43,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-16 09:35:43,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=1425, Unknown=0, NotChecked=0, Total=1722 [2024-11-16 09:35:43,861 INFO L87 Difference]: Start difference. First operand 2784 states and 4233 transitions. Second operand has 42 states, 42 states have (on average 4.0476190476190474) internal successors, (170), 42 states have internal predecessors, (170), 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-16 09:35:54,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:35:54,192 INFO L93 Difference]: Finished difference Result 7315 states and 10121 transitions. [2024-11-16 09:35:54,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-11-16 09:35:54,193 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 4.0476190476190474) internal successors, (170), 42 states have internal predecessors, (170), 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 64 [2024-11-16 09:35:54,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:35:54,201 INFO L225 Difference]: With dead ends: 7315 [2024-11-16 09:35:54,201 INFO L226 Difference]: Without dead ends: 6826 [2024-11-16 09:35:54,204 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4365 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=3014, Invalid=10326, Unknown=0, NotChecked=0, Total=13340 [2024-11-16 09:35:54,205 INFO L432 NwaCegarLoop]: 1491 mSDtfsCounter, 17852 mSDsluCounter, 15752 mSDsCounter, 0 mSdLazyCounter, 1311 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17852 SdHoareTripleChecker+Valid, 17243 SdHoareTripleChecker+Invalid, 1420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 1311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-16 09:35:54,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17852 Valid, 17243 Invalid, 1420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 1311 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-16 09:35:54,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6826 states. [2024-11-16 09:35:54,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6826 to 4210. [2024-11-16 09:35:54,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4210 states, 4208 states have (on average 1.441777566539924) internal successors, (6067), 4209 states have internal predecessors, (6067), 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-16 09:35:54,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4210 states to 4210 states and 6067 transitions. [2024-11-16 09:35:54,292 INFO L78 Accepts]: Start accepts. Automaton has 4210 states and 6067 transitions. Word has length 64 [2024-11-16 09:35:54,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:35:54,293 INFO L471 AbstractCegarLoop]: Abstraction has 4210 states and 6067 transitions. [2024-11-16 09:35:54,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 4.0476190476190474) internal successors, (170), 42 states have internal predecessors, (170), 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-16 09:35:54,293 INFO L276 IsEmpty]: Start isEmpty. Operand 4210 states and 6067 transitions. [2024-11-16 09:35:54,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-16 09:35:54,294 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:35:54,294 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-16 09:35:54,312 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 09:35:54,498 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,SelfDestructingSolverStorable16 [2024-11-16 09:35:54,499 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:35:54,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:35:54,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1373592262, now seen corresponding path program 1 times [2024-11-16 09:35:54,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:35:54,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971227967] [2024-11-16 09:35:54,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:35:54,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:35:54,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:35:54,833 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:35:54,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:35:54,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971227967] [2024-11-16 09:35:54,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971227967] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 09:35:54,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55751488] [2024-11-16 09:35:54,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:35:54,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 09:35:54,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 09:35:54,835 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-16 09:35:54,836 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-16 09:35:54,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:35:54,934 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-16 09:35:54,936 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 09:35:57,290 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:35:57,290 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 09:35:58,771 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:35:58,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [55751488] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 09:35:58,771 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 09:35:58,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 18, 18] total 42 [2024-11-16 09:35:58,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674990258] [2024-11-16 09:35:58,773 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 09:35:58,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-16 09:35:58,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:35:58,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-16 09:35:58,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1528, Unknown=0, NotChecked=0, Total=1722 [2024-11-16 09:35:58,774 INFO L87 Difference]: Start difference. First operand 4210 states and 6067 transitions. Second operand has 42 states, 42 states have (on average 4.0) internal successors, (168), 42 states have internal predecessors, (168), 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-16 09:36:19,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:36:19,960 INFO L93 Difference]: Finished difference Result 12188 states and 16466 transitions. [2024-11-16 09:36:19,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2024-11-16 09:36:19,961 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 4.0) internal successors, (168), 42 states have internal predecessors, (168), 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 64 [2024-11-16 09:36:19,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:36:19,974 INFO L225 Difference]: With dead ends: 12188 [2024-11-16 09:36:19,974 INFO L226 Difference]: Without dead ends: 10273 [2024-11-16 09:36:19,983 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12297 ImplicationChecksByTransitivity, 20.0s TimeCoverageRelationStatistics Valid=5886, Invalid=26694, Unknown=0, NotChecked=0, Total=32580 [2024-11-16 09:36:19,983 INFO L432 NwaCegarLoop]: 1576 mSDtfsCounter, 16995 mSDsluCounter, 20747 mSDsCounter, 0 mSdLazyCounter, 3114 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16995 SdHoareTripleChecker+Valid, 22323 SdHoareTripleChecker+Invalid, 3212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 3114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-16 09:36:19,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16995 Valid, 22323 Invalid, 3212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 3114 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-16 09:36:19,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10273 states. [2024-11-16 09:36:20,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10273 to 7378. [2024-11-16 09:36:20,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7378 states, 7376 states have (on average 1.3789316702819956) internal successors, (10171), 7377 states have internal predecessors, (10171), 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-16 09:36:20,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7378 states to 7378 states and 10171 transitions. [2024-11-16 09:36:20,216 INFO L78 Accepts]: Start accepts. Automaton has 7378 states and 10171 transitions. Word has length 64 [2024-11-16 09:36:20,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:36:20,216 INFO L471 AbstractCegarLoop]: Abstraction has 7378 states and 10171 transitions. [2024-11-16 09:36:20,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 4.0) internal successors, (168), 42 states have internal predecessors, (168), 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-16 09:36:20,217 INFO L276 IsEmpty]: Start isEmpty. Operand 7378 states and 10171 transitions. [2024-11-16 09:36:20,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-16 09:36:20,217 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:36:20,217 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] [2024-11-16 09:36:20,231 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-16 09:36:20,418 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,SelfDestructingSolverStorable17 [2024-11-16 09:36:20,418 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:36:20,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:36:20,419 INFO L85 PathProgramCache]: Analyzing trace with hash -2084636826, now seen corresponding path program 1 times [2024-11-16 09:36:20,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:36:20,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16139215] [2024-11-16 09:36:20,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:36:20,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:36:20,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:36:21,326 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:36:21,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:36:21,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16139215] [2024-11-16 09:36:21,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16139215] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 09:36:21,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [633676031] [2024-11-16 09:36:21,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:36:21,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 09:36:21,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 09:36:21,329 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-16 09:36:21,331 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-16 09:36:21,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:36:21,412 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-16 09:36:21,414 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 09:36:21,613 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:36:21,613 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 09:36:21,796 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:36:21,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [633676031] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 09:36:21,797 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 09:36:21,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 7, 6] total 28 [2024-11-16 09:36:21,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772128761] [2024-11-16 09:36:21,797 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 09:36:21,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-16 09:36:21,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:36:21,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-16 09:36:21,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=674, Unknown=0, NotChecked=0, Total=756 [2024-11-16 09:36:21,798 INFO L87 Difference]: Start difference. First operand 7378 states and 10171 transitions. Second operand has 28 states, 28 states have (on average 6.607142857142857) internal successors, (185), 28 states have internal predecessors, (185), 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-16 09:36:31,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:36:31,973 INFO L93 Difference]: Finished difference Result 25078 states and 32644 transitions. [2024-11-16 09:36:31,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2024-11-16 09:36:31,974 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 6.607142857142857) internal successors, (185), 28 states have internal predecessors, (185), 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 67 [2024-11-16 09:36:31,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:36:31,996 INFO L225 Difference]: With dead ends: 25078 [2024-11-16 09:36:31,997 INFO L226 Difference]: Without dead ends: 19707 [2024-11-16 09:36:32,006 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9860 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=4314, Invalid=22092, Unknown=0, NotChecked=0, Total=26406 [2024-11-16 09:36:32,006 INFO L432 NwaCegarLoop]: 1622 mSDtfsCounter, 19898 mSDsluCounter, 16448 mSDsCounter, 0 mSdLazyCounter, 3736 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19898 SdHoareTripleChecker+Valid, 18070 SdHoareTripleChecker+Invalid, 3837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 3736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-16 09:36:32,007 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19898 Valid, 18070 Invalid, 3837 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [101 Valid, 3736 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-16 09:36:32,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19707 states. [2024-11-16 09:36:32,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19707 to 13602. [2024-11-16 09:36:32,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13602 states, 13600 states have (on average 1.296029411764706) internal successors, (17626), 13601 states have internal predecessors, (17626), 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-16 09:36:32,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13602 states to 13602 states and 17626 transitions. [2024-11-16 09:36:32,593 INFO L78 Accepts]: Start accepts. Automaton has 13602 states and 17626 transitions. Word has length 67 [2024-11-16 09:36:32,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:36:32,593 INFO L471 AbstractCegarLoop]: Abstraction has 13602 states and 17626 transitions. [2024-11-16 09:36:32,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 6.607142857142857) internal successors, (185), 28 states have internal predecessors, (185), 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-16 09:36:32,594 INFO L276 IsEmpty]: Start isEmpty. Operand 13602 states and 17626 transitions. [2024-11-16 09:36:32,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-16 09:36:32,596 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:36:32,596 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-16 09:36:32,612 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-16 09:36:32,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 09:36:32,801 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:36:32,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:36:32,801 INFO L85 PathProgramCache]: Analyzing trace with hash 2051200872, now seen corresponding path program 1 times [2024-11-16 09:36:32,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:36:32,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972769588] [2024-11-16 09:36:32,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:36:32,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:36:32,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:36:33,334 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 16 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:36:33,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:36:33,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972769588] [2024-11-16 09:36:33,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972769588] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 09:36:33,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1611174772] [2024-11-16 09:36:33,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:36:33,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 09:36:33,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 09:36:33,335 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-16 09:36:33,336 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-16 09:36:33,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:36:33,421 INFO L255 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-16 09:36:33,423 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 09:36:33,942 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 44 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:36:33,942 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 09:36:35,651 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 34 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:36:35,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1611174772] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 09:36:35,651 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 09:36:35,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 33 [2024-11-16 09:36:35,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286507152] [2024-11-16 09:36:35,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 09:36:35,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-16 09:36:35,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:36:35,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-16 09:36:35,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=958, Unknown=0, NotChecked=0, Total=1056 [2024-11-16 09:36:35,653 INFO L87 Difference]: Start difference. First operand 13602 states and 17626 transitions. Second operand has 33 states, 33 states have (on average 8.909090909090908) internal successors, (294), 33 states have internal predecessors, (294), 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-16 09:36:40,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:36:40,267 INFO L93 Difference]: Finished difference Result 30433 states and 38482 transitions. [2024-11-16 09:36:40,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2024-11-16 09:36:40,268 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 8.909090909090908) internal successors, (294), 33 states have internal predecessors, (294), 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 108 [2024-11-16 09:36:40,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:36:40,291 INFO L225 Difference]: With dead ends: 30433 [2024-11-16 09:36:40,291 INFO L226 Difference]: Without dead ends: 20189 [2024-11-16 09:36:40,302 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2526 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=2034, Invalid=8472, Unknown=0, NotChecked=0, Total=10506 [2024-11-16 09:36:40,302 INFO L432 NwaCegarLoop]: 1547 mSDtfsCounter, 17266 mSDsluCounter, 17404 mSDsCounter, 0 mSdLazyCounter, 1428 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17266 SdHoareTripleChecker+Valid, 18951 SdHoareTripleChecker+Invalid, 1485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 09:36:40,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17266 Valid, 18951 Invalid, 1485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1428 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 09:36:40,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20189 states. [2024-11-16 09:36:40,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20189 to 8912. [2024-11-16 09:36:40,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8912 states, 8910 states have (on average 1.305050505050505) internal successors, (11628), 8911 states have internal predecessors, (11628), 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-16 09:36:40,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8912 states to 8912 states and 11628 transitions. [2024-11-16 09:36:40,826 INFO L78 Accepts]: Start accepts. Automaton has 8912 states and 11628 transitions. Word has length 108 [2024-11-16 09:36:40,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:36:40,827 INFO L471 AbstractCegarLoop]: Abstraction has 8912 states and 11628 transitions. [2024-11-16 09:36:40,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 8.909090909090908) internal successors, (294), 33 states have internal predecessors, (294), 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-16 09:36:40,827 INFO L276 IsEmpty]: Start isEmpty. Operand 8912 states and 11628 transitions. [2024-11-16 09:36:40,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-16 09:36:40,829 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:36:40,829 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-16 09:36:40,843 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-16 09:36:41,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 09:36:41,030 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:36:41,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:36:41,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1797241543, now seen corresponding path program 1 times [2024-11-16 09:36:41,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:36:41,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487335979] [2024-11-16 09:36:41,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:36:41,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:36:41,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:36:41,681 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 25 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:36:41,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:36:41,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487335979] [2024-11-16 09:36:41,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487335979] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 09:36:41,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664038454] [2024-11-16 09:36:41,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:36:41,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 09:36:41,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 09:36:41,683 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-16 09:36:41,683 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-16 09:36:41,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:36:41,771 INFO L255 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-16 09:36:41,773 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 09:36:42,312 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 21 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:36:42,312 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 09:36:43,273 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 17 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:36:43,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [664038454] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 09:36:43,274 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 09:36:43,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 36 [2024-11-16 09:36:43,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504347821] [2024-11-16 09:36:43,274 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 09:36:43,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-16 09:36:43,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:36:43,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-16 09:36:43,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1153, Unknown=0, NotChecked=0, Total=1260 [2024-11-16 09:36:43,275 INFO L87 Difference]: Start difference. First operand 8912 states and 11628 transitions. Second operand has 36 states, 36 states have (on average 8.194444444444445) internal successors, (295), 36 states have internal predecessors, (295), 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)