./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.8_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.8_overflow.ufo.UNBOUNDED.pals+Problem12_label05.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 3fea2f68f947d5e58136ef35d3f027c4c03d3bc0c134cd3fe1f5c31a7ea21160 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 09:51:37,401 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 09:51:37,477 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 09:51:37,481 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 09:51:37,481 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 09:51:37,508 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 09:51:37,509 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 09:51:37,510 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 09:51:37,511 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 09:51:37,512 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 09:51:37,513 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 09:51:37,513 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 09:51:37,514 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 09:51:37,514 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 09:51:37,514 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 09:51:37,515 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 09:51:37,515 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 09:51:37,515 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 09:51:37,516 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 09:51:37,516 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 09:51:37,516 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 09:51:37,517 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 09:51:37,517 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 09:51:37,518 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 09:51:37,518 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 09:51:37,518 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 09:51:37,518 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 09:51:37,519 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 09:51:37,519 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 09:51:37,519 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 09:51:37,520 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 09:51:37,520 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 09:51:37,520 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 09:51:37,520 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 09:51:37,521 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 09:51:37,521 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 09:51:37,521 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 09:51:37,522 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 09:51:37,522 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 09:51:37,522 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 09:51:37,522 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 09:51:37,524 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 09:51:37,524 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 -> 3fea2f68f947d5e58136ef35d3f027c4c03d3bc0c134cd3fe1f5c31a7ea21160 [2024-11-16 09:51:37,847 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 09:51:37,874 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 09:51:37,878 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 09:51:37,880 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 09:51:37,881 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 09:51:37,882 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.8_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c [2024-11-16 09:51:39,360 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 09:51:39,852 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 09:51:39,855 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c [2024-11-16 09:51:39,895 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66125f11c/62507540343e421caca252e37842a8d7/FLAGc007f68ff [2024-11-16 09:51:39,913 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66125f11c/62507540343e421caca252e37842a8d7 [2024-11-16 09:51:39,916 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 09:51:39,918 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 09:51:39,921 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 09:51:39,921 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 09:51:39,927 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 09:51:39,928 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 09:51:39" (1/1) ... [2024-11-16 09:51:39,929 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68fde1f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:51:39, skipping insertion in model container [2024-11-16 09:51:39,929 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 09:51:39" (1/1) ... [2024-11-16 09:51:40,070 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 09:51:40,629 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.8_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c[26962,26975] [2024-11-16 09:51:40,726 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.8_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c[33898,33911] [2024-11-16 09:51:41,385 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 09:51:41,406 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 09:51:41,461 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.8_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c[26962,26975] [2024-11-16 09:51:41,474 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.8_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c[33898,33911] [2024-11-16 09:51:41,840 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 09:51:41,875 INFO L204 MainTranslator]: Completed translation [2024-11-16 09:51:41,876 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:51:41 WrapperNode [2024-11-16 09:51:41,876 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 09:51:41,877 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 09:51:41,877 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 09:51:41,878 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 09:51:41,885 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:51:41" (1/1) ... [2024-11-16 09:51:41,943 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:51:41" (1/1) ... [2024-11-16 09:51:42,263 INFO L138 Inliner]: procedures = 40, calls = 25, calls flagged for inlining = 20, calls inlined = 20, statements flattened = 5287 [2024-11-16 09:51:42,264 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 09:51:42,264 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 09:51:42,264 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 09:51:42,264 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 09:51:42,274 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:51:41" (1/1) ... [2024-11-16 09:51:42,274 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:51:41" (1/1) ... [2024-11-16 09:51:42,418 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:51:41" (1/1) ... [2024-11-16 09:51:42,557 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 09:51:42,557 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:51:41" (1/1) ... [2024-11-16 09:51:42,558 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:51:41" (1/1) ... [2024-11-16 09:51:42,730 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:51:41" (1/1) ... [2024-11-16 09:51:42,766 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:51:41" (1/1) ... [2024-11-16 09:51:42,796 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:51:41" (1/1) ... [2024-11-16 09:51:42,817 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:51:41" (1/1) ... [2024-11-16 09:51:42,968 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 09:51:42,972 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 09:51:42,972 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 09:51:42,972 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 09:51:42,973 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:51:41" (1/1) ... [2024-11-16 09:51:42,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 09:51:42,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 09:51:43,033 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 09:51:43,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 09:51:43,121 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 09:51:43,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 09:51:43,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 09:51:43,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 09:51:43,396 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 09:51:43,401 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 09:51:48,206 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L2374: havoc calculate_output_#t~ret49#1; [2024-11-16 09:51:48,207 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L3853: havoc calculate_output2_#t~ret50#1; [2024-11-16 09:51:48,207 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L5343: havoc calculate_output3_#t~ret51#1; [2024-11-16 09:51:48,368 INFO L? ?]: Removed 759 outVars from TransFormulas that were not future-live. [2024-11-16 09:51:48,369 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 09:51:48,402 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 09:51:48,403 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 09:51:48,403 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 09:51:48 BoogieIcfgContainer [2024-11-16 09:51:48,403 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 09:51:48,405 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 09:51:48,406 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 09:51:48,412 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 09:51:48,412 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 09:51:39" (1/3) ... [2024-11-16 09:51:48,414 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@614e62ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 09:51:48, skipping insertion in model container [2024-11-16 09:51:48,414 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:51:41" (2/3) ... [2024-11-16 09:51:48,414 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@614e62ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 09:51:48, skipping insertion in model container [2024-11-16 09:51:48,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 09:51:48" (3/3) ... [2024-11-16 09:51:48,417 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.8_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c [2024-11-16 09:51:48,438 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 09:51:48,439 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-16 09:51:48,541 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 09:51:48,550 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;@299718a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 09:51:48,551 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-16 09:51:48,563 INFO L276 IsEmpty]: Start isEmpty. Operand has 954 states, 951 states have (on average 1.896950578338591) internal successors, (1804), 953 states have internal predecessors, (1804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:51:48,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-16 09:51:48,574 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:51:48,575 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 09:51:48,576 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:51:48,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:51:48,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1121255932, now seen corresponding path program 1 times [2024-11-16 09:51:48,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:51:48,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30041779] [2024-11-16 09:51:48,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:51:48,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:51:48,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:51:48,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:51:48,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:51:48,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30041779] [2024-11-16 09:51:48,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30041779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:51:48,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:51:48,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 09:51:48,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408264857] [2024-11-16 09:51:48,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:51:48,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 09:51:48,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:51:49,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 09:51:49,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 09:51:49,039 INFO L87 Difference]: Start difference. First operand has 954 states, 951 states have (on average 1.896950578338591) internal successors, (1804), 953 states have internal predecessors, (1804), 0 states have call successors, (0), 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 16.0) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:51:49,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:51:49,120 INFO L93 Difference]: Finished difference Result 1837 states and 3474 transitions. [2024-11-16 09:51:49,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 09:51:49,123 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2024-11-16 09:51:49,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:51:49,141 INFO L225 Difference]: With dead ends: 1837 [2024-11-16 09:51:49,141 INFO L226 Difference]: Without dead ends: 886 [2024-11-16 09:51:49,149 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 09:51:49,153 INFO L432 NwaCegarLoop]: 1733 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, 1733 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 09:51:49,153 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1733 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:51:49,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2024-11-16 09:51:49,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 886. [2024-11-16 09:51:49,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 886 states, 884 states have (on average 1.8880090497737556) internal successors, (1669), 885 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:51:49,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1669 transitions. [2024-11-16 09:51:49,245 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1669 transitions. Word has length 32 [2024-11-16 09:51:49,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:51:49,245 INFO L471 AbstractCegarLoop]: Abstraction has 886 states and 1669 transitions. [2024-11-16 09:51:49,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:51:49,246 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1669 transitions. [2024-11-16 09:51:49,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-16 09:51:49,248 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:51:49,248 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] [2024-11-16 09:51:49,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 09:51:49,248 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:51:49,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:51:49,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1152275739, now seen corresponding path program 1 times [2024-11-16 09:51:49,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:51:49,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884178435] [2024-11-16 09:51:49,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:51:49,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:51:49,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:51:49,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:51:49,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:51:49,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884178435] [2024-11-16 09:51:49,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884178435] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:51:49,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:51:49,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 09:51:49,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269224318] [2024-11-16 09:51:49,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:51:49,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 09:51:49,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:51:49,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 09:51:49,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 09:51:49,571 INFO L87 Difference]: Start difference. First operand 886 states and 1669 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:51:49,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:51:49,738 INFO L93 Difference]: Finished difference Result 953 states and 1773 transitions. [2024-11-16 09:51:49,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 09:51:49,739 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2024-11-16 09:51:49,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:51:49,743 INFO L225 Difference]: With dead ends: 953 [2024-11-16 09:51:49,743 INFO L226 Difference]: Without dead ends: 886 [2024-11-16 09:51:49,744 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 09:51:49,746 INFO L432 NwaCegarLoop]: 1667 mSDtfsCounter, 0 mSDsluCounter, 4935 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6602 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 09:51:49,746 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6602 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 09:51:49,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2024-11-16 09:51:49,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 886. [2024-11-16 09:51:49,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 886 states, 884 states have (on average 1.8190045248868778) internal successors, (1608), 885 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:51:49,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1608 transitions. [2024-11-16 09:51:49,778 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1608 transitions. Word has length 32 [2024-11-16 09:51:49,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:51:49,778 INFO L471 AbstractCegarLoop]: Abstraction has 886 states and 1608 transitions. [2024-11-16 09:51:49,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:51:49,780 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1608 transitions. [2024-11-16 09:51:49,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-16 09:51:49,783 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:51:49,784 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] [2024-11-16 09:51:49,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 09:51:49,785 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:51:49,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:51:49,789 INFO L85 PathProgramCache]: Analyzing trace with hash -984732313, now seen corresponding path program 1 times [2024-11-16 09:51:49,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:51:49,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78599241] [2024-11-16 09:51:49,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:51:49,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:51:49,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:51:50,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:51:50,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:51:50,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78599241] [2024-11-16 09:51:50,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78599241] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:51:50,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:51:50,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 09:51:50,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235999834] [2024-11-16 09:51:50,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:51:50,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 09:51:50,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:51:50,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 09:51:50,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 09:51:50,074 INFO L87 Difference]: Start difference. First operand 886 states and 1608 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:51:56,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:51:56,238 INFO L93 Difference]: Finished difference Result 3145 states and 5921 transitions. [2024-11-16 09:51:56,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 09:51:56,240 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-11-16 09:51:56,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:51:56,250 INFO L225 Difference]: With dead ends: 3145 [2024-11-16 09:51:56,250 INFO L226 Difference]: Without dead ends: 2390 [2024-11-16 09:51:56,252 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 09:51:56,254 INFO L432 NwaCegarLoop]: 862 mSDtfsCounter, 2517 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 5518 mSolverCounterSat, 1100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2517 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 6618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1100 IncrementalHoareTripleChecker+Valid, 5518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2024-11-16 09:51:56,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2517 Valid, 885 Invalid, 6618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1100 Valid, 5518 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2024-11-16 09:51:56,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2390 states. [2024-11-16 09:51:56,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2390 to 2390. [2024-11-16 09:51:56,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2390 states, 2388 states have (on average 1.5644891122278057) internal successors, (3736), 2389 states have internal predecessors, (3736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:51:56,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2390 states to 2390 states and 3736 transitions. [2024-11-16 09:51:56,314 INFO L78 Accepts]: Start accepts. Automaton has 2390 states and 3736 transitions. Word has length 62 [2024-11-16 09:51:56,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:51:56,315 INFO L471 AbstractCegarLoop]: Abstraction has 2390 states and 3736 transitions. [2024-11-16 09:51:56,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:51:56,315 INFO L276 IsEmpty]: Start isEmpty. Operand 2390 states and 3736 transitions. [2024-11-16 09:51:56,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-16 09:51:56,322 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:51:56,322 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 09:51:56,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 09:51:56,323 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:51:56,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:51:56,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1240650465, now seen corresponding path program 1 times [2024-11-16 09:51:56,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:51:56,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799173104] [2024-11-16 09:51:56,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:51:56,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:51:56,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:51:56,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:51:56,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:51:56,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799173104] [2024-11-16 09:51:56,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799173104] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:51:56,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:51:56,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-16 09:51:56,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289425290] [2024-11-16 09:51:56,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:51:56,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 09:51:56,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:51:56,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 09:51:56,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-16 09:51:56,752 INFO L87 Difference]: Start difference. First operand 2390 states and 3736 transitions. Second operand has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:51:57,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:51:57,324 INFO L93 Difference]: Finished difference Result 3398 states and 5336 transitions. [2024-11-16 09:51:57,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-16 09:51:57,325 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2024-11-16 09:51:57,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:51:57,338 INFO L225 Difference]: With dead ends: 3398 [2024-11-16 09:51:57,338 INFO L226 Difference]: Without dead ends: 3335 [2024-11-16 09:51:57,341 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=344, Unknown=0, NotChecked=0, Total=506 [2024-11-16 09:51:57,342 INFO L432 NwaCegarLoop]: 1604 mSDtfsCounter, 13437 mSDsluCounter, 5120 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13437 SdHoareTripleChecker+Valid, 6724 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 09:51:57,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13437 Valid, 6724 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 09:51:57,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3335 states. [2024-11-16 09:51:57,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3335 to 2450. [2024-11-16 09:51:57,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2450 states, 2448 states have (on average 1.565359477124183) internal successors, (3832), 2449 states have internal predecessors, (3832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:51:57,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2450 states to 2450 states and 3832 transitions. [2024-11-16 09:51:57,409 INFO L78 Accepts]: Start accepts. Automaton has 2450 states and 3832 transitions. Word has length 92 [2024-11-16 09:51:57,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:51:57,410 INFO L471 AbstractCegarLoop]: Abstraction has 2450 states and 3832 transitions. [2024-11-16 09:51:57,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:51:57,411 INFO L276 IsEmpty]: Start isEmpty. Operand 2450 states and 3832 transitions. [2024-11-16 09:51:57,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-16 09:51:57,413 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:51:57,413 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 09:51:57,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 09:51:57,413 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:51:57,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:51:57,414 INFO L85 PathProgramCache]: Analyzing trace with hash -269795327, now seen corresponding path program 1 times [2024-11-16 09:51:57,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:51:57,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800071428] [2024-11-16 09:51:57,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:51:57,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:51:57,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:51:58,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:51:58,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:51:58,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800071428] [2024-11-16 09:51:58,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800071428] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:51:58,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:51:58,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-16 09:51:58,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863965356] [2024-11-16 09:51:58,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:51:58,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 09:51:58,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:51:58,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 09:51:58,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-16 09:51:58,103 INFO L87 Difference]: Start difference. First operand 2450 states and 3832 transitions. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:51:58,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:51:58,649 INFO L93 Difference]: Finished difference Result 2576 states and 4030 transitions. [2024-11-16 09:51:58,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 09:51:58,650 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-11-16 09:51:58,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:51:58,661 INFO L225 Difference]: With dead ends: 2576 [2024-11-16 09:51:58,661 INFO L226 Difference]: Without dead ends: 2453 [2024-11-16 09:51:58,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2024-11-16 09:51:58,664 INFO L432 NwaCegarLoop]: 1598 mSDtfsCounter, 6124 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6124 SdHoareTripleChecker+Valid, 2289 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 09:51:58,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6124 Valid, 2289 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 09:51:58,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2453 states. [2024-11-16 09:51:58,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2453 to 2450. [2024-11-16 09:51:58,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2450 states, 2448 states have (on average 1.5649509803921569) internal successors, (3831), 2449 states have internal predecessors, (3831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:51:58,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2450 states to 2450 states and 3831 transitions. [2024-11-16 09:51:58,724 INFO L78 Accepts]: Start accepts. Automaton has 2450 states and 3831 transitions. Word has length 94 [2024-11-16 09:51:58,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:51:58,725 INFO L471 AbstractCegarLoop]: Abstraction has 2450 states and 3831 transitions. [2024-11-16 09:51:58,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:51:58,725 INFO L276 IsEmpty]: Start isEmpty. Operand 2450 states and 3831 transitions. [2024-11-16 09:51:58,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-16 09:51:58,726 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:51:58,727 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 09:51:58,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 09:51:58,727 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:51:58,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:51:58,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1950098660, now seen corresponding path program 1 times [2024-11-16 09:51:58,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:51:58,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382928761] [2024-11-16 09:51:58,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:51:58,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:51:58,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:51:58,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:51:58,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:51:58,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382928761] [2024-11-16 09:51:58,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382928761] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:51:58,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:51:58,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 09:51:58,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482591480] [2024-11-16 09:51:58,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:51:58,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 09:51:58,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:51:58,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 09:51:58,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:51:58,909 INFO L87 Difference]: Start difference. First operand 2450 states and 3831 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:51:58,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:51:58,952 INFO L93 Difference]: Finished difference Result 2684 states and 4201 transitions. [2024-11-16 09:51:58,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 09:51:58,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2024-11-16 09:51:58,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:51:58,963 INFO L225 Difference]: With dead ends: 2684 [2024-11-16 09:51:58,963 INFO L226 Difference]: Without dead ends: 2561 [2024-11-16 09:51:58,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:51:58,967 INFO L432 NwaCegarLoop]: 1614 mSDtfsCounter, 1510 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1510 SdHoareTripleChecker+Valid, 1709 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 09:51:58,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1510 Valid, 1709 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:51:58,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2561 states. [2024-11-16 09:51:59,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2561 to 2558. [2024-11-16 09:51:59,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2558 states, 2556 states have (on average 1.5653364632237872) internal successors, (4001), 2557 states have internal predecessors, (4001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:51:59,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2558 states to 2558 states and 4001 transitions. [2024-11-16 09:51:59,033 INFO L78 Accepts]: Start accepts. Automaton has 2558 states and 4001 transitions. Word has length 95 [2024-11-16 09:51:59,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:51:59,034 INFO L471 AbstractCegarLoop]: Abstraction has 2558 states and 4001 transitions. [2024-11-16 09:51:59,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:51:59,035 INFO L276 IsEmpty]: Start isEmpty. Operand 2558 states and 4001 transitions. [2024-11-16 09:51:59,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-16 09:51:59,038 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:51:59,039 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 09:51:59,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 09:51:59,039 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:51:59,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:51:59,040 INFO L85 PathProgramCache]: Analyzing trace with hash 696752323, now seen corresponding path program 1 times [2024-11-16 09:51:59,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:51:59,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779708240] [2024-11-16 09:51:59,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:51:59,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:51:59,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:51:59,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:51:59,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:51:59,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779708240] [2024-11-16 09:51:59,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779708240] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:51:59,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:51:59,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 09:51:59,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343292418] [2024-11-16 09:51:59,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:51:59,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 09:51:59,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:51:59,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 09:51:59,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:51:59,168 INFO L87 Difference]: Start difference. First operand 2558 states and 4001 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:51:59,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:51:59,211 INFO L93 Difference]: Finished difference Result 2799 states and 4381 transitions. [2024-11-16 09:51:59,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 09:51:59,212 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2024-11-16 09:51:59,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:51:59,222 INFO L225 Difference]: With dead ends: 2799 [2024-11-16 09:51:59,222 INFO L226 Difference]: Without dead ends: 2676 [2024-11-16 09:51:59,223 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:51:59,226 INFO L432 NwaCegarLoop]: 1692 mSDtfsCounter, 1530 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1530 SdHoareTripleChecker+Valid, 1793 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 09:51:59,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1530 Valid, 1793 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:51:59,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2676 states. [2024-11-16 09:51:59,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2676 to 2673. [2024-11-16 09:51:59,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2673 states, 2671 states have (on average 1.5653313365780606) internal successors, (4181), 2672 states have internal predecessors, (4181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:51:59,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2673 states to 2673 states and 4181 transitions. [2024-11-16 09:51:59,280 INFO L78 Accepts]: Start accepts. Automaton has 2673 states and 4181 transitions. Word has length 96 [2024-11-16 09:51:59,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:51:59,280 INFO L471 AbstractCegarLoop]: Abstraction has 2673 states and 4181 transitions. [2024-11-16 09:51:59,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:51:59,281 INFO L276 IsEmpty]: Start isEmpty. Operand 2673 states and 4181 transitions. [2024-11-16 09:51:59,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-16 09:51:59,281 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:51:59,282 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 09:51:59,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 09:51:59,282 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:51:59,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:51:59,283 INFO L85 PathProgramCache]: Analyzing trace with hash 428870659, now seen corresponding path program 1 times [2024-11-16 09:51:59,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:51:59,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638518187] [2024-11-16 09:51:59,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:51:59,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:51:59,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:51:59,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:51:59,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:51:59,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638518187] [2024-11-16 09:51:59,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638518187] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:51:59,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:51:59,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 09:51:59,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173867516] [2024-11-16 09:51:59,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:51:59,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 09:51:59,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:51:59,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 09:51:59,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:51:59,376 INFO L87 Difference]: Start difference. First operand 2673 states and 4181 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:51:59,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:51:59,415 INFO L93 Difference]: Finished difference Result 3335 states and 5223 transitions. [2024-11-16 09:51:59,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 09:51:59,416 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2024-11-16 09:51:59,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:51:59,425 INFO L225 Difference]: With dead ends: 3335 [2024-11-16 09:51:59,426 INFO L226 Difference]: Without dead ends: 2992 [2024-11-16 09:51:59,427 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:51:59,428 INFO L432 NwaCegarLoop]: 1694 mSDtfsCounter, 1528 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1528 SdHoareTripleChecker+Valid, 1799 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 09:51:59,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1528 Valid, 1799 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:51:59,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2992 states. [2024-11-16 09:51:59,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2992 to 2989. [2024-11-16 09:51:59,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2989 states, 2987 states have (on average 1.564445932373619) internal successors, (4673), 2988 states have internal predecessors, (4673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:51:59,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2989 states to 2989 states and 4673 transitions. [2024-11-16 09:51:59,487 INFO L78 Accepts]: Start accepts. Automaton has 2989 states and 4673 transitions. Word has length 96 [2024-11-16 09:51:59,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:51:59,488 INFO L471 AbstractCegarLoop]: Abstraction has 2989 states and 4673 transitions. [2024-11-16 09:51:59,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:51:59,488 INFO L276 IsEmpty]: Start isEmpty. Operand 2989 states and 4673 transitions. [2024-11-16 09:51:59,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-16 09:51:59,489 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:51:59,489 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 09:51:59,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 09:51:59,489 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:51:59,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:51:59,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1536970563, now seen corresponding path program 1 times [2024-11-16 09:51:59,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:51:59,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915220990] [2024-11-16 09:51:59,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:51:59,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:51:59,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:51:59,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:51:59,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:51:59,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915220990] [2024-11-16 09:51:59,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915220990] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:51:59,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:51:59,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 09:51:59,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119991350] [2024-11-16 09:51:59,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:51:59,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 09:51:59,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:51:59,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 09:51:59,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:51:59,594 INFO L87 Difference]: Start difference. First operand 2989 states and 4673 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:51:59,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:51:59,677 INFO L93 Difference]: Finished difference Result 4259 states and 6657 transitions. [2024-11-16 09:51:59,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 09:51:59,677 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2024-11-16 09:51:59,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:51:59,689 INFO L225 Difference]: With dead ends: 4259 [2024-11-16 09:51:59,690 INFO L226 Difference]: Without dead ends: 3600 [2024-11-16 09:51:59,691 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:51:59,692 INFO L432 NwaCegarLoop]: 1692 mSDtfsCounter, 1526 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1526 SdHoareTripleChecker+Valid, 1801 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 09:51:59,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1526 Valid, 1801 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:51:59,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3600 states. [2024-11-16 09:51:59,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3600 to 3597. [2024-11-16 09:51:59,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3597 states, 3595 states have (on average 1.5602225312934632) internal successors, (5609), 3596 states have internal predecessors, (5609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:51:59,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3597 states to 3597 states and 5609 transitions. [2024-11-16 09:51:59,767 INFO L78 Accepts]: Start accepts. Automaton has 3597 states and 5609 transitions. Word has length 96 [2024-11-16 09:51:59,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:51:59,768 INFO L471 AbstractCegarLoop]: Abstraction has 3597 states and 5609 transitions. [2024-11-16 09:51:59,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:51:59,768 INFO L276 IsEmpty]: Start isEmpty. Operand 3597 states and 5609 transitions. [2024-11-16 09:51:59,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-16 09:51:59,770 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:51:59,770 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 09:51:59,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 09:51:59,771 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:51:59,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:51:59,771 INFO L85 PathProgramCache]: Analyzing trace with hash 764429763, now seen corresponding path program 1 times [2024-11-16 09:51:59,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:51:59,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035921985] [2024-11-16 09:51:59,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:51:59,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:51:59,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:51:59,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:51:59,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:51:59,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035921985] [2024-11-16 09:51:59,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035921985] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:51:59,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:51:59,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 09:51:59,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453115294] [2024-11-16 09:51:59,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:51:59,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 09:51:59,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:51:59,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 09:51:59,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:51:59,884 INFO L87 Difference]: Start difference. First operand 3597 states and 5609 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:51:59,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:51:59,946 INFO L93 Difference]: Finished difference Result 6035 states and 9381 transitions. [2024-11-16 09:51:59,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 09:51:59,947 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2024-11-16 09:51:59,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:51:59,973 INFO L225 Difference]: With dead ends: 6035 [2024-11-16 09:51:59,973 INFO L226 Difference]: Without dead ends: 4768 [2024-11-16 09:51:59,981 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:51:59,982 INFO L432 NwaCegarLoop]: 1680 mSDtfsCounter, 1522 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1522 SdHoareTripleChecker+Valid, 1797 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 09:51:59,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1522 Valid, 1797 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:51:59,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4768 states. [2024-11-16 09:52:00,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4768 to 4765. [2024-11-16 09:52:00,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4765 states, 4763 states have (on average 1.5504933865211001) internal successors, (7385), 4764 states have internal predecessors, (7385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:52:00,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4765 states to 4765 states and 7385 transitions. [2024-11-16 09:52:00,095 INFO L78 Accepts]: Start accepts. Automaton has 4765 states and 7385 transitions. Word has length 96 [2024-11-16 09:52:00,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:52:00,096 INFO L471 AbstractCegarLoop]: Abstraction has 4765 states and 7385 transitions. [2024-11-16 09:52:00,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:52:00,096 INFO L276 IsEmpty]: Start isEmpty. Operand 4765 states and 7385 transitions. [2024-11-16 09:52:00,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-16 09:52:00,098 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:52:00,098 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 09:52:00,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 09:52:00,098 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:52:00,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:52:00,099 INFO L85 PathProgramCache]: Analyzing trace with hash -236979965, now seen corresponding path program 1 times [2024-11-16 09:52:00,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:52:00,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631126199] [2024-11-16 09:52:00,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:52:00,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:52:00,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:52:00,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:52:00,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:52:00,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631126199] [2024-11-16 09:52:00,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631126199] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:52:00,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:52:00,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 09:52:00,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347440152] [2024-11-16 09:52:00,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:52:00,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 09:52:00,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:52:00,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 09:52:00,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:52:00,190 INFO L87 Difference]: Start difference. First operand 4765 states and 7385 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:52:00,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:52:00,293 INFO L93 Difference]: Finished difference Result 9443 states and 14541 transitions. [2024-11-16 09:52:00,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 09:52:00,293 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2024-11-16 09:52:00,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:52:00,316 INFO L225 Difference]: With dead ends: 9443 [2024-11-16 09:52:00,317 INFO L226 Difference]: Without dead ends: 7008 [2024-11-16 09:52:00,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:52:00,323 INFO L432 NwaCegarLoop]: 1678 mSDtfsCounter, 1520 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1520 SdHoareTripleChecker+Valid, 1799 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 09:52:00,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1520 Valid, 1799 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:52:00,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7008 states. [2024-11-16 09:52:00,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7008 to 7005. [2024-11-16 09:52:00,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7005 states, 7003 states have (on average 1.5343424246751391) internal successors, (10745), 7004 states have internal predecessors, (10745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:52:00,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7005 states to 7005 states and 10745 transitions. [2024-11-16 09:52:00,487 INFO L78 Accepts]: Start accepts. Automaton has 7005 states and 10745 transitions. Word has length 96 [2024-11-16 09:52:00,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:52:00,487 INFO L471 AbstractCegarLoop]: Abstraction has 7005 states and 10745 transitions. [2024-11-16 09:52:00,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:52:00,488 INFO L276 IsEmpty]: Start isEmpty. Operand 7005 states and 10745 transitions. [2024-11-16 09:52:00,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-16 09:52:00,489 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:52:00,490 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 09:52:00,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 09:52:00,490 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:52:00,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:52:00,491 INFO L85 PathProgramCache]: Analyzing trace with hash -251429821, now seen corresponding path program 1 times [2024-11-16 09:52:00,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:52:00,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496955952] [2024-11-16 09:52:00,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:52:00,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:52:00,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:52:00,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:52:00,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:52:00,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496955952] [2024-11-16 09:52:00,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496955952] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:52:00,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:52:00,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 09:52:00,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862425445] [2024-11-16 09:52:00,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:52:00,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 09:52:00,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:52:00,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 09:52:00,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:52:00,578 INFO L87 Difference]: Start difference. First operand 7005 states and 10745 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:52:00,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:52:00,732 INFO L93 Difference]: Finished difference Result 15971 states and 24285 transitions. [2024-11-16 09:52:00,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 09:52:00,733 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2024-11-16 09:52:00,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:52:00,758 INFO L225 Difference]: With dead ends: 15971 [2024-11-16 09:52:00,758 INFO L226 Difference]: Without dead ends: 11296 [2024-11-16 09:52:00,770 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:52:00,771 INFO L432 NwaCegarLoop]: 1676 mSDtfsCounter, 1518 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1518 SdHoareTripleChecker+Valid, 1801 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 09:52:00,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1518 Valid, 1801 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:52:00,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11296 states. [2024-11-16 09:52:01,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11296 to 11293. [2024-11-16 09:52:01,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11293 states, 11291 states have (on average 1.5127978035603578) internal successors, (17081), 11292 states have internal predecessors, (17081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:52:01,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11293 states to 11293 states and 17081 transitions. [2024-11-16 09:52:01,121 INFO L78 Accepts]: Start accepts. Automaton has 11293 states and 17081 transitions. Word has length 96 [2024-11-16 09:52:01,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:52:01,122 INFO L471 AbstractCegarLoop]: Abstraction has 11293 states and 17081 transitions. [2024-11-16 09:52:01,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:52:01,122 INFO L276 IsEmpty]: Start isEmpty. Operand 11293 states and 17081 transitions. [2024-11-16 09:52:01,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-16 09:52:01,123 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:52:01,123 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 09:52:01,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 09:52:01,124 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:52:01,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:52:01,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1840172931, now seen corresponding path program 1 times [2024-11-16 09:52:01,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:52:01,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870707797] [2024-11-16 09:52:01,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:52:01,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:52:01,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:52:01,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:52:01,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:52:01,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870707797] [2024-11-16 09:52:01,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870707797] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:52:01,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:52:01,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 09:52:01,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827461946] [2024-11-16 09:52:01,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:52:01,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 09:52:01,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:52:01,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 09:52:01,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:52:01,232 INFO L87 Difference]: Start difference. First operand 11293 states and 17081 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:52:01,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:52:01,525 INFO L93 Difference]: Finished difference Result 28451 states and 42621 transitions. [2024-11-16 09:52:01,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 09:52:01,526 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2024-11-16 09:52:01,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:52:01,566 INFO L225 Difference]: With dead ends: 28451 [2024-11-16 09:52:01,566 INFO L226 Difference]: Without dead ends: 19488 [2024-11-16 09:52:01,588 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:52:01,589 INFO L432 NwaCegarLoop]: 1674 mSDtfsCounter, 1516 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1516 SdHoareTripleChecker+Valid, 1803 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 09:52:01,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1516 Valid, 1803 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:52:01,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19488 states. [2024-11-16 09:52:02,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19488 to 19485. [2024-11-16 09:52:02,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19485 states, 19483 states have (on average 1.487707231945799) internal successors, (28985), 19484 states have internal predecessors, (28985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:52:02,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19485 states to 19485 states and 28985 transitions. [2024-11-16 09:52:02,271 INFO L78 Accepts]: Start accepts. Automaton has 19485 states and 28985 transitions. Word has length 96 [2024-11-16 09:52:02,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:52:02,272 INFO L471 AbstractCegarLoop]: Abstraction has 19485 states and 28985 transitions. [2024-11-16 09:52:02,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:52:02,272 INFO L276 IsEmpty]: Start isEmpty. Operand 19485 states and 28985 transitions. [2024-11-16 09:52:02,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-16 09:52:02,273 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:52:02,273 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 09:52:02,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-16 09:52:02,274 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:52:02,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:52:02,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1315895876, now seen corresponding path program 1 times [2024-11-16 09:52:02,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:52:02,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090540594] [2024-11-16 09:52:02,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:52:02,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:52:02,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:52:02,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:52:02,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:52:02,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090540594] [2024-11-16 09:52:02,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090540594] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:52:02,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:52:02,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 09:52:02,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913586552] [2024-11-16 09:52:02,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:52:02,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 09:52:02,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:52:02,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 09:52:02,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-16 09:52:02,585 INFO L87 Difference]: Start difference. First operand 19485 states and 28985 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:52:03,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:52:03,005 INFO L93 Difference]: Finished difference Result 20256 states and 30011 transitions. [2024-11-16 09:52:03,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 09:52:03,006 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2024-11-16 09:52:03,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:52:03,042 INFO L225 Difference]: With dead ends: 20256 [2024-11-16 09:52:03,042 INFO L226 Difference]: Without dead ends: 20253 [2024-11-16 09:52:03,047 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-16 09:52:03,048 INFO L432 NwaCegarLoop]: 1602 mSDtfsCounter, 0 mSDsluCounter, 9599 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11201 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-16 09:52:03,048 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11201 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:52:03,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20253 states. [2024-11-16 09:52:03,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20253 to 20253. [2024-11-16 09:52:03,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20253 states, 20251 states have (on average 1.4660510592069527) internal successors, (29689), 20252 states have internal predecessors, (29689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:52:03,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20253 states to 20253 states and 29689 transitions. [2024-11-16 09:52:03,696 INFO L78 Accepts]: Start accepts. Automaton has 20253 states and 29689 transitions. Word has length 96 [2024-11-16 09:52:03,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:52:03,697 INFO L471 AbstractCegarLoop]: Abstraction has 20253 states and 29689 transitions. [2024-11-16 09:52:03,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:52:03,697 INFO L276 IsEmpty]: Start isEmpty. Operand 20253 states and 29689 transitions. [2024-11-16 09:52:03,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-16 09:52:03,698 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:52:03,699 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 09:52:03,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-16 09:52:03,699 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:52:03,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:52:03,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1046504067, now seen corresponding path program 1 times [2024-11-16 09:52:03,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:52:03,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674215570] [2024-11-16 09:52:03,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:52:03,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:52:03,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:52:03,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:52:03,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:52:03,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674215570] [2024-11-16 09:52:03,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674215570] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:52:03,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:52:03,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 09:52:03,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658477844] [2024-11-16 09:52:03,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:52:03,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 09:52:03,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:52:03,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 09:52:03,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:52:03,800 INFO L87 Difference]: Start difference. First operand 20253 states and 29689 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:52:04,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:52:04,484 INFO L93 Difference]: Finished difference Result 54563 states and 79101 transitions. [2024-11-16 09:52:04,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 09:52:04,485 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2024-11-16 09:52:04,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:52:04,557 INFO L225 Difference]: With dead ends: 54563 [2024-11-16 09:52:04,557 INFO L226 Difference]: Without dead ends: 36640 [2024-11-16 09:52:04,588 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:52:04,588 INFO L432 NwaCegarLoop]: 1690 mSDtfsCounter, 1524 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1524 SdHoareTripleChecker+Valid, 1803 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 09:52:04,589 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1524 Valid, 1803 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:52:04,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36640 states. [2024-11-16 09:52:05,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36640 to 36637. [2024-11-16 09:52:05,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36637 states, 36635 states have (on average 1.4375597106592057) internal successors, (52665), 36636 states have internal predecessors, (52665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:52:05,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36637 states to 36637 states and 52665 transitions. [2024-11-16 09:52:05,700 INFO L78 Accepts]: Start accepts. Automaton has 36637 states and 52665 transitions. Word has length 96 [2024-11-16 09:52:05,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:52:05,701 INFO L471 AbstractCegarLoop]: Abstraction has 36637 states and 52665 transitions. [2024-11-16 09:52:05,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:52:05,701 INFO L276 IsEmpty]: Start isEmpty. Operand 36637 states and 52665 transitions. [2024-11-16 09:52:05,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-16 09:52:05,711 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:52:05,711 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 09:52:05,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-16 09:52:05,711 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:52:05,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:52:05,712 INFO L85 PathProgramCache]: Analyzing trace with hash -295534365, now seen corresponding path program 1 times [2024-11-16 09:52:05,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:52:05,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079199196] [2024-11-16 09:52:05,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:52:05,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:52:05,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:52:06,017 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-16 09:52:06,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:52:06,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079199196] [2024-11-16 09:52:06,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079199196] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:52:06,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:52:06,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-16 09:52:06,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083257961] [2024-11-16 09:52:06,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:52:06,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 09:52:06,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:52:06,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 09:52:06,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-16 09:52:06,019 INFO L87 Difference]: Start difference. First operand 36637 states and 52665 transitions. Second operand has 10 states, 10 states have (on average 12.1) internal successors, (121), 10 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:52:10,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:52:10,694 INFO L93 Difference]: Finished difference Result 307896 states and 440011 transitions. [2024-11-16 09:52:10,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 09:52:10,695 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.1) internal successors, (121), 10 states have internal predecessors, (121), 0 states have call successors, (0), 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 123 [2024-11-16 09:52:10,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:52:11,392 INFO L225 Difference]: With dead ends: 307896 [2024-11-16 09:52:11,393 INFO L226 Difference]: Without dead ends: 283829 [2024-11-16 09:52:11,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-11-16 09:52:11,463 INFO L432 NwaCegarLoop]: 1712 mSDtfsCounter, 11762 mSDsluCounter, 3733 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11762 SdHoareTripleChecker+Valid, 5445 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 09:52:11,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11762 Valid, 5445 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 09:52:11,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283829 states. [2024-11-16 09:52:15,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283829 to 65949. [2024-11-16 09:52:15,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65949 states, 65947 states have (on average 1.4274644790513593) internal successors, (94137), 65948 states have internal predecessors, (94137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:52:15,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65949 states to 65949 states and 94137 transitions. [2024-11-16 09:52:15,313 INFO L78 Accepts]: Start accepts. Automaton has 65949 states and 94137 transitions. Word has length 123 [2024-11-16 09:52:15,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:52:15,313 INFO L471 AbstractCegarLoop]: Abstraction has 65949 states and 94137 transitions. [2024-11-16 09:52:15,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.1) internal successors, (121), 10 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:52:15,314 INFO L276 IsEmpty]: Start isEmpty. Operand 65949 states and 94137 transitions. [2024-11-16 09:52:15,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-16 09:52:15,331 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:52:15,332 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 09:52:15,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-16 09:52:15,332 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:52:15,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:52:15,333 INFO L85 PathProgramCache]: Analyzing trace with hash -563416029, now seen corresponding path program 1 times [2024-11-16 09:52:15,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:52:15,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153773568] [2024-11-16 09:52:15,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:52:15,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:52:15,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:52:15,687 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-16 09:52:15,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:52:15,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153773568] [2024-11-16 09:52:15,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153773568] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:52:15,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:52:15,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-16 09:52:15,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307819868] [2024-11-16 09:52:15,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:52:15,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 09:52:15,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:52:15,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 09:52:15,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-16 09:52:15,691 INFO L87 Difference]: Start difference. First operand 65949 states and 94137 transitions. Second operand has 10 states, 10 states have (on average 11.9) internal successors, (119), 10 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:52:21,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:52:21,439 INFO L93 Difference]: Finished difference Result 342200 states and 488779 transitions. [2024-11-16 09:52:21,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 09:52:21,440 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.9) internal successors, (119), 10 states have internal predecessors, (119), 0 states have call successors, (0), 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 123 [2024-11-16 09:52:21,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:52:21,963 INFO L225 Difference]: With dead ends: 342200 [2024-11-16 09:52:21,963 INFO L226 Difference]: Without dead ends: 307893 [2024-11-16 09:52:22,054 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-11-16 09:52:22,055 INFO L432 NwaCegarLoop]: 1713 mSDtfsCounter, 11766 mSDsluCounter, 3628 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11766 SdHoareTripleChecker+Valid, 5341 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 09:52:22,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11766 Valid, 5341 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 09:52:22,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307893 states. [2024-11-16 09:52:26,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307893 to 112285. [2024-11-16 09:52:26,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112285 states, 112283 states have (on average 1.4220585484890855) internal successors, (159673), 112284 states have internal predecessors, (159673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:52:27,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112285 states to 112285 states and 159673 transitions. [2024-11-16 09:52:27,181 INFO L78 Accepts]: Start accepts. Automaton has 112285 states and 159673 transitions. Word has length 123 [2024-11-16 09:52:27,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:52:27,182 INFO L471 AbstractCegarLoop]: Abstraction has 112285 states and 159673 transitions. [2024-11-16 09:52:27,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.9) internal successors, (119), 10 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:52:27,182 INFO L276 IsEmpty]: Start isEmpty. Operand 112285 states and 159673 transitions. [2024-11-16 09:52:27,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-16 09:52:27,196 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:52:27,197 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 09:52:27,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-16 09:52:27,197 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:52:27,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:52:27,198 INFO L85 PathProgramCache]: Analyzing trace with hash 544683875, now seen corresponding path program 1 times [2024-11-16 09:52:27,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:52:27,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001919328] [2024-11-16 09:52:27,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:52:27,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:52:27,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:52:27,499 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-16 09:52:27,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:52:27,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001919328] [2024-11-16 09:52:27,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001919328] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:52:27,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:52:27,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-16 09:52:27,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863096123] [2024-11-16 09:52:27,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:52:27,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 09:52:27,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:52:27,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 09:52:27,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-16 09:52:27,501 INFO L87 Difference]: Start difference. First operand 112285 states and 159673 transitions. Second operand has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:52:34,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:52:34,820 INFO L93 Difference]: Finished difference Result 376504 states and 537419 transitions. [2024-11-16 09:52:34,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 09:52:34,821 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 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 123 [2024-11-16 09:52:34,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:52:35,439 INFO L225 Difference]: With dead ends: 376504 [2024-11-16 09:52:35,439 INFO L226 Difference]: Without dead ends: 342197 [2024-11-16 09:52:35,547 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-11-16 09:52:35,548 INFO L432 NwaCegarLoop]: 1710 mSDtfsCounter, 11808 mSDsluCounter, 3574 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11808 SdHoareTripleChecker+Valid, 5284 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 09:52:35,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11808 Valid, 5284 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 09:52:35,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342197 states.