./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem15_label20.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem15_label20.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 536acb696ed94b995033527813aeda4f29ece00fad0635ae3527f772205996b1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 19:41:28,881 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 19:41:28,967 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 19:41:28,972 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 19:41:28,973 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 19:41:29,001 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 19:41:29,002 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 19:41:29,002 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 19:41:29,003 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 19:41:29,003 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 19:41:29,004 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 19:41:29,004 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 19:41:29,004 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 19:41:29,005 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 19:41:29,005 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 19:41:29,005 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 19:41:29,006 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 19:41:29,006 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 19:41:29,006 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 19:41:29,006 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 19:41:29,007 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 19:41:29,007 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 19:41:29,008 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 19:41:29,008 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 19:41:29,008 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 19:41:29,009 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 19:41:29,012 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 19:41:29,012 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 19:41:29,013 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 19:41:29,013 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 19:41:29,013 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 19:41:29,013 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 19:41:29,013 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:41:29,014 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 19:41:29,014 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 19:41:29,014 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 19:41:29,014 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 19:41:29,014 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 19:41:29,015 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 19:41:29,015 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 19:41:29,015 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 19:41:29,016 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 19:41:29,016 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 -> 536acb696ed94b995033527813aeda4f29ece00fad0635ae3527f772205996b1 [2024-11-09 19:41:29,249 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 19:41:29,273 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 19:41:29,277 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 19:41:29,278 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 19:41:29,278 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 19:41:29,279 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem15_label20.c [2024-11-09 19:41:30,663 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 19:41:31,006 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 19:41:31,008 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label20.c [2024-11-09 19:41:31,029 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54f320136/e7e196723ae54fb48715c5a462278076/FLAG0dd4d75db [2024-11-09 19:41:31,045 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54f320136/e7e196723ae54fb48715c5a462278076 [2024-11-09 19:41:31,052 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 19:41:31,055 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 19:41:31,059 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 19:41:31,059 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 19:41:31,064 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 19:41:31,065 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:41:31" (1/1) ... [2024-11-09 19:41:31,066 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14b6fa87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:41:31, skipping insertion in model container [2024-11-09 19:41:31,066 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:41:31" (1/1) ... [2024-11-09 19:41:31,133 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 19:41:31,370 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/eca-rers2012/Problem15_label20.c[5247,5260] [2024-11-09 19:41:31,819 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:41:31,830 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 19:41:31,850 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/eca-rers2012/Problem15_label20.c[5247,5260] [2024-11-09 19:41:32,025 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:41:32,047 INFO L204 MainTranslator]: Completed translation [2024-11-09 19:41:32,048 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:41:32 WrapperNode [2024-11-09 19:41:32,048 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 19:41:32,049 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 19:41:32,049 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 19:41:32,049 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 19:41:32,055 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:41:32" (1/1) ... [2024-11-09 19:41:32,098 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:41:32" (1/1) ... [2024-11-09 19:41:32,265 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1759 [2024-11-09 19:41:32,265 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 19:41:32,266 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 19:41:32,266 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 19:41:32,266 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 19:41:32,276 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:41:32" (1/1) ... [2024-11-09 19:41:32,277 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:41:32" (1/1) ... [2024-11-09 19:41:32,294 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:41:32" (1/1) ... [2024-11-09 19:41:32,353 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-09 19:41:32,354 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:41:32" (1/1) ... [2024-11-09 19:41:32,354 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:41:32" (1/1) ... [2024-11-09 19:41:32,478 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:41:32" (1/1) ... [2024-11-09 19:41:32,496 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:41:32" (1/1) ... [2024-11-09 19:41:32,520 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:41:32" (1/1) ... [2024-11-09 19:41:32,529 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:41:32" (1/1) ... [2024-11-09 19:41:32,572 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 19:41:32,574 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 19:41:32,574 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 19:41:32,575 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 19:41:32,575 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:41:32" (1/1) ... [2024-11-09 19:41:32,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:41:32,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:41:32,609 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-09 19:41:32,612 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-09 19:41:32,660 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 19:41:32,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 19:41:32,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 19:41:32,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 19:41:32,735 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 19:41:32,738 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 19:41:35,440 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1665: havoc calculate_output_#t~ret7#1; [2024-11-09 19:41:35,627 INFO L? ?]: Removed 697 outVars from TransFormulas that were not future-live. [2024-11-09 19:41:35,627 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 19:41:35,662 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 19:41:35,663 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 19:41:35,663 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:41:35 BoogieIcfgContainer [2024-11-09 19:41:35,663 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 19:41:35,665 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 19:41:35,665 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 19:41:35,669 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 19:41:35,671 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:41:31" (1/3) ... [2024-11-09 19:41:35,672 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@346b4703 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:41:35, skipping insertion in model container [2024-11-09 19:41:35,672 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:41:32" (2/3) ... [2024-11-09 19:41:35,673 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@346b4703 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:41:35, skipping insertion in model container [2024-11-09 19:41:35,674 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:41:35" (3/3) ... [2024-11-09 19:41:35,675 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label20.c [2024-11-09 19:41:35,692 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 19:41:35,693 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 19:41:35,774 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 19:41:35,783 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;@1c122c73, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 19:41:35,784 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 19:41:35,792 INFO L276 IsEmpty]: Start isEmpty. Operand has 427 states, 425 states have (on average 2.3176470588235296) internal successors, (985), 426 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:41:35,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-09 19:41:35,801 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:41:35,802 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] [2024-11-09 19:41:35,802 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:41:35,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:41:35,808 INFO L85 PathProgramCache]: Analyzing trace with hash 821960962, now seen corresponding path program 1 times [2024-11-09 19:41:35,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:41:35,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668557609] [2024-11-09 19:41:35,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:41:35,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:41:35,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:41:36,159 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-09 19:41:36,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:41:36,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668557609] [2024-11-09 19:41:36,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668557609] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:41:36,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:41:36,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:41:36,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200514527] [2024-11-09 19:41:36,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:41:36,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:41:36,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:41:36,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:41:36,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:41:36,201 INFO L87 Difference]: Start difference. First operand has 427 states, 425 states have (on average 2.3176470588235296) internal successors, (985), 426 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:41:38,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:41:38,541 INFO L93 Difference]: Finished difference Result 1160 states and 2808 transitions. [2024-11-09 19:41:38,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:41:38,544 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2024-11-09 19:41:38,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:41:38,568 INFO L225 Difference]: With dead ends: 1160 [2024-11-09 19:41:38,569 INFO L226 Difference]: Without dead ends: 668 [2024-11-09 19:41:38,573 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:41:38,576 INFO L432 NwaCegarLoop]: 337 mSDtfsCounter, 511 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 1440 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 1694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 1440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-09 19:41:38,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 388 Invalid, 1694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 1440 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-09 19:41:38,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2024-11-09 19:41:38,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 666. [2024-11-09 19:41:38,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 665 states have (on average 2.177443609022556) internal successors, (1448), 665 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:41:38,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 1448 transitions. [2024-11-09 19:41:38,658 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 1448 transitions. Word has length 44 [2024-11-09 19:41:38,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:41:38,659 INFO L471 AbstractCegarLoop]: Abstraction has 666 states and 1448 transitions. [2024-11-09 19:41:38,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:41:38,659 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 1448 transitions. [2024-11-09 19:41:38,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-09 19:41:38,662 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:41:38,662 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-09 19:41:38,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 19:41:38,663 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:41:38,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:41:38,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1593798684, now seen corresponding path program 1 times [2024-11-09 19:41:38,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:41:38,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475822991] [2024-11-09 19:41:38,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:41:38,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:41:38,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:41:39,088 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:41:39,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:41:39,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475822991] [2024-11-09 19:41:39,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475822991] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:41:39,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:41:39,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:41:39,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726116017] [2024-11-09 19:41:39,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:41:39,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:41:39,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:41:39,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:41:39,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:41:39,094 INFO L87 Difference]: Start difference. First operand 666 states and 1448 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:41:40,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:41:40,913 INFO L93 Difference]: Finished difference Result 1631 states and 3482 transitions. [2024-11-09 19:41:40,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:41:40,914 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 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 110 [2024-11-09 19:41:40,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:41:40,921 INFO L225 Difference]: With dead ends: 1631 [2024-11-09 19:41:40,922 INFO L226 Difference]: Without dead ends: 967 [2024-11-09 19:41:40,923 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:41:40,926 INFO L432 NwaCegarLoop]: 301 mSDtfsCounter, 469 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1374 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 1398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-09 19:41:40,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 341 Invalid, 1398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1374 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-09 19:41:40,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2024-11-09 19:41:40,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 967. [2024-11-09 19:41:40,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 967 states, 966 states have (on average 2.0817805383022776) internal successors, (2011), 966 states have internal predecessors, (2011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:41:40,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 2011 transitions. [2024-11-09 19:41:40,953 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 2011 transitions. Word has length 110 [2024-11-09 19:41:40,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:41:40,954 INFO L471 AbstractCegarLoop]: Abstraction has 967 states and 2011 transitions. [2024-11-09 19:41:40,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:41:40,955 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 2011 transitions. [2024-11-09 19:41:40,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-09 19:41:40,958 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:41:40,958 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-09 19:41:40,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 19:41:40,958 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:41:40,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:41:40,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1265954929, now seen corresponding path program 1 times [2024-11-09 19:41:40,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:41:40,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037863055] [2024-11-09 19:41:40,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:41:40,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:41:41,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:41:41,153 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:41:41,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:41:41,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037863055] [2024-11-09 19:41:41,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037863055] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:41:41,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:41:41,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:41:41,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629878014] [2024-11-09 19:41:41,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:41:41,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:41:41,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:41:41,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:41:41,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:41:41,158 INFO L87 Difference]: Start difference. First operand 967 states and 2011 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:41:43,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:41:43,114 INFO L93 Difference]: Finished difference Result 2238 states and 4819 transitions. [2024-11-09 19:41:43,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:41:43,115 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2024-11-09 19:41:43,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:41:43,123 INFO L225 Difference]: With dead ends: 2238 [2024-11-09 19:41:43,123 INFO L226 Difference]: Without dead ends: 1573 [2024-11-09 19:41:43,125 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:41:43,128 INFO L432 NwaCegarLoop]: 280 mSDtfsCounter, 491 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1303 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 1588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 1303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-09 19:41:43,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 319 Invalid, 1588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 1303 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-09 19:41:43,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1573 states. [2024-11-09 19:41:43,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1573 to 1271. [2024-11-09 19:41:43,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1271 states, 1270 states have (on average 2.0346456692913386) internal successors, (2584), 1270 states have internal predecessors, (2584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:41:43,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 1271 states and 2584 transitions. [2024-11-09 19:41:43,159 INFO L78 Accepts]: Start accepts. Automaton has 1271 states and 2584 transitions. Word has length 115 [2024-11-09 19:41:43,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:41:43,160 INFO L471 AbstractCegarLoop]: Abstraction has 1271 states and 2584 transitions. [2024-11-09 19:41:43,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:41:43,162 INFO L276 IsEmpty]: Start isEmpty. Operand 1271 states and 2584 transitions. [2024-11-09 19:41:43,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-09 19:41:43,165 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:41:43,165 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-09 19:41:43,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 19:41:43,165 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:41:43,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:41:43,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1085564582, now seen corresponding path program 1 times [2024-11-09 19:41:43,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:41:43,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610195766] [2024-11-09 19:41:43,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:41:43,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:41:43,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:41:43,316 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:41:43,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:41:43,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610195766] [2024-11-09 19:41:43,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610195766] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:41:43,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:41:43,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:41:43,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536949315] [2024-11-09 19:41:43,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:41:43,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:41:43,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:41:43,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:41:43,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:41:43,320 INFO L87 Difference]: Start difference. First operand 1271 states and 2584 transitions. Second operand has 4 states, 4 states have (on average 34.0) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:41:46,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:41:46,340 INFO L93 Difference]: Finished difference Result 4688 states and 9672 transitions. [2024-11-09 19:41:46,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:41:46,340 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 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 136 [2024-11-09 19:41:46,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:41:46,353 INFO L225 Difference]: With dead ends: 4688 [2024-11-09 19:41:46,353 INFO L226 Difference]: Without dead ends: 3419 [2024-11-09 19:41:46,355 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:41:46,356 INFO L432 NwaCegarLoop]: 292 mSDtfsCounter, 989 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 2883 mSolverCounterSat, 283 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 989 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 3166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 283 IncrementalHoareTripleChecker+Valid, 2883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-09 19:41:46,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [989 Valid, 352 Invalid, 3166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [283 Valid, 2883 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-09 19:41:46,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3419 states. [2024-11-09 19:41:46,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3419 to 3393. [2024-11-09 19:41:46,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3393 states, 3392 states have (on average 1.9887971698113207) internal successors, (6746), 3392 states have internal predecessors, (6746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:41:46,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3393 states to 3393 states and 6746 transitions. [2024-11-09 19:41:46,417 INFO L78 Accepts]: Start accepts. Automaton has 3393 states and 6746 transitions. Word has length 136 [2024-11-09 19:41:46,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:41:46,417 INFO L471 AbstractCegarLoop]: Abstraction has 3393 states and 6746 transitions. [2024-11-09 19:41:46,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:41:46,418 INFO L276 IsEmpty]: Start isEmpty. Operand 3393 states and 6746 transitions. [2024-11-09 19:41:46,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-09 19:41:46,420 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:41:46,421 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-09 19:41:46,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 19:41:46,421 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:41:46,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:41:46,422 INFO L85 PathProgramCache]: Analyzing trace with hash -195834245, now seen corresponding path program 1 times [2024-11-09 19:41:46,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:41:46,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707008710] [2024-11-09 19:41:46,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:41:46,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:41:46,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:41:46,632 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-09 19:41:46,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:41:46,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707008710] [2024-11-09 19:41:46,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707008710] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:41:46,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:41:46,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:41:46,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133133367] [2024-11-09 19:41:46,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:41:46,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:41:46,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:41:46,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:41:46,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:41:46,637 INFO L87 Difference]: Start difference. First operand 3393 states and 6746 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 2 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:41:48,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:41:48,160 INFO L93 Difference]: Finished difference Result 8594 states and 17287 transitions. [2024-11-09 19:41:48,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:41:48,161 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 2 states have internal predecessors, (138), 0 states have call successors, (0), 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 203 [2024-11-09 19:41:48,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:41:48,182 INFO L225 Difference]: With dead ends: 8594 [2024-11-09 19:41:48,182 INFO L226 Difference]: Without dead ends: 5503 [2024-11-09 19:41:48,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:41:48,188 INFO L432 NwaCegarLoop]: 272 mSDtfsCounter, 490 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 1255 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 1553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 1255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-09 19:41:48,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 341 Invalid, 1553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 1255 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-09 19:41:48,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5503 states. [2024-11-09 19:41:48,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5503 to 5497. [2024-11-09 19:41:48,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5497 states, 5496 states have (on average 1.9286754002911208) internal successors, (10600), 5496 states have internal predecessors, (10600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:41:48,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5497 states to 5497 states and 10600 transitions. [2024-11-09 19:41:48,291 INFO L78 Accepts]: Start accepts. Automaton has 5497 states and 10600 transitions. Word has length 203 [2024-11-09 19:41:48,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:41:48,293 INFO L471 AbstractCegarLoop]: Abstraction has 5497 states and 10600 transitions. [2024-11-09 19:41:48,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 2 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:41:48,293 INFO L276 IsEmpty]: Start isEmpty. Operand 5497 states and 10600 transitions. [2024-11-09 19:41:48,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-09 19:41:48,298 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:41:48,298 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 19:41:48,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 19:41:48,298 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:41:48,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:41:48,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1425233881, now seen corresponding path program 1 times [2024-11-09 19:41:48,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:41:48,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768191498] [2024-11-09 19:41:48,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:41:48,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:41:48,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:41:48,831 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:41:48,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:41:48,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768191498] [2024-11-09 19:41:48,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768191498] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:41:48,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:41:48,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:41:48,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713070393] [2024-11-09 19:41:48,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:41:48,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:41:48,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:41:48,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:41:48,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:41:48,833 INFO L87 Difference]: Start difference. First operand 5497 states and 10600 transitions. Second operand has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 2 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:41:50,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:41:50,393 INFO L93 Difference]: Finished difference Result 10692 states and 20654 transitions. [2024-11-09 19:41:50,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:41:50,394 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 2 states have internal predecessors, (203), 0 states have call successors, (0), 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 203 [2024-11-09 19:41:50,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:41:50,417 INFO L225 Difference]: With dead ends: 10692 [2024-11-09 19:41:50,418 INFO L226 Difference]: Without dead ends: 5497 [2024-11-09 19:41:50,424 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:41:50,426 INFO L432 NwaCegarLoop]: 326 mSDtfsCounter, 375 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1352 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 1357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-09 19:41:50,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 363 Invalid, 1357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1352 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-09 19:41:50,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5497 states. [2024-11-09 19:41:50,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5497 to 5497. [2024-11-09 19:41:50,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5497 states, 5496 states have (on average 1.9275836972343523) internal successors, (10594), 5496 states have internal predecessors, (10594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:41:50,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5497 states to 5497 states and 10594 transitions. [2024-11-09 19:41:50,528 INFO L78 Accepts]: Start accepts. Automaton has 5497 states and 10594 transitions. Word has length 203 [2024-11-09 19:41:50,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:41:50,529 INFO L471 AbstractCegarLoop]: Abstraction has 5497 states and 10594 transitions. [2024-11-09 19:41:50,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 2 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:41:50,529 INFO L276 IsEmpty]: Start isEmpty. Operand 5497 states and 10594 transitions. [2024-11-09 19:41:50,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-09 19:41:50,531 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:41:50,532 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 19:41:50,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 19:41:50,532 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:41:50,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:41:50,533 INFO L85 PathProgramCache]: Analyzing trace with hash -556501777, now seen corresponding path program 1 times [2024-11-09 19:41:50,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:41:50,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142100342] [2024-11-09 19:41:50,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:41:50,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:41:50,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:41:50,792 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:41:50,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:41:50,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142100342] [2024-11-09 19:41:50,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142100342] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:41:50,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:41:50,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:41:50,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178467027] [2024-11-09 19:41:50,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:41:50,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:41:50,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:41:50,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:41:50,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:41:50,795 INFO L87 Difference]: Start difference. First operand 5497 states and 10594 transitions. Second operand has 4 states, 4 states have (on average 55.25) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:41:53,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:41:53,461 INFO L93 Difference]: Finished difference Result 12227 states and 23642 transitions. [2024-11-09 19:41:53,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:41:53,462 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 55.25) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 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 221 [2024-11-09 19:41:53,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:41:53,492 INFO L225 Difference]: With dead ends: 12227 [2024-11-09 19:41:53,492 INFO L226 Difference]: Without dead ends: 7032 [2024-11-09 19:41:53,499 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:41:53,500 INFO L432 NwaCegarLoop]: 303 mSDtfsCounter, 907 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 2893 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 907 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 3100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 2893 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:41:53,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [907 Valid, 361 Invalid, 3100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 2893 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-09 19:41:53,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7032 states. [2024-11-09 19:41:53,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7032 to 5806. [2024-11-09 19:41:53,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5806 states, 5805 states have (on average 1.9386735572782083) internal successors, (11254), 5805 states have internal predecessors, (11254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:41:53,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5806 states to 5806 states and 11254 transitions. [2024-11-09 19:41:53,671 INFO L78 Accepts]: Start accepts. Automaton has 5806 states and 11254 transitions. Word has length 221 [2024-11-09 19:41:53,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:41:53,672 INFO L471 AbstractCegarLoop]: Abstraction has 5806 states and 11254 transitions. [2024-11-09 19:41:53,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.25) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:41:53,672 INFO L276 IsEmpty]: Start isEmpty. Operand 5806 states and 11254 transitions. [2024-11-09 19:41:53,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2024-11-09 19:41:53,676 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:41:53,676 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 19:41:53,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 19:41:53,677 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:41:53,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:41:53,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1659895155, now seen corresponding path program 1 times [2024-11-09 19:41:53,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:41:53,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571530904] [2024-11-09 19:41:53,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:41:53,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:41:53,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:41:54,049 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:41:54,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:41:54,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571530904] [2024-11-09 19:41:54,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571530904] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:41:54,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:41:54,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:41:54,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260508846] [2024-11-09 19:41:54,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:41:54,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:41:54,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:41:54,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:41:54,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:41:54,053 INFO L87 Difference]: Start difference. First operand 5806 states and 11254 transitions. Second operand has 4 states, 4 states have (on average 69.5) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:41:57,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:41:57,023 INFO L93 Difference]: Finished difference Result 13140 states and 25521 transitions. [2024-11-09 19:41:57,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:41:57,024 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 69.5) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 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 278 [2024-11-09 19:41:57,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:41:57,041 INFO L225 Difference]: With dead ends: 13140 [2024-11-09 19:41:57,041 INFO L226 Difference]: Without dead ends: 7636 [2024-11-09 19:41:57,048 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:41:57,049 INFO L432 NwaCegarLoop]: 312 mSDtfsCounter, 857 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 2822 mSolverCounterSat, 235 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 857 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 3057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 235 IncrementalHoareTripleChecker+Valid, 2822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-09 19:41:57,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [857 Valid, 367 Invalid, 3057 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [235 Valid, 2822 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-09 19:41:57,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7636 states. [2024-11-09 19:41:57,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7636 to 6107. [2024-11-09 19:41:57,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6107 states, 6106 states have (on average 1.9343268915820504) internal successors, (11811), 6106 states have internal predecessors, (11811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:41:57,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6107 states to 6107 states and 11811 transitions. [2024-11-09 19:41:57,169 INFO L78 Accepts]: Start accepts. Automaton has 6107 states and 11811 transitions. Word has length 278 [2024-11-09 19:41:57,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:41:57,170 INFO L471 AbstractCegarLoop]: Abstraction has 6107 states and 11811 transitions. [2024-11-09 19:41:57,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.5) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:41:57,171 INFO L276 IsEmpty]: Start isEmpty. Operand 6107 states and 11811 transitions. [2024-11-09 19:41:57,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2024-11-09 19:41:57,175 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:41:57,175 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 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-09 19:41:57,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 19:41:57,176 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:41:57,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:41:57,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1901155818, now seen corresponding path program 1 times [2024-11-09 19:41:57,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:41:57,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555042266] [2024-11-09 19:41:57,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:41:57,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:41:57,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:41:57,442 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-09 19:41:57,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:41:57,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555042266] [2024-11-09 19:41:57,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555042266] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:41:57,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:41:57,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:41:57,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436900057] [2024-11-09 19:41:57,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:41:57,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:41:57,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:41:57,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:41:57,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:41:57,446 INFO L87 Difference]: Start difference. First operand 6107 states and 11811 transitions. Second operand has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:41:59,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:41:59,491 INFO L93 Difference]: Finished difference Result 13712 states and 26884 transitions. [2024-11-09 19:41:59,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:41:59,492 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 333 [2024-11-09 19:41:59,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:41:59,512 INFO L225 Difference]: With dead ends: 13712 [2024-11-09 19:41:59,512 INFO L226 Difference]: Without dead ends: 7907 [2024-11-09 19:41:59,519 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-09 19:41:59,521 INFO L432 NwaCegarLoop]: 280 mSDtfsCounter, 505 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 1372 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 1578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 1372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-09 19:41:59,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 327 Invalid, 1578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 1372 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-09 19:41:59,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7907 states. [2024-11-09 19:41:59,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7907 to 5801. [2024-11-09 19:41:59,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5801 states, 5800 states have (on average 1.938793103448276) internal successors, (11245), 5800 states have internal predecessors, (11245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:41:59,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5801 states to 5801 states and 11245 transitions. [2024-11-09 19:41:59,683 INFO L78 Accepts]: Start accepts. Automaton has 5801 states and 11245 transitions. Word has length 333 [2024-11-09 19:41:59,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:41:59,684 INFO L471 AbstractCegarLoop]: Abstraction has 5801 states and 11245 transitions. [2024-11-09 19:41:59,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:41:59,684 INFO L276 IsEmpty]: Start isEmpty. Operand 5801 states and 11245 transitions. [2024-11-09 19:41:59,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2024-11-09 19:41:59,691 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:41:59,691 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 19:41:59,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 19:41:59,692 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:41:59,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:41:59,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1139452260, now seen corresponding path program 1 times [2024-11-09 19:41:59,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:41:59,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854518870] [2024-11-09 19:41:59,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:41:59,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:41:59,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:42:00,054 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-09 19:42:00,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:42:00,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854518870] [2024-11-09 19:42:00,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854518870] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:42:00,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:42:00,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:42:00,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246263827] [2024-11-09 19:42:00,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:42:00,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:42:00,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:42:00,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:42:00,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:42:00,060 INFO L87 Difference]: Start difference. First operand 5801 states and 11245 transitions. Second operand has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:42:01,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:42:01,793 INFO L93 Difference]: Finished difference Result 14009 states and 27501 transitions. [2024-11-09 19:42:01,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:42:01,794 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 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 392 [2024-11-09 19:42:01,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:42:01,811 INFO L225 Difference]: With dead ends: 14009 [2024-11-09 19:42:01,811 INFO L226 Difference]: Without dead ends: 8510 [2024-11-09 19:42:01,817 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-09 19:42:01,817 INFO L432 NwaCegarLoop]: 834 mSDtfsCounter, 518 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1360 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 873 SdHoareTripleChecker+Invalid, 1587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 1360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:42:01,819 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 873 Invalid, 1587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 1360 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-09 19:42:01,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8510 states. [2024-11-09 19:42:01,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8510 to 7910. [2024-11-09 19:42:01,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7910 states, 7909 states have (on average 1.9135162473131875) internal successors, (15134), 7909 states have internal predecessors, (15134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:42:01,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7910 states to 7910 states and 15134 transitions. [2024-11-09 19:42:01,932 INFO L78 Accepts]: Start accepts. Automaton has 7910 states and 15134 transitions. Word has length 392 [2024-11-09 19:42:01,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:42:01,932 INFO L471 AbstractCegarLoop]: Abstraction has 7910 states and 15134 transitions. [2024-11-09 19:42:01,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:42:01,933 INFO L276 IsEmpty]: Start isEmpty. Operand 7910 states and 15134 transitions. [2024-11-09 19:42:01,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2024-11-09 19:42:01,938 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:42:01,939 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 19:42:01,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 19:42:01,940 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:42:01,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:42:01,940 INFO L85 PathProgramCache]: Analyzing trace with hash 444280431, now seen corresponding path program 1 times [2024-11-09 19:42:01,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:42:01,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324049546] [2024-11-09 19:42:01,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:42:01,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:42:02,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:42:02,843 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 81 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:42:02,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:42:02,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324049546] [2024-11-09 19:42:02,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324049546] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:42:02,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [732245143] [2024-11-09 19:42:02,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:42:02,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:42:02,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:42:02,846 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 19:42:02,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 19:42:03,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:42:03,020 INFO L255 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 19:42:03,033 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:42:03,995 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-09 19:42:03,996 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 19:42:03,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [732245143] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:42:03,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 19:42:03,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-09 19:42:03,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106316900] [2024-11-09 19:42:03,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:42:03,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:42:03,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:42:03,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:42:03,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 19:42:03,998 INFO L87 Difference]: Start difference. First operand 7910 states and 15134 transitions. Second operand has 4 states, 4 states have (on average 82.25) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:42:07,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:42:07,451 INFO L93 Difference]: Finished difference Result 25746 states and 49642 transitions. [2024-11-09 19:42:07,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:42:07,452 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 82.25) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 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 393 [2024-11-09 19:42:07,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:42:07,480 INFO L225 Difference]: With dead ends: 25746 [2024-11-09 19:42:07,480 INFO L226 Difference]: Without dead ends: 15738 [2024-11-09 19:42:07,490 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 391 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 19:42:07,491 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 964 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 2642 mSolverCounterSat, 672 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 964 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 3314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 672 IncrementalHoareTripleChecker+Valid, 2642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-09 19:42:07,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [964 Valid, 129 Invalid, 3314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [672 Valid, 2642 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-09 19:42:07,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15738 states. [2024-11-09 19:42:07,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15738 to 15436. [2024-11-09 19:42:07,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15436 states, 15435 states have (on average 1.8919987042436022) internal successors, (29203), 15435 states have internal predecessors, (29203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:42:07,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15436 states to 15436 states and 29203 transitions. [2024-11-09 19:42:07,733 INFO L78 Accepts]: Start accepts. Automaton has 15436 states and 29203 transitions. Word has length 393 [2024-11-09 19:42:07,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:42:07,734 INFO L471 AbstractCegarLoop]: Abstraction has 15436 states and 29203 transitions. [2024-11-09 19:42:07,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 82.25) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:42:07,734 INFO L276 IsEmpty]: Start isEmpty. Operand 15436 states and 29203 transitions. [2024-11-09 19:42:07,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2024-11-09 19:42:07,739 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:42:07,740 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 19:42:07,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 19:42:07,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-09 19:42:07,941 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:42:07,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:42:07,941 INFO L85 PathProgramCache]: Analyzing trace with hash 397643860, now seen corresponding path program 1 times [2024-11-09 19:42:07,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:42:07,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718170871] [2024-11-09 19:42:07,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:42:07,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:42:08,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:42:08,279 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-11-09 19:42:08,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:42:08,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718170871] [2024-11-09 19:42:08,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718170871] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:42:08,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:42:08,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:42:08,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918157333] [2024-11-09 19:42:08,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:42:08,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:42:08,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:42:08,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:42:08,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:42:08,281 INFO L87 Difference]: Start difference. First operand 15436 states and 29203 transitions. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:42:10,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:42:10,429 INFO L93 Difference]: Finished difference Result 30871 states and 58413 transitions. [2024-11-09 19:42:10,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:42:10,430 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 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 401 [2024-11-09 19:42:10,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:42:10,454 INFO L225 Difference]: With dead ends: 30871 [2024-11-09 19:42:10,455 INFO L226 Difference]: Without dead ends: 15737 [2024-11-09 19:42:10,469 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-09 19:42:10,470 INFO L432 NwaCegarLoop]: 829 mSDtfsCounter, 517 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 1432 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 1544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 1432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-09 19:42:10,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [517 Valid, 870 Invalid, 1544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 1432 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-09 19:42:10,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15737 states. [2024-11-09 19:42:10,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15737 to 11223. [2024-11-09 19:42:10,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11223 states, 11222 states have (on average 1.8940474068793443) internal successors, (21255), 11222 states have internal predecessors, (21255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:42:10,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11223 states to 11223 states and 21255 transitions. [2024-11-09 19:42:10,629 INFO L78 Accepts]: Start accepts. Automaton has 11223 states and 21255 transitions. Word has length 401 [2024-11-09 19:42:10,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:42:10,630 INFO L471 AbstractCegarLoop]: Abstraction has 11223 states and 21255 transitions. [2024-11-09 19:42:10,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:42:10,630 INFO L276 IsEmpty]: Start isEmpty. Operand 11223 states and 21255 transitions. [2024-11-09 19:42:10,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2024-11-09 19:42:10,636 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:42:10,636 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 19:42:10,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 19:42:10,637 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:42:10,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:42:10,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1521982214, now seen corresponding path program 1 times [2024-11-09 19:42:10,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:42:10,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981296851] [2024-11-09 19:42:10,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:42:10,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:42:10,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:42:10,958 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:42:10,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:42:10,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981296851] [2024-11-09 19:42:10,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981296851] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:42:10,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:42:10,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:42:10,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137813795] [2024-11-09 19:42:10,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:42:10,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:42:10,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:42:10,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:42:10,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:42:10,961 INFO L87 Difference]: Start difference. First operand 11223 states and 21255 transitions. Second operand has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:42:12,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:42:12,455 INFO L93 Difference]: Finished difference Result 25455 states and 48493 transitions. [2024-11-09 19:42:12,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:42:12,456 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 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 409 [2024-11-09 19:42:12,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:42:12,475 INFO L225 Difference]: With dead ends: 25455 [2024-11-09 19:42:12,475 INFO L226 Difference]: Without dead ends: 14534 [2024-11-09 19:42:12,485 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-09 19:42:12,486 INFO L432 NwaCegarLoop]: 835 mSDtfsCounter, 469 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 1369 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 1572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 1369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-09 19:42:12,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 876 Invalid, 1572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 1369 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-09 19:42:12,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14534 states. [2024-11-09 19:42:12,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14534 to 13629. [2024-11-09 19:42:12,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13629 states, 13628 states have (on average 1.8759172292339301) internal successors, (25565), 13628 states have internal predecessors, (25565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:42:12,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13629 states to 13629 states and 25565 transitions. [2024-11-09 19:42:12,656 INFO L78 Accepts]: Start accepts. Automaton has 13629 states and 25565 transitions. Word has length 409 [2024-11-09 19:42:12,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:42:12,657 INFO L471 AbstractCegarLoop]: Abstraction has 13629 states and 25565 transitions. [2024-11-09 19:42:12,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:42:12,657 INFO L276 IsEmpty]: Start isEmpty. Operand 13629 states and 25565 transitions. [2024-11-09 19:42:12,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2024-11-09 19:42:12,662 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:42:12,662 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 19:42:12,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 19:42:12,662 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:42:12,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:42:12,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1336792498, now seen corresponding path program 1 times [2024-11-09 19:42:12,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:42:12,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296112246] [2024-11-09 19:42:12,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:42:12,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:42:12,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:42:12,975 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2024-11-09 19:42:12,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:42:12,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296112246] [2024-11-09 19:42:12,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296112246] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:42:12,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:42:12,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:42:12,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190630905] [2024-11-09 19:42:12,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:42:12,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:42:12,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:42:12,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:42:12,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:42:12,978 INFO L87 Difference]: Start difference. First operand 13629 states and 25565 transitions. Second operand has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:42:14,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:42:14,396 INFO L93 Difference]: Finished difference Result 29658 states and 55984 transitions. [2024-11-09 19:42:14,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:42:14,397 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 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 423 [2024-11-09 19:42:14,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:42:14,418 INFO L225 Difference]: With dead ends: 29658 [2024-11-09 19:42:14,418 INFO L226 Difference]: Without dead ends: 16331 [2024-11-09 19:42:14,428 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-09 19:42:14,429 INFO L432 NwaCegarLoop]: 795 mSDtfsCounter, 517 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 1319 mSolverCounterSat, 219 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 836 SdHoareTripleChecker+Invalid, 1538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 219 IncrementalHoareTripleChecker+Valid, 1319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-09 19:42:14,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [517 Valid, 836 Invalid, 1538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [219 Valid, 1319 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-09 19:42:14,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16331 states. [2024-11-09 19:42:14,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16331 to 15725. [2024-11-09 19:42:14,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15725 states, 15724 states have (on average 1.8681633172220808) internal successors, (29375), 15724 states have internal predecessors, (29375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:42:14,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15725 states to 15725 states and 29375 transitions. [2024-11-09 19:42:14,728 INFO L78 Accepts]: Start accepts. Automaton has 15725 states and 29375 transitions. Word has length 423 [2024-11-09 19:42:14,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:42:14,728 INFO L471 AbstractCegarLoop]: Abstraction has 15725 states and 29375 transitions. [2024-11-09 19:42:14,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:42:14,729 INFO L276 IsEmpty]: Start isEmpty. Operand 15725 states and 29375 transitions. [2024-11-09 19:42:14,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 525 [2024-11-09 19:42:14,736 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:42:14,736 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 19:42:14,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 19:42:14,736 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:42:14,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:42:14,737 INFO L85 PathProgramCache]: Analyzing trace with hash -53427100, now seen corresponding path program 1 times [2024-11-09 19:42:14,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:42:14,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594436810] [2024-11-09 19:42:14,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:42:14,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:42:14,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:42:15,036 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2024-11-09 19:42:15,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:42:15,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594436810] [2024-11-09 19:42:15,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594436810] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:42:15,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:42:15,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:42:15,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937513304] [2024-11-09 19:42:15,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:42:15,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:42:15,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:42:15,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:42:15,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:42:15,043 INFO L87 Difference]: Start difference. First operand 15725 states and 29375 transitions. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:42:16,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:42:16,634 INFO L93 Difference]: Finished difference Result 37446 states and 70016 transitions. [2024-11-09 19:42:16,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:42:16,635 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 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 524 [2024-11-09 19:42:16,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:42:16,745 INFO L225 Difference]: With dead ends: 37446 [2024-11-09 19:42:16,745 INFO L226 Difference]: Without dead ends: 19623 [2024-11-09 19:42:16,749 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-09 19:42:16,750 INFO L432 NwaCegarLoop]: 817 mSDtfsCounter, 513 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 1292 mSolverCounterSat, 253 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 1545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 253 IncrementalHoareTripleChecker+Valid, 1292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-09 19:42:16,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 858 Invalid, 1545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [253 Valid, 1292 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-09 19:42:16,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19623 states. [2024-11-09 19:42:16,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19623 to 15407. [2024-11-09 19:42:16,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15407 states, 15406 states have (on average 1.853693366220953) internal successors, (28558), 15406 states have internal predecessors, (28558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:42:16,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15407 states to 15407 states and 28558 transitions. [2024-11-09 19:42:16,943 INFO L78 Accepts]: Start accepts. Automaton has 15407 states and 28558 transitions. Word has length 524 [2024-11-09 19:42:16,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:42:16,944 INFO L471 AbstractCegarLoop]: Abstraction has 15407 states and 28558 transitions. [2024-11-09 19:42:16,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:42:16,944 INFO L276 IsEmpty]: Start isEmpty. Operand 15407 states and 28558 transitions. [2024-11-09 19:42:16,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 549 [2024-11-09 19:42:16,954 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:42:16,955 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 19:42:16,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 19:42:16,955 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:42:16,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:42:16,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1652105480, now seen corresponding path program 1 times [2024-11-09 19:42:16,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:42:16,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024034012] [2024-11-09 19:42:16,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:42:16,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:42:17,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:42:17,266 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2024-11-09 19:42:17,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:42:17,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024034012] [2024-11-09 19:42:17,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024034012] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:42:17,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:42:17,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:42:17,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276844402] [2024-11-09 19:42:17,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:42:17,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:42:17,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:42:17,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:42:17,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:42:17,269 INFO L87 Difference]: Start difference. First operand 15407 states and 28558 transitions. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:42:18,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:42:18,595 INFO L93 Difference]: Finished difference Result 30810 states and 57116 transitions. [2024-11-09 19:42:18,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:42:18,596 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 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 548 [2024-11-09 19:42:18,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:42:18,613 INFO L225 Difference]: With dead ends: 30810 [2024-11-09 19:42:18,613 INFO L226 Difference]: Without dead ends: 15705 [2024-11-09 19:42:18,620 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-09 19:42:18,621 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 697 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1255 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 697 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 1355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 19:42:18,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [697 Valid, 72 Invalid, 1355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1255 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 19:42:18,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15705 states. [2024-11-09 19:42:18,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15705 to 15405. [2024-11-09 19:42:18,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15405 states, 15404 states have (on average 1.8536743702934302) internal successors, (28554), 15404 states have internal predecessors, (28554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:42:18,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15405 states to 15405 states and 28554 transitions. [2024-11-09 19:42:18,782 INFO L78 Accepts]: Start accepts. Automaton has 15405 states and 28554 transitions. Word has length 548 [2024-11-09 19:42:18,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:42:18,782 INFO L471 AbstractCegarLoop]: Abstraction has 15405 states and 28554 transitions. [2024-11-09 19:42:18,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:42:18,783 INFO L276 IsEmpty]: Start isEmpty. Operand 15405 states and 28554 transitions. [2024-11-09 19:42:18,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 559 [2024-11-09 19:42:18,788 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:42:18,789 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 19:42:18,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 19:42:18,789 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:42:18,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:42:18,790 INFO L85 PathProgramCache]: Analyzing trace with hash 347684689, now seen corresponding path program 1 times [2024-11-09 19:42:18,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:42:18,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436154501] [2024-11-09 19:42:18,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:42:18,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:42:18,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:42:19,050 INFO L134 CoverageAnalysis]: Checked inductivity of 604 backedges. 366 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2024-11-09 19:42:19,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:42:19,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436154501] [2024-11-09 19:42:19,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436154501] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:42:19,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:42:19,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:42:19,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112929894] [2024-11-09 19:42:19,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:42:19,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:42:19,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:42:19,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:42:19,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:42:19,054 INFO L87 Difference]: Start difference. First operand 15405 states and 28554 transitions. Second operand has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:42:20,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:42:20,457 INFO L93 Difference]: Finished difference Result 32308 states and 59905 transitions. [2024-11-09 19:42:20,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:42:20,458 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 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 558 [2024-11-09 19:42:20,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:42:20,482 INFO L225 Difference]: With dead ends: 32308 [2024-11-09 19:42:20,482 INFO L226 Difference]: Without dead ends: 16305 [2024-11-09 19:42:20,494 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-09 19:42:20,494 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 499 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 1205 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 1364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 1205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 19:42:20,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 286 Invalid, 1364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 1205 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 19:42:20,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16305 states. [2024-11-09 19:42:20,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16305 to 11799. [2024-11-09 19:42:20,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11799 states, 11798 states have (on average 1.8454822851330734) internal successors, (21773), 11798 states have internal predecessors, (21773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:42:20,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11799 states to 11799 states and 21773 transitions. [2024-11-09 19:42:20,657 INFO L78 Accepts]: Start accepts. Automaton has 11799 states and 21773 transitions. Word has length 558 [2024-11-09 19:42:20,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:42:20,657 INFO L471 AbstractCegarLoop]: Abstraction has 11799 states and 21773 transitions. [2024-11-09 19:42:20,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:42:20,657 INFO L276 IsEmpty]: Start isEmpty. Operand 11799 states and 21773 transitions. [2024-11-09 19:42:20,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 616 [2024-11-09 19:42:20,664 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:42:20,666 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 19:42:20,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 19:42:20,667 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:42:20,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:42:20,667 INFO L85 PathProgramCache]: Analyzing trace with hash 279666658, now seen corresponding path program 1 times [2024-11-09 19:42:20,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:42:20,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043202604] [2024-11-09 19:42:20,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:42:20,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:42:20,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:42:21,109 INFO L134 CoverageAnalysis]: Checked inductivity of 704 backedges. 369 proven. 0 refuted. 0 times theorem prover too weak. 335 trivial. 0 not checked. [2024-11-09 19:42:21,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:42:21,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043202604] [2024-11-09 19:42:21,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043202604] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:42:21,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:42:21,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:42:21,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045739406] [2024-11-09 19:42:21,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:42:21,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:42:21,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:42:21,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:42:21,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:42:21,113 INFO L87 Difference]: Start difference. First operand 11799 states and 21773 transitions. Second operand has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:42:22,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:42:22,785 INFO L93 Difference]: Finished difference Result 28710 states and 53050 transitions. [2024-11-09 19:42:22,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:42:22,785 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 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 615 [2024-11-09 19:42:22,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:42:22,814 INFO L225 Difference]: With dead ends: 28710 [2024-11-09 19:42:22,814 INFO L226 Difference]: Without dead ends: 17213 [2024-11-09 19:42:22,826 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-09 19:42:22,827 INFO L432 NwaCegarLoop]: 759 mSDtfsCounter, 486 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 1362 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 794 SdHoareTripleChecker+Invalid, 1477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 1362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-09 19:42:22,827 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 794 Invalid, 1477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 1362 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-09 19:42:22,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17213 states. [2024-11-09 19:42:23,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17213 to 16002. [2024-11-09 19:42:23,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16002 states, 16001 states have (on average 1.837010186863321) internal successors, (29394), 16001 states have internal predecessors, (29394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:42:23,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16002 states to 16002 states and 29394 transitions. [2024-11-09 19:42:23,037 INFO L78 Accepts]: Start accepts. Automaton has 16002 states and 29394 transitions. Word has length 615 [2024-11-09 19:42:23,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:42:23,038 INFO L471 AbstractCegarLoop]: Abstraction has 16002 states and 29394 transitions. [2024-11-09 19:42:23,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:42:23,038 INFO L276 IsEmpty]: Start isEmpty. Operand 16002 states and 29394 transitions. [2024-11-09 19:42:23,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 621 [2024-11-09 19:42:23,046 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:42:23,047 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 19:42:23,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 19:42:23,047 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:42:23,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:42:23,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1751662407, now seen corresponding path program 1 times [2024-11-09 19:42:23,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:42:23,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418079921] [2024-11-09 19:42:23,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:42:23,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:42:23,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:42:23,338 INFO L134 CoverageAnalysis]: Checked inductivity of 743 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2024-11-09 19:42:23,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:42:23,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418079921] [2024-11-09 19:42:23,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418079921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:42:23,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:42:23,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:42:23,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976068672] [2024-11-09 19:42:23,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:42:23,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:42:23,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:42:23,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:42:23,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:42:23,341 INFO L87 Difference]: Start difference. First operand 16002 states and 29394 transitions. Second operand has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:42:24,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:42:24,760 INFO L93 Difference]: Finished difference Result 37099 states and 68250 transitions. [2024-11-09 19:42:24,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:42:24,761 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 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 620 [2024-11-09 19:42:24,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:42:24,782 INFO L225 Difference]: With dead ends: 37099 [2024-11-09 19:42:24,782 INFO L226 Difference]: Without dead ends: 21399 [2024-11-09 19:42:24,790 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-09 19:42:24,790 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 533 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 1279 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 1435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 1279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-09 19:42:24,790 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 200 Invalid, 1435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 1279 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-09 19:42:24,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21399 states. [2024-11-09 19:42:24,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21399 to 18098. [2024-11-09 19:42:24,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18098 states, 18097 states have (on average 1.8373763607227718) internal successors, (33251), 18097 states have internal predecessors, (33251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:42:24,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18098 states to 18098 states and 33251 transitions. [2024-11-09 19:42:24,980 INFO L78 Accepts]: Start accepts. Automaton has 18098 states and 33251 transitions. Word has length 620 [2024-11-09 19:42:24,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:42:24,980 INFO L471 AbstractCegarLoop]: Abstraction has 18098 states and 33251 transitions. [2024-11-09 19:42:24,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:42:24,981 INFO L276 IsEmpty]: Start isEmpty. Operand 18098 states and 33251 transitions. [2024-11-09 19:42:24,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 623 [2024-11-09 19:42:24,989 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:42:24,989 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 19:42:24,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 19:42:24,990 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:42:24,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:42:24,991 INFO L85 PathProgramCache]: Analyzing trace with hash -2141508653, now seen corresponding path program 1 times [2024-11-09 19:42:24,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:42:24,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140359884] [2024-11-09 19:42:24,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:42:24,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:42:25,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:42:25,312 INFO L134 CoverageAnalysis]: Checked inductivity of 745 backedges. 426 proven. 0 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2024-11-09 19:42:25,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:42:25,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140359884] [2024-11-09 19:42:25,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140359884] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:42:25,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:42:25,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:42:25,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137972048] [2024-11-09 19:42:25,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:42:25,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:42:25,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:42:25,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:42:25,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:42:25,315 INFO L87 Difference]: Start difference. First operand 18098 states and 33251 transitions. Second operand has 3 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:42:26,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:42:26,605 INFO L93 Difference]: Finished difference Result 38293 states and 70492 transitions. [2024-11-09 19:42:26,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:42:26,606 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 0 states have call successors, (0), 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 622 [2024-11-09 19:42:26,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:42:26,635 INFO L225 Difference]: With dead ends: 38293 [2024-11-09 19:42:26,636 INFO L226 Difference]: Without dead ends: 20497 [2024-11-09 19:42:26,648 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-09 19:42:26,648 INFO L432 NwaCegarLoop]: 657 mSDtfsCounter, 521 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 1302 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 1401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 19:42:26,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 678 Invalid, 1401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1302 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 19:42:26,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20497 states. [2024-11-09 19:42:26,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20497 to 19297. [2024-11-09 19:42:26,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19297 states, 19296 states have (on average 1.836287313432836) internal successors, (35433), 19296 states have internal predecessors, (35433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:42:26,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19297 states to 19297 states and 35433 transitions. [2024-11-09 19:42:26,917 INFO L78 Accepts]: Start accepts. Automaton has 19297 states and 35433 transitions. Word has length 622 [2024-11-09 19:42:26,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:42:26,918 INFO L471 AbstractCegarLoop]: Abstraction has 19297 states and 35433 transitions. [2024-11-09 19:42:26,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:42:26,918 INFO L276 IsEmpty]: Start isEmpty. Operand 19297 states and 35433 transitions. [2024-11-09 19:42:26,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 673 [2024-11-09 19:42:26,929 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:42:26,929 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-09 19:42:26,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 19:42:26,930 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:42:26,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:42:26,930 INFO L85 PathProgramCache]: Analyzing trace with hash -380184453, now seen corresponding path program 1 times [2024-11-09 19:42:26,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:42:26,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7263751] [2024-11-09 19:42:26,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:42:26,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:42:27,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:42:27,998 INFO L134 CoverageAnalysis]: Checked inductivity of 583 backedges. 82 proven. 246 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2024-11-09 19:42:27,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:42:27,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7263751] [2024-11-09 19:42:27,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7263751] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:42:27,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624870836] [2024-11-09 19:42:27,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:42:27,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:42:27,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:42:28,001 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 19:42:28,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 19:42:28,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:42:28,209 INFO L255 TraceCheckSpWp]: Trace formula consists of 791 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 19:42:28,218 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:42:28,284 INFO L134 CoverageAnalysis]: Checked inductivity of 583 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 461 trivial. 0 not checked. [2024-11-09 19:42:28,284 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 19:42:28,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1624870836] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:42:28,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 19:42:28,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-11-09 19:42:28,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071992235] [2024-11-09 19:42:28,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:42:28,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:42:28,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:42:28,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:42:28,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 19:42:28,287 INFO L87 Difference]: Start difference. First operand 19297 states and 35433 transitions. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:42:29,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:42:29,712 INFO L93 Difference]: Finished difference Result 37684 states and 69232 transitions. [2024-11-09 19:42:29,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:42:29,713 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 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 672 [2024-11-09 19:42:29,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:42:29,734 INFO L225 Difference]: With dead ends: 37684 [2024-11-09 19:42:29,734 INFO L226 Difference]: Without dead ends: 18689 [2024-11-09 19:42:29,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 676 GetRequests, 673 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 19:42:29,746 INFO L432 NwaCegarLoop]: 725 mSDtfsCounter, 519 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 1258 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 1385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 1258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-09 19:42:29,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [519 Valid, 760 Invalid, 1385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 1258 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-09 19:42:29,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18689 states. [2024-11-09 19:42:29,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18689 to 18088. [2024-11-09 19:42:30,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18088 states, 18087 states have (on average 1.8097528611710068) internal successors, (32733), 18087 states have internal predecessors, (32733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:42:30,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18088 states to 18088 states and 32733 transitions. [2024-11-09 19:42:30,040 INFO L78 Accepts]: Start accepts. Automaton has 18088 states and 32733 transitions. Word has length 672 [2024-11-09 19:42:30,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:42:30,041 INFO L471 AbstractCegarLoop]: Abstraction has 18088 states and 32733 transitions. [2024-11-09 19:42:30,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:42:30,041 INFO L276 IsEmpty]: Start isEmpty. Operand 18088 states and 32733 transitions. [2024-11-09 19:42:30,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 817 [2024-11-09 19:42:30,062 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:42:30,062 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2024-11-09 19:42:30,076 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 19:42:30,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-09 19:42:30,263 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:42:30,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:42:30,264 INFO L85 PathProgramCache]: Analyzing trace with hash -667289312, now seen corresponding path program 1 times [2024-11-09 19:42:30,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:42:30,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428684945] [2024-11-09 19:42:30,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:42:30,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:42:30,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:42:31,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1280 backedges. 700 proven. 0 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2024-11-09 19:42:31,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:42:31,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428684945] [2024-11-09 19:42:31,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428684945] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:42:31,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:42:31,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 19:42:31,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962657053] [2024-11-09 19:42:31,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:42:31,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:42:31,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:42:31,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:42:31,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:42:31,161 INFO L87 Difference]: Start difference. First operand 18088 states and 32733 transitions. Second operand has 4 states, 4 states have (on average 129.25) internal successors, (517), 4 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:42:33,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:42:33,424 INFO L93 Difference]: Finished difference Result 41281 states and 74662 transitions. [2024-11-09 19:42:33,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:42:33,425 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 129.25) internal successors, (517), 4 states have internal predecessors, (517), 0 states have call successors, (0), 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 816 [2024-11-09 19:42:33,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:42:33,426 INFO L225 Difference]: With dead ends: 41281 [2024-11-09 19:42:33,426 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 19:42:33,442 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:42:33,443 INFO L432 NwaCegarLoop]: 627 mSDtfsCounter, 949 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 3078 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 949 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 3250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 3078 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-09 19:42:33,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [949 Valid, 687 Invalid, 3250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 3078 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-09 19:42:33,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 19:42:33,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 19:42:33,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:42:33,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 19:42:33,444 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 816 [2024-11-09 19:42:33,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:42:33,445 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 19:42:33,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 129.25) internal successors, (517), 4 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:42:33,445 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 19:42:33,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 19:42:33,448 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 19:42:33,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-09 19:42:33,451 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:42:33,453 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 19:42:38,264 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 19:42:38,276 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 07:42:38 BoogieIcfgContainer [2024-11-09 19:42:38,276 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 19:42:38,277 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 19:42:38,277 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 19:42:38,277 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 19:42:38,277 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:41:35" (3/4) ... [2024-11-09 19:42:38,279 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-09 19:42:38,320 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-11-09 19:42:38,324 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-09 19:42:38,327 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 19:42:38,330 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 19:42:38,580 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 19:42:38,581 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 19:42:38,581 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 19:42:38,582 INFO L158 Benchmark]: Toolchain (without parser) took 67526.51ms. Allocated memory was 159.4MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 86.2MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 108.7MB. Max. memory is 16.1GB. [2024-11-09 19:42:38,582 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 121.6MB. Free memory is still 82.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 19:42:38,582 INFO L158 Benchmark]: CACSL2BoogieTranslator took 989.57ms. Allocated memory is still 159.4MB. Free memory was 86.2MB in the beginning and 69.7MB in the end (delta: 16.6MB). Peak memory consumption was 26.4MB. Max. memory is 16.1GB. [2024-11-09 19:42:38,582 INFO L158 Benchmark]: Boogie Procedure Inliner took 216.89ms. Allocated memory is still 159.4MB. Free memory was 69.3MB in the beginning and 95.9MB in the end (delta: -26.6MB). Peak memory consumption was 33.3MB. Max. memory is 16.1GB. [2024-11-09 19:42:38,585 INFO L158 Benchmark]: Boogie Preprocessor took 306.57ms. Allocated memory is still 159.4MB. Free memory was 95.9MB in the beginning and 94.6MB in the end (delta: 1.4MB). Peak memory consumption was 60.6MB. Max. memory is 16.1GB. [2024-11-09 19:42:38,586 INFO L158 Benchmark]: IcfgBuilder took 3089.32ms. Allocated memory was 159.4MB in the beginning and 260.0MB in the end (delta: 100.7MB). Free memory was 94.6MB in the beginning and 139.6MB in the end (delta: -45.1MB). Peak memory consumption was 141.9MB. Max. memory is 16.1GB. [2024-11-09 19:42:38,586 INFO L158 Benchmark]: TraceAbstraction took 62610.76ms. Allocated memory was 260.0MB in the beginning and 1.7GB in the end (delta: 1.4GB). Free memory was 138.6MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2024-11-09 19:42:38,586 INFO L158 Benchmark]: Witness Printer took 304.57ms. Allocated memory is still 1.7GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 41.9MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-11-09 19:42:38,588 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 121.6MB. Free memory is still 82.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 989.57ms. Allocated memory is still 159.4MB. Free memory was 86.2MB in the beginning and 69.7MB in the end (delta: 16.6MB). Peak memory consumption was 26.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 216.89ms. Allocated memory is still 159.4MB. Free memory was 69.3MB in the beginning and 95.9MB in the end (delta: -26.6MB). Peak memory consumption was 33.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 306.57ms. Allocated memory is still 159.4MB. Free memory was 95.9MB in the beginning and 94.6MB in the end (delta: 1.4MB). Peak memory consumption was 60.6MB. Max. memory is 16.1GB. * IcfgBuilder took 3089.32ms. Allocated memory was 159.4MB in the beginning and 260.0MB in the end (delta: 100.7MB). Free memory was 94.6MB in the beginning and 139.6MB in the end (delta: -45.1MB). Peak memory consumption was 141.9MB. Max. memory is 16.1GB. * TraceAbstraction took 62610.76ms. Allocated memory was 260.0MB in the beginning and 1.7GB in the end (delta: 1.4GB). Free memory was 138.6MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. * Witness Printer took 304.57ms. Allocated memory is still 1.7GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 41.9MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 143]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 427 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 57.7s, OverallIterations: 22, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 43.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 13296 SdHoareTripleChecker+Valid, 40.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13296 mSDsluCounter, 11078 SdHoareTripleChecker+Invalid, 34.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 975 mSDsCounter, 4411 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 36847 IncrementalHoareTripleChecker+Invalid, 41258 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4411 mSolverCounterUnsat, 10103 mSDtfsCounter, 36847 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1128 GetRequests, 1096 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19297occurred in iteration=20, InterpolantAutomatonStates: 71, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.3s AutomataMinimizationTime, 22 MinimizatonAttempts, 27459 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 8.0s InterpolantComputationTime, 9701 NumberOfCodeBlocks, 9701 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 9677 ConstructedInterpolants, 0 QuantifiedInterpolants, 22699 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1276 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 24 InterpolantComputations, 22 PerfectInterpolantSequences, 7332/7643 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1776]: Location Invariant Derived location invariant: null RESULT: Ultimate proved your program to be correct! [2024-11-09 19:42:38,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE