./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.3.1.ufo.UNBOUNDED.pals+Problem12_label04.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.3.1.ufo.UNBOUNDED.pals+Problem12_label04.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 12e64e5880a6492945a65c8a75846fcd1e471751df63fa7462470a498bbbc9fb --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 00:46:20,501 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 00:46:20,573 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 00:46:20,578 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 00:46:20,578 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 00:46:20,614 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 00:46:20,615 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 00:46:20,616 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 00:46:20,617 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 00:46:20,618 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 00:46:20,619 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 00:46:20,619 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 00:46:20,620 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 00:46:20,622 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 00:46:20,622 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 00:46:20,622 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 00:46:20,623 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 00:46:20,623 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 00:46:20,623 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 00:46:20,623 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 00:46:20,624 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 00:46:20,627 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 00:46:20,627 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 00:46:20,627 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 00:46:20,628 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 00:46:20,628 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 00:46:20,628 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 00:46:20,628 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 00:46:20,629 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 00:46:20,629 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 00:46:20,629 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 00:46:20,630 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 00:46:20,630 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:46:20,630 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 00:46:20,631 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 00:46:20,631 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 00:46:20,632 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 00:46:20,632 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 00:46:20,632 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 00:46:20,633 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 00:46:20,633 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 00:46:20,633 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 00:46:20,633 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 -> 12e64e5880a6492945a65c8a75846fcd1e471751df63fa7462470a498bbbc9fb [2024-11-10 00:46:20,902 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 00:46:20,924 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 00:46:20,929 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 00:46:20,931 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 00:46:20,931 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 00:46:20,932 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.3.1.ufo.UNBOUNDED.pals+Problem12_label04.c [2024-11-10 00:46:22,389 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 00:46:22,873 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 00:46:22,874 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.1.ufo.UNBOUNDED.pals+Problem12_label04.c [2024-11-10 00:46:22,905 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5366da89/b595ea0f588440f9a3c1bafa2d06aaf9/FLAG696d257a2 [2024-11-10 00:46:22,922 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5366da89/b595ea0f588440f9a3c1bafa2d06aaf9 [2024-11-10 00:46:22,925 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 00:46:22,927 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 00:46:22,930 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 00:46:22,931 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 00:46:22,936 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 00:46:22,937 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:46:22" (1/1) ... [2024-11-10 00:46:22,938 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@371b6ae0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:46:22, skipping insertion in model container [2024-11-10 00:46:22,938 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:46:22" (1/1) ... [2024-11-10 00:46:23,037 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 00:46:23,393 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.1.ufo.UNBOUNDED.pals+Problem12_label04.c[6487,6500] [2024-11-10 00:46:23,452 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.1.ufo.UNBOUNDED.pals+Problem12_label04.c[13548,13561] [2024-11-10 00:46:24,151 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:46:24,164 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 00:46:24,196 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.1.ufo.UNBOUNDED.pals+Problem12_label04.c[6487,6500] [2024-11-10 00:46:24,260 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.1.ufo.UNBOUNDED.pals+Problem12_label04.c[13548,13561] [2024-11-10 00:46:24,633 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:46:24,664 INFO L204 MainTranslator]: Completed translation [2024-11-10 00:46:24,664 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:46:24 WrapperNode [2024-11-10 00:46:24,665 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 00:46:24,666 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 00:46:24,666 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 00:46:24,666 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 00:46:24,673 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:46:24" (1/1) ... [2024-11-10 00:46:24,775 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:46:24" (1/1) ... [2024-11-10 00:46:25,046 INFO L138 Inliner]: procedures = 35, calls = 20, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 4982 [2024-11-10 00:46:25,047 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 00:46:25,048 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 00:46:25,048 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 00:46:25,048 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 00:46:25,058 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:46:24" (1/1) ... [2024-11-10 00:46:25,059 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:46:24" (1/1) ... [2024-11-10 00:46:25,107 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:46:24" (1/1) ... [2024-11-10 00:46:25,294 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 00:46:25,294 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:46:24" (1/1) ... [2024-11-10 00:46:25,295 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:46:24" (1/1) ... [2024-11-10 00:46:25,466 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:46:24" (1/1) ... [2024-11-10 00:46:25,485 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:46:24" (1/1) ... [2024-11-10 00:46:25,509 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:46:24" (1/1) ... [2024-11-10 00:46:25,524 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:46:24" (1/1) ... [2024-11-10 00:46:25,591 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 00:46:25,592 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 00:46:25,592 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 00:46:25,592 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 00:46:25,593 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:46:24" (1/1) ... [2024-11-10 00:46:25,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:46:25,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:46:25,623 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 00:46:25,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 00:46:25,664 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 00:46:25,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 00:46:25,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 00:46:25,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 00:46:25,749 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 00:46:25,752 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 00:46:30,854 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1989: havoc calculate_output_#t~ret29#1; [2024-11-10 00:46:30,854 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3468: havoc calculate_output2_#t~ret30#1; [2024-11-10 00:46:30,855 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4958: havoc calculate_output3_#t~ret31#1; [2024-11-10 00:46:31,152 INFO L? ?]: Removed 2071 outVars from TransFormulas that were not future-live. [2024-11-10 00:46:31,152 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 00:46:31,192 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 00:46:31,192 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 00:46:31,193 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:46:31 BoogieIcfgContainer [2024-11-10 00:46:31,193 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 00:46:31,196 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 00:46:31,196 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 00:46:31,200 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 00:46:31,200 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:46:22" (1/3) ... [2024-11-10 00:46:31,202 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a97b566 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:46:31, skipping insertion in model container [2024-11-10 00:46:31,202 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:46:24" (2/3) ... [2024-11-10 00:46:31,203 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a97b566 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:46:31, skipping insertion in model container [2024-11-10 00:46:31,203 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:46:31" (3/3) ... [2024-11-10 00:46:31,204 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.UNBOUNDED.pals+Problem12_label04.c [2024-11-10 00:46:31,220 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 00:46:31,221 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 00:46:31,329 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 00:46:31,336 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;@26b68011, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 00:46:31,338 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-10 00:46:31,349 INFO L276 IsEmpty]: Start isEmpty. Operand has 881 states, 878 states have (on average 2.673120728929385) internal successors, (2347), 880 states have internal predecessors, (2347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:31,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-10 00:46:31,358 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:46:31,358 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-10 00:46:31,359 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:46:31,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:46:31,364 INFO L85 PathProgramCache]: Analyzing trace with hash 516537996, now seen corresponding path program 1 times [2024-11-10 00:46:31,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:46:31,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499213269] [2024-11-10 00:46:31,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:46:31,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:46:31,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:46:31,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:46:31,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:46:31,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499213269] [2024-11-10 00:46:31,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499213269] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:46:31,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:46:31,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 00:46:31,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772310700] [2024-11-10 00:46:31,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:46:31,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 00:46:31,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:46:31,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 00:46:31,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 00:46:31,629 INFO L87 Difference]: Start difference. First operand has 881 states, 878 states have (on average 2.673120728929385) internal successors, (2347), 880 states have internal predecessors, (2347), 0 states have call successors, (0), 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-10 00:46:31,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:46:31,727 INFO L93 Difference]: Finished difference Result 1736 states and 4650 transitions. [2024-11-10 00:46:31,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 00:46:31,729 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-10 00:46:31,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:46:31,755 INFO L225 Difference]: With dead ends: 1736 [2024-11-10 00:46:31,755 INFO L226 Difference]: Without dead ends: 813 [2024-11-10 00:46:31,760 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 00:46:31,763 INFO L432 NwaCegarLoop]: 2276 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, 2276 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:46:31,764 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2276 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:46:31,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2024-11-10 00:46:31,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 813. [2024-11-10 00:46:31,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 811 states have (on average 2.727496917385943) internal successors, (2212), 812 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:31,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 2212 transitions. [2024-11-10 00:46:31,841 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 2212 transitions. Word has length 22 [2024-11-10 00:46:31,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:46:31,842 INFO L471 AbstractCegarLoop]: Abstraction has 813 states and 2212 transitions. [2024-11-10 00:46:31,842 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-10 00:46:31,843 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 2212 transitions. [2024-11-10 00:46:31,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-10 00:46:31,844 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:46:31,844 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-10 00:46:31,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 00:46:31,845 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:46:31,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:46:31,845 INFO L85 PathProgramCache]: Analyzing trace with hash 6003819, now seen corresponding path program 1 times [2024-11-10 00:46:31,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:46:31,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340706727] [2024-11-10 00:46:31,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:46:31,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:46:31,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:46:32,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:46:32,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:46:32,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340706727] [2024-11-10 00:46:32,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340706727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:46:32,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:46:32,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:46:32,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528014628] [2024-11-10 00:46:32,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:46:32,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:46:32,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:46:32,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:46:32,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:46:32,084 INFO L87 Difference]: Start difference. First operand 813 states and 2212 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-10 00:46:32,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:46:32,187 INFO L93 Difference]: Finished difference Result 852 states and 2269 transitions. [2024-11-10 00:46:32,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:46:32,188 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-10 00:46:32,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:46:32,193 INFO L225 Difference]: With dead ends: 852 [2024-11-10 00:46:32,193 INFO L226 Difference]: Without dead ends: 813 [2024-11-10 00:46:32,194 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:46:32,195 INFO L432 NwaCegarLoop]: 2210 mSDtfsCounter, 0 mSDsluCounter, 6609 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8819 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-10 00:46:32,196 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8819 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:46:32,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2024-11-10 00:46:32,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 813. [2024-11-10 00:46:32,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 811 states have (on average 2.7077681874229347) internal successors, (2196), 812 states have internal predecessors, (2196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:32,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 2196 transitions. [2024-11-10 00:46:32,232 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 2196 transitions. Word has length 22 [2024-11-10 00:46:32,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:46:32,233 INFO L471 AbstractCegarLoop]: Abstraction has 813 states and 2196 transitions. [2024-11-10 00:46:32,233 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-10 00:46:32,234 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 2196 transitions. [2024-11-10 00:46:32,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-10 00:46:32,235 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:46:32,236 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-10 00:46:32,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 00:46:32,236 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:46:32,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:46:32,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1519636538, now seen corresponding path program 1 times [2024-11-10 00:46:32,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:46:32,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090941870] [2024-11-10 00:46:32,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:46:32,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:46:32,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:46:32,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:46:32,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:46:32,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090941870] [2024-11-10 00:46:32,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090941870] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:46:32,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:46:32,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:46:32,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229128398] [2024-11-10 00:46:32,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:46:32,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:46:32,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:46:32,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:46:32,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:46:32,439 INFO L87 Difference]: Start difference. First operand 813 states and 2196 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-10 00:46:32,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:46:32,591 INFO L93 Difference]: Finished difference Result 1023 states and 2514 transitions. [2024-11-10 00:46:32,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 00:46:32,593 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-10 00:46:32,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:46:32,600 INFO L225 Difference]: With dead ends: 1023 [2024-11-10 00:46:32,600 INFO L226 Difference]: Without dead ends: 988 [2024-11-10 00:46:32,602 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-10 00:46:32,604 INFO L432 NwaCegarLoop]: 2190 mSDtfsCounter, 6708 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6708 SdHoareTripleChecker+Valid, 2492 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:46:32,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6708 Valid, 2492 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:46:32,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2024-11-10 00:46:32,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 845. [2024-11-10 00:46:32,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 845 states, 843 states have (on average 2.663107947805457) internal successors, (2245), 844 states have internal predecessors, (2245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:32,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 2245 transitions. [2024-11-10 00:46:32,637 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 2245 transitions. Word has length 37 [2024-11-10 00:46:32,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:46:32,637 INFO L471 AbstractCegarLoop]: Abstraction has 845 states and 2245 transitions. [2024-11-10 00:46:32,637 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-10 00:46:32,638 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 2245 transitions. [2024-11-10 00:46:32,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-10 00:46:32,641 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:46:32,642 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-10 00:46:32,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 00:46:32,642 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:46:32,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:46:32,643 INFO L85 PathProgramCache]: Analyzing trace with hash -2087439128, now seen corresponding path program 1 times [2024-11-10 00:46:32,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:46:32,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071706975] [2024-11-10 00:46:32,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:46:32,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:46:32,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:46:32,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:46:32,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:46:32,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071706975] [2024-11-10 00:46:32,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071706975] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:46:32,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:46:32,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:46:32,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610584728] [2024-11-10 00:46:32,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:46:32,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:46:32,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:46:32,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:46:32,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:46:32,876 INFO L87 Difference]: Start difference. First operand 845 states and 2245 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-10 00:46:32,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:46:32,981 INFO L93 Difference]: Finished difference Result 915 states and 2349 transitions. [2024-11-10 00:46:32,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:46:32,982 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-10 00:46:32,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:46:32,986 INFO L225 Difference]: With dead ends: 915 [2024-11-10 00:46:32,987 INFO L226 Difference]: Without dead ends: 848 [2024-11-10 00:46:32,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-10 00:46:32,991 INFO L432 NwaCegarLoop]: 2191 mSDtfsCounter, 6478 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6478 SdHoareTripleChecker+Valid, 2289 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-10 00:46:32,992 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6478 Valid, 2289 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:46:32,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2024-11-10 00:46:33,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 845. [2024-11-10 00:46:33,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 845 states, 843 states have (on average 2.6619217081850532) internal successors, (2244), 844 states have internal predecessors, (2244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:33,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 2244 transitions. [2024-11-10 00:46:33,019 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 2244 transitions. Word has length 39 [2024-11-10 00:46:33,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:46:33,020 INFO L471 AbstractCegarLoop]: Abstraction has 845 states and 2244 transitions. [2024-11-10 00:46:33,020 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-10 00:46:33,020 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 2244 transitions. [2024-11-10 00:46:33,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-10 00:46:33,021 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:46:33,021 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-10 00:46:33,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 00:46:33,022 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:46:33,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:46:33,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1437715677, now seen corresponding path program 1 times [2024-11-10 00:46:33,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:46:33,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273628790] [2024-11-10 00:46:33,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:46:33,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:46:33,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:46:33,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:46:33,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:46:33,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273628790] [2024-11-10 00:46:33,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273628790] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:46:33,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:46:33,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:46:33,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751334851] [2024-11-10 00:46:33,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:46:33,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:46:33,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:46:33,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:46:33,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:46:33,113 INFO L87 Difference]: Start difference. First operand 845 states and 2244 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-10 00:46:33,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:46:33,164 INFO L93 Difference]: Finished difference Result 967 states and 2426 transitions. [2024-11-10 00:46:33,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:46:33,165 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-10 00:46:33,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:46:33,170 INFO L225 Difference]: With dead ends: 967 [2024-11-10 00:46:33,170 INFO L226 Difference]: Without dead ends: 900 [2024-11-10 00:46:33,171 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:46:33,171 INFO L432 NwaCegarLoop]: 2192 mSDtfsCounter, 2152 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2152 SdHoareTripleChecker+Valid, 2238 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:46:33,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2152 Valid, 2238 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:46:33,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2024-11-10 00:46:33,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 895. [2024-11-10 00:46:33,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 895 states, 893 states have (on average 2.593505039193729) internal successors, (2316), 894 states have internal predecessors, (2316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:33,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 2316 transitions. [2024-11-10 00:46:33,202 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 2316 transitions. Word has length 40 [2024-11-10 00:46:33,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:46:33,204 INFO L471 AbstractCegarLoop]: Abstraction has 895 states and 2316 transitions. [2024-11-10 00:46:33,204 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-10 00:46:33,204 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 2316 transitions. [2024-11-10 00:46:33,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-10 00:46:33,206 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:46:33,206 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-10 00:46:33,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 00:46:33,206 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:46:33,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:46:33,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1044566890, now seen corresponding path program 1 times [2024-11-10 00:46:33,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:46:33,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248163432] [2024-11-10 00:46:33,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:46:33,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:46:33,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:46:33,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:46:33,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:46:33,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248163432] [2024-11-10 00:46:33,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248163432] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:46:33,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:46:33,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:46:33,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292685668] [2024-11-10 00:46:33,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:46:33,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:46:33,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:46:33,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:46:33,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:46:33,271 INFO L87 Difference]: Start difference. First operand 895 states and 2316 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-10 00:46:33,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:46:33,313 INFO L93 Difference]: Finished difference Result 1113 states and 2634 transitions. [2024-11-10 00:46:33,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:46:33,313 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-10 00:46:33,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:46:33,318 INFO L225 Difference]: With dead ends: 1113 [2024-11-10 00:46:33,319 INFO L226 Difference]: Without dead ends: 996 [2024-11-10 00:46:33,319 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:46:33,321 INFO L432 NwaCegarLoop]: 2225 mSDtfsCounter, 2161 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2161 SdHoareTripleChecker+Valid, 2283 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:46:33,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2161 Valid, 2283 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:46:33,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 996 states. [2024-11-10 00:46:33,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 996 to 993. [2024-11-10 00:46:33,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 993 states, 991 states have (on average 2.477295660948537) internal successors, (2455), 992 states have internal predecessors, (2455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:33,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 2455 transitions. [2024-11-10 00:46:33,355 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 2455 transitions. Word has length 41 [2024-11-10 00:46:33,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:46:33,356 INFO L471 AbstractCegarLoop]: Abstraction has 993 states and 2455 transitions. [2024-11-10 00:46:33,356 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-10 00:46:33,356 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 2455 transitions. [2024-11-10 00:46:33,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-10 00:46:33,359 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:46:33,359 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-10 00:46:33,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 00:46:33,359 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:46:33,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:46:33,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1158797654, now seen corresponding path program 1 times [2024-11-10 00:46:33,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:46:33,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122984083] [2024-11-10 00:46:33,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:46:33,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:46:33,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:46:33,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:46:33,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:46:33,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122984083] [2024-11-10 00:46:33,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122984083] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:46:33,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:46:33,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:46:33,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457784763] [2024-11-10 00:46:33,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:46:33,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:46:33,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:46:33,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:46:33,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:46:33,414 INFO L87 Difference]: Start difference. First operand 993 states and 2455 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-10 00:46:33,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:46:33,457 INFO L93 Difference]: Finished difference Result 1391 states and 3023 transitions. [2024-11-10 00:46:33,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:46:33,458 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-10 00:46:33,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:46:33,464 INFO L225 Difference]: With dead ends: 1391 [2024-11-10 00:46:33,464 INFO L226 Difference]: Without dead ends: 1176 [2024-11-10 00:46:33,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:46:33,466 INFO L432 NwaCegarLoop]: 2223 mSDtfsCounter, 2159 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2159 SdHoareTripleChecker+Valid, 2285 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:46:33,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2159 Valid, 2285 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:46:33,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2024-11-10 00:46:33,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 1173. [2024-11-10 00:46:33,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1173 states, 1171 states have (on average 2.3065755764304012) internal successors, (2701), 1172 states have internal predecessors, (2701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:33,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 1173 states and 2701 transitions. [2024-11-10 00:46:33,495 INFO L78 Accepts]: Start accepts. Automaton has 1173 states and 2701 transitions. Word has length 41 [2024-11-10 00:46:33,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:46:33,495 INFO L471 AbstractCegarLoop]: Abstraction has 1173 states and 2701 transitions. [2024-11-10 00:46:33,496 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-10 00:46:33,496 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 2701 transitions. [2024-11-10 00:46:33,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-10 00:46:33,496 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:46:33,497 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-10 00:46:33,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 00:46:33,497 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:46:33,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:46:33,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1683074709, now seen corresponding path program 1 times [2024-11-10 00:46:33,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:46:33,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192910875] [2024-11-10 00:46:33,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:46:33,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:46:33,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:46:33,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:46:33,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:46:33,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192910875] [2024-11-10 00:46:33,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192910875] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:46:33,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:46:33,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:46:33,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197896680] [2024-11-10 00:46:33,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:46:33,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:46:33,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:46:33,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:46:33,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:46:33,747 INFO L87 Difference]: Start difference. First operand 1173 states and 2701 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 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-10 00:46:33,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:46:33,837 INFO L93 Difference]: Finished difference Result 1200 states and 2735 transitions. [2024-11-10 00:46:33,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:46:33,837 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 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-10 00:46:33,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:46:33,843 INFO L225 Difference]: With dead ends: 1200 [2024-11-10 00:46:33,843 INFO L226 Difference]: Without dead ends: 1197 [2024-11-10 00:46:33,844 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:46:33,844 INFO L432 NwaCegarLoop]: 2190 mSDtfsCounter, 0 mSDsluCounter, 13127 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15317 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:46:33,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 15317 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:46:33,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2024-11-10 00:46:33,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 1197. [2024-11-10 00:46:33,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1197 states, 1195 states have (on average 2.276987447698745) internal successors, (2721), 1196 states have internal predecessors, (2721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:33,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1197 states to 1197 states and 2721 transitions. [2024-11-10 00:46:33,872 INFO L78 Accepts]: Start accepts. Automaton has 1197 states and 2721 transitions. Word has length 41 [2024-11-10 00:46:33,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:46:33,873 INFO L471 AbstractCegarLoop]: Abstraction has 1197 states and 2721 transitions. [2024-11-10 00:46:33,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 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-10 00:46:33,873 INFO L276 IsEmpty]: Start isEmpty. Operand 1197 states and 2721 transitions. [2024-11-10 00:46:33,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-10 00:46:33,874 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:46:33,874 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] [2024-11-10 00:46:33,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 00:46:33,874 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:46:33,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:46:33,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1278516470, now seen corresponding path program 1 times [2024-11-10 00:46:33,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:46:33,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308374617] [2024-11-10 00:46:33,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:46:33,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:46:33,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:46:33,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:46:33,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:46:33,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308374617] [2024-11-10 00:46:33,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308374617] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:46:33,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:46:33,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:46:33,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400582504] [2024-11-10 00:46:33,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:46:33,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:46:33,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:46:33,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:46:33,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:46:33,918 INFO L87 Difference]: Start difference. First operand 1197 states and 2721 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:33,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:46:33,951 INFO L93 Difference]: Finished difference Result 1655 states and 3362 transitions. [2024-11-10 00:46:33,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:46:33,951 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2024-11-10 00:46:33,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:46:33,957 INFO L225 Difference]: With dead ends: 1655 [2024-11-10 00:46:33,958 INFO L226 Difference]: Without dead ends: 1403 [2024-11-10 00:46:33,958 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:46:33,959 INFO L432 NwaCegarLoop]: 2230 mSDtfsCounter, 2160 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2160 SdHoareTripleChecker+Valid, 2284 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:46:33,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2160 Valid, 2284 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:46:33,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2024-11-10 00:46:33,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 1400. [2024-11-10 00:46:33,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1400 states, 1398 states have (on average 2.140200286123033) internal successors, (2992), 1399 states have internal predecessors, (2992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:33,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1400 states to 1400 states and 2992 transitions. [2024-11-10 00:46:33,991 INFO L78 Accepts]: Start accepts. Automaton has 1400 states and 2992 transitions. Word has length 43 [2024-11-10 00:46:33,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:46:33,991 INFO L471 AbstractCegarLoop]: Abstraction has 1400 states and 2992 transitions. [2024-11-10 00:46:33,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:33,991 INFO L276 IsEmpty]: Start isEmpty. Operand 1400 states and 2992 transitions. [2024-11-10 00:46:33,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-10 00:46:33,992 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:46:33,992 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-10 00:46:33,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 00:46:33,993 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:46:33,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:46:33,993 INFO L85 PathProgramCache]: Analyzing trace with hash 2051803116, now seen corresponding path program 1 times [2024-11-10 00:46:33,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:46:33,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507329064] [2024-11-10 00:46:33,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:46:33,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:46:34,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:46:34,108 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-10 00:46:34,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:46:34,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507329064] [2024-11-10 00:46:34,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507329064] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:46:34,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:46:34,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:46:34,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034917430] [2024-11-10 00:46:34,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:46:34,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:46:34,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:46:34,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:46:34,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:46:34,111 INFO L87 Difference]: Start difference. First operand 1400 states and 2992 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-10 00:46:34,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:46:34,212 INFO L93 Difference]: Finished difference Result 3404 states and 5720 transitions. [2024-11-10 00:46:34,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:46:34,213 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-10 00:46:34,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:46:34,224 INFO L225 Difference]: With dead ends: 3404 [2024-11-10 00:46:34,225 INFO L226 Difference]: Without dead ends: 2785 [2024-11-10 00:46:34,226 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-10 00:46:34,227 INFO L432 NwaCegarLoop]: 2240 mSDtfsCounter, 4428 mSDsluCounter, 2298 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4428 SdHoareTripleChecker+Valid, 4538 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:46:34,227 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4428 Valid, 4538 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:46:34,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2785 states. [2024-11-10 00:46:34,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2785 to 2016. [2024-11-10 00:46:34,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2016 states, 2014 states have (on average 1.8987090367428003) internal successors, (3824), 2015 states have internal predecessors, (3824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:34,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2016 states to 2016 states and 3824 transitions. [2024-11-10 00:46:34,323 INFO L78 Accepts]: Start accepts. Automaton has 2016 states and 3824 transitions. Word has length 58 [2024-11-10 00:46:34,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:46:34,324 INFO L471 AbstractCegarLoop]: Abstraction has 2016 states and 3824 transitions. [2024-11-10 00:46:34,324 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-10 00:46:34,324 INFO L276 IsEmpty]: Start isEmpty. Operand 2016 states and 3824 transitions. [2024-11-10 00:46:34,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-10 00:46:34,325 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:46:34,325 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-10 00:46:34,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 00:46:34,326 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:46:34,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:46:34,326 INFO L85 PathProgramCache]: Analyzing trace with hash -151561428, now seen corresponding path program 1 times [2024-11-10 00:46:34,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:46:34,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913849259] [2024-11-10 00:46:34,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:46:34,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:46:34,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:46:34,423 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-10 00:46:34,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:46:34,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913849259] [2024-11-10 00:46:34,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913849259] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:46:34,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:46:34,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:46:34,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822408295] [2024-11-10 00:46:34,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:46:34,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:46:34,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:46:34,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:46:34,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:46:34,427 INFO L87 Difference]: Start difference. First operand 2016 states and 3824 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-10 00:46:34,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:46:34,539 INFO L93 Difference]: Finished difference Result 4020 states and 6552 transitions. [2024-11-10 00:46:34,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:46:34,540 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-10 00:46:34,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:46:34,554 INFO L225 Difference]: With dead ends: 4020 [2024-11-10 00:46:34,554 INFO L226 Difference]: Without dead ends: 3401 [2024-11-10 00:46:34,556 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-10 00:46:34,557 INFO L432 NwaCegarLoop]: 2240 mSDtfsCounter, 4433 mSDsluCounter, 2287 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4433 SdHoareTripleChecker+Valid, 4527 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:46:34,557 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4433 Valid, 4527 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:46:34,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3401 states. [2024-11-10 00:46:34,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3401 to 2944. [2024-11-10 00:46:34,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2944 states, 2942 states have (on average 1.7212780421481986) internal successors, (5064), 2943 states have internal predecessors, (5064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:34,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2944 states to 2944 states and 5064 transitions. [2024-11-10 00:46:34,636 INFO L78 Accepts]: Start accepts. Automaton has 2944 states and 5064 transitions. Word has length 58 [2024-11-10 00:46:34,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:46:34,637 INFO L471 AbstractCegarLoop]: Abstraction has 2944 states and 5064 transitions. [2024-11-10 00:46:34,637 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-10 00:46:34,637 INFO L276 IsEmpty]: Start isEmpty. Operand 2944 states and 5064 transitions. [2024-11-10 00:46:34,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 00:46:34,638 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:46:34,638 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-10 00:46:34,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 00:46:34,639 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:46:34,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:46:34,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1612801138, now seen corresponding path program 1 times [2024-11-10 00:46:34,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:46:34,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004934147] [2024-11-10 00:46:34,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:46:34,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:46:34,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:46:34,736 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-10 00:46:34,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:46:34,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004934147] [2024-11-10 00:46:34,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004934147] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:46:34,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:46:34,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:46:34,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499523501] [2024-11-10 00:46:34,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:46:34,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:46:34,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:46:34,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:46:34,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:46:34,738 INFO L87 Difference]: Start difference. First operand 2944 states and 5064 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:34,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:46:34,798 INFO L93 Difference]: Finished difference Result 4536 states and 7243 transitions. [2024-11-10 00:46:34,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:46:34,799 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-10 00:46:34,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:46:34,809 INFO L225 Difference]: With dead ends: 4536 [2024-11-10 00:46:34,809 INFO L226 Difference]: Without dead ends: 2373 [2024-11-10 00:46:34,812 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:46:34,813 INFO L432 NwaCegarLoop]: 2222 mSDtfsCounter, 35 mSDsluCounter, 2181 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 4403 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:46:34,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 4403 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:46:34,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2373 states. [2024-11-10 00:46:34,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2373 to 2370. [2024-11-10 00:46:34,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2370 states, 2368 states have (on average 1.8133445945945945) internal successors, (4294), 2369 states have internal predecessors, (4294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:34,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2370 states to 2370 states and 4294 transitions. [2024-11-10 00:46:34,874 INFO L78 Accepts]: Start accepts. Automaton has 2370 states and 4294 transitions. Word has length 60 [2024-11-10 00:46:34,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:46:34,875 INFO L471 AbstractCegarLoop]: Abstraction has 2370 states and 4294 transitions. [2024-11-10 00:46:34,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:34,875 INFO L276 IsEmpty]: Start isEmpty. Operand 2370 states and 4294 transitions. [2024-11-10 00:46:34,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 00:46:34,876 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:46:34,876 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] [2024-11-10 00:46:34,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 00:46:34,876 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:46:34,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:46:34,877 INFO L85 PathProgramCache]: Analyzing trace with hash 307855116, now seen corresponding path program 1 times [2024-11-10 00:46:34,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:46:34,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438655616] [2024-11-10 00:46:34,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:46:34,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:46:34,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:46:35,001 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-10 00:46:35,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:46:35,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438655616] [2024-11-10 00:46:35,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438655616] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:46:35,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:46:35,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:46:35,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880873943] [2024-11-10 00:46:35,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:46:35,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:46:35,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:46:35,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:46:35,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:46:35,005 INFO L87 Difference]: Start difference. First operand 2370 states and 4294 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:35,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:46:35,104 INFO L93 Difference]: Finished difference Result 3726 states and 6150 transitions. [2024-11-10 00:46:35,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:46:35,105 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-10 00:46:35,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:46:35,124 INFO L225 Difference]: With dead ends: 3726 [2024-11-10 00:46:35,124 INFO L226 Difference]: Without dead ends: 3275 [2024-11-10 00:46:35,130 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-10 00:46:35,131 INFO L432 NwaCegarLoop]: 2236 mSDtfsCounter, 4431 mSDsluCounter, 2318 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4431 SdHoareTripleChecker+Valid, 4554 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:46:35,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4431 Valid, 4554 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:46:35,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3275 states. [2024-11-10 00:46:35,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3275 to 2818. [2024-11-10 00:46:35,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2818 states, 2816 states have (on average 1.7407670454545454) internal successors, (4902), 2817 states have internal predecessors, (4902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:35,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2818 states to 2818 states and 4902 transitions. [2024-11-10 00:46:35,207 INFO L78 Accepts]: Start accepts. Automaton has 2818 states and 4902 transitions. Word has length 60 [2024-11-10 00:46:35,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:46:35,208 INFO L471 AbstractCegarLoop]: Abstraction has 2818 states and 4902 transitions. [2024-11-10 00:46:35,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:35,208 INFO L276 IsEmpty]: Start isEmpty. Operand 2818 states and 4902 transitions. [2024-11-10 00:46:35,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-10 00:46:35,209 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:46:35,209 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:46:35,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 00:46:35,209 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:46:35,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:46:35,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1785383598, now seen corresponding path program 1 times [2024-11-10 00:46:35,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:46:35,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147939168] [2024-11-10 00:46:35,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:46:35,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:46:35,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:46:35,297 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-10 00:46:35,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:46:35,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147939168] [2024-11-10 00:46:35,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147939168] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:46:35,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:46:35,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:46:35,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655785680] [2024-11-10 00:46:35,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:46:35,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:46:35,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:46:35,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:46:35,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:46:35,299 INFO L87 Difference]: Start difference. First operand 2818 states and 4902 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-10 00:46:35,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:46:35,340 INFO L93 Difference]: Finished difference Result 3832 states and 6274 transitions. [2024-11-10 00:46:35,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:46:35,341 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-10 00:46:35,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:46:35,346 INFO L225 Difference]: With dead ends: 3832 [2024-11-10 00:46:35,346 INFO L226 Difference]: Without dead ends: 1813 [2024-11-10 00:46:35,348 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:46:35,349 INFO L432 NwaCegarLoop]: 2215 mSDtfsCounter, 28 mSDsluCounter, 2173 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 4388 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:46:35,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 4388 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:46:35,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1813 states. [2024-11-10 00:46:35,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1813 to 1810. [2024-11-10 00:46:35,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1810 states, 1808 states have (on average 1.9446902654867257) internal successors, (3516), 1809 states have internal predecessors, (3516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:35,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1810 states to 1810 states and 3516 transitions. [2024-11-10 00:46:35,392 INFO L78 Accepts]: Start accepts. Automaton has 1810 states and 3516 transitions. Word has length 62 [2024-11-10 00:46:35,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:46:35,392 INFO L471 AbstractCegarLoop]: Abstraction has 1810 states and 3516 transitions. [2024-11-10 00:46:35,393 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-10 00:46:35,393 INFO L276 IsEmpty]: Start isEmpty. Operand 1810 states and 3516 transitions. [2024-11-10 00:46:35,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-10 00:46:35,393 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:46:35,394 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:46:35,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 00:46:35,394 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:46:35,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:46:35,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1665451369, now seen corresponding path program 1 times [2024-11-10 00:46:35,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:46:35,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47431134] [2024-11-10 00:46:35,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:46:35,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:46:35,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:46:35,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:46:35,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:46:35,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47431134] [2024-11-10 00:46:35,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47431134] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:46:35,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:46:35,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:46:35,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167066428] [2024-11-10 00:46:35,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:46:35,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 00:46:35,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:46:35,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 00:46:35,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 00:46:35,526 INFO L87 Difference]: Start difference. First operand 1810 states and 3516 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:43,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:46:43,034 INFO L93 Difference]: Finished difference Result 4069 states and 9869 transitions. [2024-11-10 00:46:43,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 00:46:43,034 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-11-10 00:46:43,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:46:43,041 INFO L225 Difference]: With dead ends: 4069 [2024-11-10 00:46:43,041 INFO L226 Difference]: Without dead ends: 3314 [2024-11-10 00:46:43,043 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:46:43,043 INFO L432 NwaCegarLoop]: 770 mSDtfsCounter, 4389 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 7874 mSolverCounterSat, 1245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4389 SdHoareTripleChecker+Valid, 793 SdHoareTripleChecker+Invalid, 9119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1245 IncrementalHoareTripleChecker+Valid, 7874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2024-11-10 00:46:43,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4389 Valid, 793 Invalid, 9119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1245 Valid, 7874 Invalid, 0 Unknown, 0 Unchecked, 7.4s Time] [2024-11-10 00:46:43,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3314 states. [2024-11-10 00:46:43,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3314 to 3314. [2024-11-10 00:46:43,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3314 states, 3312 states have (on average 2.0694444444444446) internal successors, (6854), 3313 states have internal predecessors, (6854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:43,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3314 states to 3314 states and 6854 transitions. [2024-11-10 00:46:43,116 INFO L78 Accepts]: Start accepts. Automaton has 3314 states and 6854 transitions. Word has length 63 [2024-11-10 00:46:43,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:46:43,116 INFO L471 AbstractCegarLoop]: Abstraction has 3314 states and 6854 transitions. [2024-11-10 00:46:43,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:43,116 INFO L276 IsEmpty]: Start isEmpty. Operand 3314 states and 6854 transitions. [2024-11-10 00:46:43,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-10 00:46:43,117 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:46:43,117 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, 1, 1] [2024-11-10 00:46:43,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 00:46:43,118 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:46:43,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:46:43,118 INFO L85 PathProgramCache]: Analyzing trace with hash -909439056, now seen corresponding path program 1 times [2024-11-10 00:46:43,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:46:43,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953332970] [2024-11-10 00:46:43,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:46:43,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:46:43,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:46:43,198 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-10 00:46:43,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:46:43,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953332970] [2024-11-10 00:46:43,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953332970] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:46:43,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:46:43,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:46:43,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740210053] [2024-11-10 00:46:43,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:46:43,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:46:43,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:46:43,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:46:43,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:46:43,201 INFO L87 Difference]: Start difference. First operand 3314 states and 6854 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:43,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:46:43,287 INFO L93 Difference]: Finished difference Result 3824 states and 7533 transitions. [2024-11-10 00:46:43,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:46:43,288 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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-10 00:46:43,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:46:43,295 INFO L225 Difference]: With dead ends: 3824 [2024-11-10 00:46:43,295 INFO L226 Difference]: Without dead ends: 2813 [2024-11-10 00:46:43,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:46:43,297 INFO L432 NwaCegarLoop]: 2208 mSDtfsCounter, 23 mSDsluCounter, 2165 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 4373 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:46:43,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 4373 Invalid, 5 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:46:43,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2813 states. [2024-11-10 00:46:43,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2813 to 2810. [2024-11-10 00:46:43,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2810 states, 2808 states have (on average 2.1972934472934473) internal successors, (6170), 2809 states have internal predecessors, (6170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:43,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2810 states to 2810 states and 6170 transitions. [2024-11-10 00:46:43,379 INFO L78 Accepts]: Start accepts. Automaton has 2810 states and 6170 transitions. Word has length 64 [2024-11-10 00:46:43,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:46:43,379 INFO L471 AbstractCegarLoop]: Abstraction has 2810 states and 6170 transitions. [2024-11-10 00:46:43,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:43,380 INFO L276 IsEmpty]: Start isEmpty. Operand 2810 states and 6170 transitions. [2024-11-10 00:46:43,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-10 00:46:43,381 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:46:43,381 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, 1, 1] [2024-11-10 00:46:43,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 00:46:43,382 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:46:43,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:46:43,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1765907433, now seen corresponding path program 1 times [2024-11-10 00:46:43,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:46:43,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299917334] [2024-11-10 00:46:43,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:46:43,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:46:43,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:46: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-10 00:46:43,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:46:43,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299917334] [2024-11-10 00:46:43,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299917334] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:46:43,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [337367711] [2024-11-10 00:46:43,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:46:43,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:46:43,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:46:43,862 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:46:43,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 00:46:44,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:46:44,024 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-10 00:46:44,033 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:46:44,603 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-10 00:46:44,604 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:46:45,395 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-10 00:46:45,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [337367711] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:46:45,396 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:46:45,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2024-11-10 00:46:45,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351435311] [2024-11-10 00:46:45,396 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:46:45,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-10 00:46:45,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:46:45,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-10 00:46:45,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2024-11-10 00:46:45,397 INFO L87 Difference]: Start difference. First operand 2810 states and 6170 transitions. Second operand has 22 states, 22 states have (on average 6.818181818181818) internal successors, (150), 21 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:45,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:46:45,901 INFO L93 Difference]: Finished difference Result 3881 states and 7589 transitions. [2024-11-10 00:46:45,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 00:46:45,901 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 6.818181818181818) internal successors, (150), 21 states have internal predecessors, (150), 0 states have call successors, (0), 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 66 [2024-11-10 00:46:45,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:46:45,908 INFO L225 Difference]: With dead ends: 3881 [2024-11-10 00:46:45,908 INFO L226 Difference]: Without dead ends: 3374 [2024-11-10 00:46:45,910 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=230, Invalid=762, Unknown=0, NotChecked=0, Total=992 [2024-11-10 00:46:45,911 INFO L432 NwaCegarLoop]: 2177 mSDtfsCounter, 28511 mSDsluCounter, 8851 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28511 SdHoareTripleChecker+Valid, 11028 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 00:46:45,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28511 Valid, 11028 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 00:46:45,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3374 states. [2024-11-10 00:46:45,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3374 to 3350. [2024-11-10 00:46:45,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3350 states, 3348 states have (on average 2.0498805256869774) internal successors, (6863), 3349 states have internal predecessors, (6863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:45,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3350 states to 3350 states and 6863 transitions. [2024-11-10 00:46:45,972 INFO L78 Accepts]: Start accepts. Automaton has 3350 states and 6863 transitions. Word has length 66 [2024-11-10 00:46:45,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:46:45,973 INFO L471 AbstractCegarLoop]: Abstraction has 3350 states and 6863 transitions. [2024-11-10 00:46:45,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 6.818181818181818) internal successors, (150), 21 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:45,973 INFO L276 IsEmpty]: Start isEmpty. Operand 3350 states and 6863 transitions. [2024-11-10 00:46:45,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-10 00:46:45,974 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:46:45,974 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, 1, 1] [2024-11-10 00:46:45,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 00:46:46,175 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-10 00:46:46,175 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:46:46,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:46:46,176 INFO L85 PathProgramCache]: Analyzing trace with hash 248454647, now seen corresponding path program 1 times [2024-11-10 00:46:46,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:46:46,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391467118] [2024-11-10 00:46:46,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:46:46,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:46:46,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:46:46,516 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-10 00:46:46,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:46:46,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391467118] [2024-11-10 00:46:46,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391467118] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:46:46,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995906345] [2024-11-10 00:46:46,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:46:46,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:46:46,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:46:46,519 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:46:46,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 00:46:46,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:46:46,684 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-10 00:46:46,687 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:46:51,145 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-10 00:46:51,146 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:46:53,237 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-10 00:46:53,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1995906345] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:46:53,238 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:46:53,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 17, 20] total 44 [2024-11-10 00:46:53,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679417930] [2024-11-10 00:46:53,239 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:46:53,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-11-10 00:46:53,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:46:53,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-10 00:46:53,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=1564, Unknown=0, NotChecked=0, Total=1892 [2024-11-10 00:46:53,241 INFO L87 Difference]: Start difference. First operand 3350 states and 6863 transitions. Second operand has 44 states, 44 states have (on average 4.0) internal successors, (176), 44 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:01,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:47:01,419 INFO L93 Difference]: Finished difference Result 10001 states and 15483 transitions. [2024-11-10 00:47:01,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2024-11-10 00:47:01,419 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 4.0) internal successors, (176), 44 states have internal predecessors, (176), 0 states have call successors, (0), 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 66 [2024-11-10 00:47:01,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:47:01,435 INFO L225 Difference]: With dead ends: 10001 [2024-11-10 00:47:01,435 INFO L226 Difference]: Without dead ends: 8954 [2024-11-10 00:47:01,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4699 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=3071, Invalid=11691, Unknown=0, NotChecked=0, Total=14762 [2024-11-10 00:47:01,441 INFO L432 NwaCegarLoop]: 2198 mSDtfsCounter, 20006 mSDsluCounter, 24898 mSDsCounter, 0 mSdLazyCounter, 1378 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20006 SdHoareTripleChecker+Valid, 27096 SdHoareTripleChecker+Invalid, 1500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 1378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:47:01,442 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20006 Valid, 27096 Invalid, 1500 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [122 Valid, 1378 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-10 00:47:01,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8954 states. [2024-11-10 00:47:01,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8954 to 5690. [2024-11-10 00:47:01,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5690 states, 5688 states have (on average 1.735056258790436) internal successors, (9869), 5689 states have internal predecessors, (9869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:01,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5690 states to 5690 states and 9869 transitions. [2024-11-10 00:47:01,609 INFO L78 Accepts]: Start accepts. Automaton has 5690 states and 9869 transitions. Word has length 66 [2024-11-10 00:47:01,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:47:01,609 INFO L471 AbstractCegarLoop]: Abstraction has 5690 states and 9869 transitions. [2024-11-10 00:47:01,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 4.0) internal successors, (176), 44 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:01,610 INFO L276 IsEmpty]: Start isEmpty. Operand 5690 states and 9869 transitions. [2024-11-10 00:47:01,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-10 00:47:01,611 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:47:01,611 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, 1, 1, 1] [2024-11-10 00:47:01,628 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 00:47:01,811 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-10 00:47:01,812 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:47:01,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:47:01,813 INFO L85 PathProgramCache]: Analyzing trace with hash 762992487, now seen corresponding path program 1 times [2024-11-10 00:47:01,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:47:01,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081312452] [2024-11-10 00:47:01,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:01,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:47:01,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:03,229 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-10 00:47:03,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:47:03,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081312452] [2024-11-10 00:47:03,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081312452] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:47:03,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102311030] [2024-11-10 00:47:03,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:03,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:47:03,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:47:03,233 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:47:03,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 00:47:03,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:03,433 INFO L255 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-10 00:47:03,437 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:47:05,447 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-10 00:47:05,448 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:47:07,061 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-10 00:47:07,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [102311030] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:47:07,062 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:47:07,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19, 21] total 57 [2024-11-10 00:47:07,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022986536] [2024-11-10 00:47:07,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:47:07,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2024-11-10 00:47:07,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:47:07,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2024-11-10 00:47:07,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=2885, Unknown=0, NotChecked=0, Total=3192 [2024-11-10 00:47:07,066 INFO L87 Difference]: Start difference. First operand 5690 states and 9869 transitions. Second operand has 57 states, 57 states have (on average 3.1578947368421053) internal successors, (180), 57 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:19,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:47:19,658 INFO L93 Difference]: Finished difference Result 12737 states and 18884 transitions. [2024-11-10 00:47:19,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2024-11-10 00:47:19,659 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 3.1578947368421053) internal successors, (180), 57 states have internal predecessors, (180), 0 states have call successors, (0), 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-10 00:47:19,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:47:19,677 INFO L225 Difference]: With dead ends: 12737 [2024-11-10 00:47:19,677 INFO L226 Difference]: Without dead ends: 10934 [2024-11-10 00:47:19,686 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6579 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=4780, Invalid=19400, Unknown=0, NotChecked=0, Total=24180 [2024-11-10 00:47:19,687 INFO L432 NwaCegarLoop]: 2235 mSDtfsCounter, 39048 mSDsluCounter, 43728 mSDsCounter, 0 mSdLazyCounter, 3028 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39048 SdHoareTripleChecker+Valid, 45963 SdHoareTripleChecker+Invalid, 3148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 3028 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-10 00:47:19,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39048 Valid, 45963 Invalid, 3148 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [120 Valid, 3028 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-10 00:47:19,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10934 states. [2024-11-10 00:47:19,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10934 to 5474. [2024-11-10 00:47:19,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5474 states, 5472 states have (on average 1.7507309941520468) internal successors, (9580), 5473 states have internal predecessors, (9580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:19,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5474 states to 5474 states and 9580 transitions. [2024-11-10 00:47:19,898 INFO L78 Accepts]: Start accepts. Automaton has 5474 states and 9580 transitions. Word has length 67 [2024-11-10 00:47:19,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:47:19,898 INFO L471 AbstractCegarLoop]: Abstraction has 5474 states and 9580 transitions. [2024-11-10 00:47:19,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 3.1578947368421053) internal successors, (180), 57 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:19,899 INFO L276 IsEmpty]: Start isEmpty. Operand 5474 states and 9580 transitions. [2024-11-10 00:47:19,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-10 00:47:19,900 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:47:19,900 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:47:19,919 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-10 00:47:20,101 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-10 00:47:20,101 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:47:20,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:47:20,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1220188773, now seen corresponding path program 1 times [2024-11-10 00:47:20,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:47:20,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921759856] [2024-11-10 00:47:20,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:20,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:47:20,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:20,452 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:47:20,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:47:20,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921759856] [2024-11-10 00:47:20,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921759856] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:47:20,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474916297] [2024-11-10 00:47:20,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:20,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:47:20,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:47:20,455 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:47:20,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 00:47:20,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:20,602 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-10 00:47:20,610 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:47:20,760 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 00:47:20,762 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:47:20,912 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 00:47:20,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1474916297] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:47:20,912 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:47:20,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 4] total 16 [2024-11-10 00:47:20,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486579481] [2024-11-10 00:47:20,913 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:47:20,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-10 00:47:20,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:47:20,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-10 00:47:20,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2024-11-10 00:47:20,915 INFO L87 Difference]: Start difference. First operand 5474 states and 9580 transitions. Second operand has 16 states, 16 states have (on average 11.3125) internal successors, (181), 16 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:22,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:47:22,165 INFO L93 Difference]: Finished difference Result 12756 states and 18754 transitions. [2024-11-10 00:47:22,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-10 00:47:22,165 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 11.3125) internal successors, (181), 16 states have internal predecessors, (181), 0 states have call successors, (0), 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 68 [2024-11-10 00:47:22,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:47:22,182 INFO L225 Difference]: With dead ends: 12756 [2024-11-10 00:47:22,182 INFO L226 Difference]: Without dead ends: 9585 [2024-11-10 00:47:22,190 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=371, Invalid=1269, Unknown=0, NotChecked=0, Total=1640 [2024-11-10 00:47:22,191 INFO L432 NwaCegarLoop]: 2199 mSDtfsCounter, 17944 mSDsluCounter, 8952 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17944 SdHoareTripleChecker+Valid, 11151 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 00:47:22,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17944 Valid, 11151 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 00:47:22,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9585 states. [2024-11-10 00:47:22,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9585 to 9492. [2024-11-10 00:47:22,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9492 states, 9490 states have (on average 1.5003161222339305) internal successors, (14238), 9491 states have internal predecessors, (14238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:22,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9492 states to 9492 states and 14238 transitions. [2024-11-10 00:47:22,645 INFO L78 Accepts]: Start accepts. Automaton has 9492 states and 14238 transitions. Word has length 68 [2024-11-10 00:47:22,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:47:22,645 INFO L471 AbstractCegarLoop]: Abstraction has 9492 states and 14238 transitions. [2024-11-10 00:47:22,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 11.3125) internal successors, (181), 16 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:22,645 INFO L276 IsEmpty]: Start isEmpty. Operand 9492 states and 14238 transitions. [2024-11-10 00:47:22,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-10 00:47:22,646 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:47:22,646 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:47:22,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-10 00:47:22,847 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-10 00:47:22,847 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:47:22,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:47:22,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1496641001, now seen corresponding path program 1 times [2024-11-10 00:47:22,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:47:22,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99270468] [2024-11-10 00:47:22,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:22,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:47:22,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:24,220 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:47:24,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:47:24,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99270468] [2024-11-10 00:47:24,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99270468] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:47:24,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1658814723] [2024-11-10 00:47:24,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:24,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:47:24,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:47:24,222 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:47:24,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-10 00:47:24,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:24,362 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-10 00:47:24,365 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:47:26,004 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:47:26,005 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:47:28,407 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:47:28,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1658814723] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:47:28,407 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:47:28,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 16, 18] total 52 [2024-11-10 00:47:28,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662407949] [2024-11-10 00:47:28,407 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:47:28,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-10 00:47:28,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:47:28,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-10 00:47:28,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=2418, Unknown=0, NotChecked=0, Total=2652 [2024-11-10 00:47:28,410 INFO L87 Difference]: Start difference. First operand 9492 states and 14238 transitions. Second operand has 52 states, 52 states have (on average 3.423076923076923) internal successors, (178), 52 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:36,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:47:36,464 INFO L93 Difference]: Finished difference Result 15401 states and 21437 transitions. [2024-11-10 00:47:36,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2024-11-10 00:47:36,464 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 3.423076923076923) internal successors, (178), 52 states have internal predecessors, (178), 0 states have call successors, (0), 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 69 [2024-11-10 00:47:36,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:47:36,480 INFO L225 Difference]: With dead ends: 15401 [2024-11-10 00:47:36,480 INFO L226 Difference]: Without dead ends: 11296 [2024-11-10 00:47:36,490 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2590 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=1848, Invalid=9072, Unknown=0, NotChecked=0, Total=10920 [2024-11-10 00:47:36,490 INFO L432 NwaCegarLoop]: 2185 mSDtfsCounter, 31371 mSDsluCounter, 42806 mSDsCounter, 0 mSdLazyCounter, 2700 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31371 SdHoareTripleChecker+Valid, 44991 SdHoareTripleChecker+Invalid, 2774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 2700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-10 00:47:36,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31371 Valid, 44991 Invalid, 2774 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [74 Valid, 2700 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-10 00:47:36,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11296 states. [2024-11-10 00:47:36,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11296 to 8074. [2024-11-10 00:47:36,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8074 states, 8072 states have (on average 1.5561199207135779) internal successors, (12561), 8073 states have internal predecessors, (12561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:36,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8074 states to 8074 states and 12561 transitions. [2024-11-10 00:47:36,827 INFO L78 Accepts]: Start accepts. Automaton has 8074 states and 12561 transitions. Word has length 69 [2024-11-10 00:47:36,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:47:36,827 INFO L471 AbstractCegarLoop]: Abstraction has 8074 states and 12561 transitions. [2024-11-10 00:47:36,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 3.423076923076923) internal successors, (178), 52 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:36,827 INFO L276 IsEmpty]: Start isEmpty. Operand 8074 states and 12561 transitions. [2024-11-10 00:47:36,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-10 00:47:36,829 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:47:36,830 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, 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] [2024-11-10 00:47:36,850 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-10 00:47:37,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:47:37,031 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:47:37,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:47:37,031 INFO L85 PathProgramCache]: Analyzing trace with hash 54424277, now seen corresponding path program 1 times [2024-11-10 00:47:37,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:47:37,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920442460] [2024-11-10 00:47:37,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:37,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:47:37,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:37,812 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 16 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:47:37,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:47:37,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920442460] [2024-11-10 00:47:37,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920442460] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:47:37,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [291225891] [2024-11-10 00:47:37,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:37,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:47:37,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:47:37,814 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:47:37,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-10 00:47:37,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:37,955 INFO L255 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-10 00:47:37,957 INFO L278 TraceCheckSpWp]: Computing forward predicates...