./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.04.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.04.cil.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 1de07d37d630bd073064bf436fb9512b72ab982b0eaf3fcb1582f689c57482fa --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 19:56:58,182 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 19:56:58,262 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 19:56:58,267 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 19:56:58,269 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 19:56:58,298 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 19:56:58,299 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 19:56:58,299 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 19:56:58,300 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 19:56:58,301 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 19:56:58,301 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 19:56:58,302 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 19:56:58,302 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 19:56:58,304 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 19:56:58,305 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 19:56:58,305 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 19:56:58,306 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 19:56:58,306 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 19:56:58,306 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 19:56:58,306 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 19:56:58,306 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 19:56:58,307 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 19:56:58,307 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 19:56:58,308 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 19:56:58,308 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 19:56:58,308 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 19:56:58,308 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 19:56:58,309 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 19:56:58,309 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 19:56:58,309 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 19:56:58,310 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 19:56:58,310 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 19:56:58,310 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:56:58,310 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 19:56:58,311 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 19:56:58,311 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 19:56:58,311 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 19:56:58,312 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 19:56:58,312 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 19:56:58,312 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 19:56:58,312 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 19:56:58,313 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 19:56:58,313 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 -> 1de07d37d630bd073064bf436fb9512b72ab982b0eaf3fcb1582f689c57482fa [2024-10-12 19:56:58,601 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 19:56:58,626 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 19:56:58,629 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 19:56:58,630 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 19:56:58,631 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 19:56:58,633 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.04.cil.c [2024-10-12 19:57:00,084 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 19:57:00,331 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 19:57:00,332 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.04.cil.c [2024-10-12 19:57:00,345 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e5a2a871/88767aa50da74dbab1cbd52f306cfdeb/FLAG8534ec229 [2024-10-12 19:57:00,359 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e5a2a871/88767aa50da74dbab1cbd52f306cfdeb [2024-10-12 19:57:00,362 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 19:57:00,363 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 19:57:00,366 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 19:57:00,366 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 19:57:00,373 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 19:57:00,374 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:57:00" (1/1) ... [2024-10-12 19:57:00,375 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@732dfc6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:57:00, skipping insertion in model container [2024-10-12 19:57:00,375 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:57:00" (1/1) ... [2024-10-12 19:57:00,422 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 19:57:00,610 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.04.cil.c[706,719] [2024-10-12 19:57:00,710 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:57:00,723 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 19:57:00,736 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.04.cil.c[706,719] [2024-10-12 19:57:00,765 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:57:00,789 INFO L204 MainTranslator]: Completed translation [2024-10-12 19:57:00,790 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:57:00 WrapperNode [2024-10-12 19:57:00,790 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 19:57:00,791 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 19:57:00,791 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 19:57:00,791 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 19:57:00,798 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:57:00" (1/1) ... [2024-10-12 19:57:00,807 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:57:00" (1/1) ... [2024-10-12 19:57:00,835 INFO L138 Inliner]: procedures = 36, calls = 42, calls flagged for inlining = 20, calls inlined = 20, statements flattened = 387 [2024-10-12 19:57:00,835 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 19:57:00,836 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 19:57:00,836 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 19:57:00,836 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 19:57:00,846 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:57:00" (1/1) ... [2024-10-12 19:57:00,847 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:57:00" (1/1) ... [2024-10-12 19:57:00,850 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:57:00" (1/1) ... [2024-10-12 19:57:00,866 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-10-12 19:57:00,866 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:57:00" (1/1) ... [2024-10-12 19:57:00,867 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:57:00" (1/1) ... [2024-10-12 19:57:00,873 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:57:00" (1/1) ... [2024-10-12 19:57:00,880 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:57:00" (1/1) ... [2024-10-12 19:57:00,882 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:57:00" (1/1) ... [2024-10-12 19:57:00,885 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:57:00" (1/1) ... [2024-10-12 19:57:00,888 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 19:57:00,889 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 19:57:00,889 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 19:57:00,889 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 19:57:00,890 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:57:00" (1/1) ... [2024-10-12 19:57:00,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:57:00,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:57:00,931 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-10-12 19:57:00,933 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-10-12 19:57:00,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 19:57:00,979 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-12 19:57:00,979 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-12 19:57:00,979 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-12 19:57:00,979 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-12 19:57:00,980 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-12 19:57:00,980 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-12 19:57:00,980 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-12 19:57:00,980 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-12 19:57:00,980 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-12 19:57:00,980 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-12 19:57:00,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 19:57:00,981 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-12 19:57:00,981 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-12 19:57:00,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 19:57:00,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 19:57:01,107 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 19:57:01,109 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 19:57:01,656 INFO L? ?]: Removed 49 outVars from TransFormulas that were not future-live. [2024-10-12 19:57:01,656 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 19:57:01,703 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 19:57:01,704 INFO L314 CfgBuilder]: Removed 8 assume(true) statements. [2024-10-12 19:57:01,704 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:57:01 BoogieIcfgContainer [2024-10-12 19:57:01,704 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 19:57:01,706 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 19:57:01,706 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 19:57:01,710 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 19:57:01,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 07:57:00" (1/3) ... [2024-10-12 19:57:01,711 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c5180ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:57:01, skipping insertion in model container [2024-10-12 19:57:01,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:57:00" (2/3) ... [2024-10-12 19:57:01,711 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c5180ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:57:01, skipping insertion in model container [2024-10-12 19:57:01,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:57:01" (3/3) ... [2024-10-12 19:57:01,714 INFO L112 eAbstractionObserver]: Analyzing ICFG transmitter.04.cil.c [2024-10-12 19:57:01,730 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 19:57:01,730 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 19:57:01,792 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 19:57:01,803 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;@326a0bb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 19:57:01,804 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 19:57:01,810 INFO L276 IsEmpty]: Start isEmpty. Operand has 159 states, 134 states have (on average 1.6940298507462686) internal successors, (227), 136 states have internal predecessors, (227), 17 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-12 19:57:01,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-12 19:57:01,821 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:57:01,822 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:57:01,822 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:57:01,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:57:01,828 INFO L85 PathProgramCache]: Analyzing trace with hash 129467670, now seen corresponding path program 1 times [2024-10-12 19:57:01,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:57:01,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90920023] [2024-10-12 19:57:01,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:57:01,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:57:01,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:02,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:57:02,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:02,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 19:57:02,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:02,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 19:57:02,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:02,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 19:57:02,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:02,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-12 19:57:02,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:02,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:57:02,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:57:02,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90920023] [2024-10-12 19:57:02,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90920023] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:57:02,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:57:02,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:57:02,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984649673] [2024-10-12 19:57:02,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:57:02,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:57:02,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:57:02,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:57:02,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:57:02,559 INFO L87 Difference]: Start difference. First operand has 159 states, 134 states have (on average 1.6940298507462686) internal successors, (227), 136 states have internal predecessors, (227), 17 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:57:04,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:57:04,119 INFO L93 Difference]: Finished difference Result 555 states and 928 transitions. [2024-10-12 19:57:04,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 19:57:04,122 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 81 [2024-10-12 19:57:04,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:57:04,135 INFO L225 Difference]: With dead ends: 555 [2024-10-12 19:57:04,135 INFO L226 Difference]: Without dead ends: 402 [2024-10-12 19:57:04,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-12 19:57:04,148 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 581 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 591 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:57:04,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [591 Valid, 480 Invalid, 981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 19:57:04,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2024-10-12 19:57:04,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 307. [2024-10-12 19:57:04,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 264 states have (on average 1.5643939393939394) internal successors, (413), 266 states have internal predecessors, (413), 29 states have call successors, (29), 12 states have call predecessors, (29), 13 states have return successors, (32), 29 states have call predecessors, (32), 29 states have call successors, (32) [2024-10-12 19:57:04,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 474 transitions. [2024-10-12 19:57:04,239 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 474 transitions. Word has length 81 [2024-10-12 19:57:04,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:57:04,240 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 474 transitions. [2024-10-12 19:57:04,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:57:04,241 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 474 transitions. [2024-10-12 19:57:04,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-12 19:57:04,244 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:57:04,244 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:57:04,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 19:57:04,245 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:57:04,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:57:04,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1030795449, now seen corresponding path program 1 times [2024-10-12 19:57:04,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:57:04,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488044470] [2024-10-12 19:57:04,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:57:04,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:57:04,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:04,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:57:04,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:04,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 19:57:04,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:04,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 19:57:04,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:04,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 19:57:04,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:04,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-12 19:57:04,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:04,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:57:04,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:57:04,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488044470] [2024-10-12 19:57:04,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488044470] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:57:04,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:57:04,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:57:04,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65636711] [2024-10-12 19:57:04,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:57:04,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:57:04,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:57:04,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:57:04,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:57:04,489 INFO L87 Difference]: Start difference. First operand 307 states and 474 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:57:06,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:57:06,278 INFO L93 Difference]: Finished difference Result 957 states and 1497 transitions. [2024-10-12 19:57:06,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 19:57:06,279 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 81 [2024-10-12 19:57:06,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:57:06,288 INFO L225 Difference]: With dead ends: 957 [2024-10-12 19:57:06,288 INFO L226 Difference]: Without dead ends: 660 [2024-10-12 19:57:06,291 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-12 19:57:06,292 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 619 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 1812 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 629 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 1857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-12 19:57:06,293 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [629 Valid, 886 Invalid, 1857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1812 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-12 19:57:06,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2024-10-12 19:57:06,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 447. [2024-10-12 19:57:06,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 385 states have (on average 1.5532467532467533) internal successors, (598), 388 states have internal predecessors, (598), 41 states have call successors, (41), 18 states have call predecessors, (41), 20 states have return successors, (46), 42 states have call predecessors, (46), 41 states have call successors, (46) [2024-10-12 19:57:06,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 685 transitions. [2024-10-12 19:57:06,364 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 685 transitions. Word has length 81 [2024-10-12 19:57:06,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:57:06,365 INFO L471 AbstractCegarLoop]: Abstraction has 447 states and 685 transitions. [2024-10-12 19:57:06,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:57:06,365 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 685 transitions. [2024-10-12 19:57:06,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-12 19:57:06,368 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:57:06,368 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:57:06,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 19:57:06,369 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:57:06,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:57:06,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1984735607, now seen corresponding path program 1 times [2024-10-12 19:57:06,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:57:06,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441076551] [2024-10-12 19:57:06,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:57:06,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:57:06,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:06,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:57:06,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:06,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 19:57:06,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:06,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 19:57:06,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:06,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 19:57:06,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:06,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-12 19:57:06,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:06,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:57:06,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:57:06,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441076551] [2024-10-12 19:57:06,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441076551] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:57:06,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:57:06,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:57:06,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68570197] [2024-10-12 19:57:06,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:57:06,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:57:06,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:57:06,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:57:06,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:57:06,600 INFO L87 Difference]: Start difference. First operand 447 states and 685 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:57:08,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:57:08,230 INFO L93 Difference]: Finished difference Result 1471 states and 2290 transitions. [2024-10-12 19:57:08,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 19:57:08,234 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 81 [2024-10-12 19:57:08,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:57:08,241 INFO L225 Difference]: With dead ends: 1471 [2024-10-12 19:57:08,242 INFO L226 Difference]: Without dead ends: 1034 [2024-10-12 19:57:08,244 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-12 19:57:08,245 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 617 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 1808 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 627 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 1855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-12 19:57:08,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [627 Valid, 884 Invalid, 1855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1808 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-12 19:57:08,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2024-10-12 19:57:08,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 728. [2024-10-12 19:57:08,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 728 states, 628 states have (on average 1.5429936305732483) internal successors, (969), 633 states have internal predecessors, (969), 65 states have call successors, (65), 30 states have call predecessors, (65), 34 states have return successors, (78), 68 states have call predecessors, (78), 65 states have call successors, (78) [2024-10-12 19:57:08,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 1112 transitions. [2024-10-12 19:57:08,311 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 1112 transitions. Word has length 81 [2024-10-12 19:57:08,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:57:08,311 INFO L471 AbstractCegarLoop]: Abstraction has 728 states and 1112 transitions. [2024-10-12 19:57:08,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:57:08,312 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 1112 transitions. [2024-10-12 19:57:08,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-12 19:57:08,318 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:57:08,319 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-12 19:57:08,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 19:57:08,319 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:57:08,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:57:08,320 INFO L85 PathProgramCache]: Analyzing trace with hash 768581881, now seen corresponding path program 1 times [2024-10-12 19:57:08,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:57:08,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288809446] [2024-10-12 19:57:08,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:57:08,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:57:08,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:08,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:57:08,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:08,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 19:57:08,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:08,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 19:57:08,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:08,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 19:57:08,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:08,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-12 19:57:08,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:08,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:57:08,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:57:08,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288809446] [2024-10-12 19:57:08,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288809446] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:57:08,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:57:08,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:57:08,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668025767] [2024-10-12 19:57:08,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:57:08,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:57:08,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:57:08,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:57:08,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:57:08,508 INFO L87 Difference]: Start difference. First operand 728 states and 1112 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:57:09,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:57:09,234 INFO L93 Difference]: Finished difference Result 1684 states and 2617 transitions. [2024-10-12 19:57:09,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:57:09,234 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 81 [2024-10-12 19:57:09,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:57:09,241 INFO L225 Difference]: With dead ends: 1684 [2024-10-12 19:57:09,242 INFO L226 Difference]: Without dead ends: 966 [2024-10-12 19:57:09,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 19:57:09,246 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 458 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 19:57:09,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 441 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 19:57:09,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2024-10-12 19:57:09,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 728. [2024-10-12 19:57:09,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 728 states, 628 states have (on average 1.535031847133758) internal successors, (964), 633 states have internal predecessors, (964), 65 states have call successors, (65), 30 states have call predecessors, (65), 34 states have return successors, (78), 68 states have call predecessors, (78), 65 states have call successors, (78) [2024-10-12 19:57:09,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 1107 transitions. [2024-10-12 19:57:09,307 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 1107 transitions. Word has length 81 [2024-10-12 19:57:09,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:57:09,308 INFO L471 AbstractCegarLoop]: Abstraction has 728 states and 1107 transitions. [2024-10-12 19:57:09,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:57:09,308 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 1107 transitions. [2024-10-12 19:57:09,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-12 19:57:09,312 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:57:09,312 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:57:09,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 19:57:09,314 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:57:09,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:57:09,314 INFO L85 PathProgramCache]: Analyzing trace with hash 36614455, now seen corresponding path program 1 times [2024-10-12 19:57:09,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:57:09,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664156600] [2024-10-12 19:57:09,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:57:09,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:57:09,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:09,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:57:09,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:09,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 19:57:09,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:09,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 19:57:09,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:09,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 19:57:09,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:09,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-12 19:57:09,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:09,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:57:09,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:57:09,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664156600] [2024-10-12 19:57:09,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664156600] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:57:09,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:57:09,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:57:09,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008319780] [2024-10-12 19:57:09,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:57:09,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:57:09,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:57:09,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:57:09,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:57:09,451 INFO L87 Difference]: Start difference. First operand 728 states and 1107 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:57:10,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:57:10,123 INFO L93 Difference]: Finished difference Result 1678 states and 2591 transitions. [2024-10-12 19:57:10,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:57:10,124 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 81 [2024-10-12 19:57:10,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:57:10,131 INFO L225 Difference]: With dead ends: 1678 [2024-10-12 19:57:10,132 INFO L226 Difference]: Without dead ends: 960 [2024-10-12 19:57:10,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 19:57:10,136 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 498 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 19:57:10,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 368 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 648 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 19:57:10,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2024-10-12 19:57:10,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 728. [2024-10-12 19:57:10,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 728 states, 628 states have (on average 1.5270700636942676) internal successors, (959), 633 states have internal predecessors, (959), 65 states have call successors, (65), 30 states have call predecessors, (65), 34 states have return successors, (78), 68 states have call predecessors, (78), 65 states have call successors, (78) [2024-10-12 19:57:10,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 1102 transitions. [2024-10-12 19:57:10,194 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 1102 transitions. Word has length 81 [2024-10-12 19:57:10,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:57:10,195 INFO L471 AbstractCegarLoop]: Abstraction has 728 states and 1102 transitions. [2024-10-12 19:57:10,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:57:10,195 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 1102 transitions. [2024-10-12 19:57:10,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-12 19:57:10,197 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:57:10,197 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:57:10,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 19:57:10,197 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:57:10,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:57:10,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1649565383, now seen corresponding path program 1 times [2024-10-12 19:57:10,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:57:10,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167845755] [2024-10-12 19:57:10,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:57:10,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:57:10,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:10,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:57:10,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:10,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 19:57:10,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:10,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 19:57:10,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:10,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 19:57:10,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:10,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-12 19:57:10,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:10,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:57:10,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:57:10,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167845755] [2024-10-12 19:57:10,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167845755] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:57:10,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:57:10,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:57:10,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946344111] [2024-10-12 19:57:10,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:57:10,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:57:10,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:57:10,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:57:10,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:57:10,370 INFO L87 Difference]: Start difference. First operand 728 states and 1102 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:57:12,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:57:12,060 INFO L93 Difference]: Finished difference Result 2631 states and 4025 transitions. [2024-10-12 19:57:12,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-12 19:57:12,060 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 81 [2024-10-12 19:57:12,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:57:12,071 INFO L225 Difference]: With dead ends: 2631 [2024-10-12 19:57:12,071 INFO L226 Difference]: Without dead ends: 1913 [2024-10-12 19:57:12,074 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2024-10-12 19:57:12,078 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 626 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 1759 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 635 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 1808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-12 19:57:12,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [635 Valid, 869 Invalid, 1808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1759 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-12 19:57:12,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1913 states. [2024-10-12 19:57:12,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1913 to 1287. [2024-10-12 19:57:12,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1287 states, 1115 states have (on average 1.5201793721973094) internal successors, (1695), 1124 states have internal predecessors, (1695), 109 states have call successors, (109), 54 states have call predecessors, (109), 62 states have return successors, (144), 116 states have call predecessors, (144), 109 states have call successors, (144) [2024-10-12 19:57:12,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1287 states to 1287 states and 1948 transitions. [2024-10-12 19:57:12,231 INFO L78 Accepts]: Start accepts. Automaton has 1287 states and 1948 transitions. Word has length 81 [2024-10-12 19:57:12,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:57:12,231 INFO L471 AbstractCegarLoop]: Abstraction has 1287 states and 1948 transitions. [2024-10-12 19:57:12,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:57:12,231 INFO L276 IsEmpty]: Start isEmpty. Operand 1287 states and 1948 transitions. [2024-10-12 19:57:12,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-12 19:57:12,234 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:57:12,235 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:57:12,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 19:57:12,235 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:57:12,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:57:12,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1703958281, now seen corresponding path program 1 times [2024-10-12 19:57:12,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:57:12,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123342272] [2024-10-12 19:57:12,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:57:12,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:57:12,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:12,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:57:12,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:12,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 19:57:12,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:12,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 19:57:12,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:12,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 19:57:12,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:12,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-12 19:57:12,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:12,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:57:12,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:57:12,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123342272] [2024-10-12 19:57:12,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123342272] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:57:12,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:57:12,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:57:12,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995160978] [2024-10-12 19:57:12,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:57:12,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:57:12,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:57:12,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:57:12,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:57:12,368 INFO L87 Difference]: Start difference. First operand 1287 states and 1948 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:57:13,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:57:13,117 INFO L93 Difference]: Finished difference Result 2930 states and 4491 transitions. [2024-10-12 19:57:13,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:57:13,118 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 81 [2024-10-12 19:57:13,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:57:13,127 INFO L225 Difference]: With dead ends: 2930 [2024-10-12 19:57:13,127 INFO L226 Difference]: Without dead ends: 1653 [2024-10-12 19:57:13,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 19:57:13,136 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 436 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 692 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 19:57:13,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 441 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 692 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 19:57:13,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1653 states. [2024-10-12 19:57:13,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1653 to 1287. [2024-10-12 19:57:13,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1287 states, 1115 states have (on average 1.5121076233183857) internal successors, (1686), 1124 states have internal predecessors, (1686), 109 states have call successors, (109), 54 states have call predecessors, (109), 62 states have return successors, (144), 116 states have call predecessors, (144), 109 states have call successors, (144) [2024-10-12 19:57:13,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1287 states to 1287 states and 1939 transitions. [2024-10-12 19:57:13,236 INFO L78 Accepts]: Start accepts. Automaton has 1287 states and 1939 transitions. Word has length 81 [2024-10-12 19:57:13,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:57:13,239 INFO L471 AbstractCegarLoop]: Abstraction has 1287 states and 1939 transitions. [2024-10-12 19:57:13,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:57:13,239 INFO L276 IsEmpty]: Start isEmpty. Operand 1287 states and 1939 transitions. [2024-10-12 19:57:13,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-12 19:57:13,245 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:57:13,245 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:57:13,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 19:57:13,246 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:57:13,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:57:13,246 INFO L85 PathProgramCache]: Analyzing trace with hash -2121354887, now seen corresponding path program 1 times [2024-10-12 19:57:13,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:57:13,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454986316] [2024-10-12 19:57:13,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:57:13,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:57:13,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:13,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:57:13,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:13,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 19:57:13,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:13,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 19:57:13,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:13,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 19:57:13,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:13,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-12 19:57:13,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:13,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:57:13,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:57:13,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454986316] [2024-10-12 19:57:13,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454986316] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:57:13,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:57:13,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:57:13,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419107694] [2024-10-12 19:57:13,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:57:13,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:57:13,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:57:13,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:57:13,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:57:13,412 INFO L87 Difference]: Start difference. First operand 1287 states and 1939 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:57:14,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:57:14,920 INFO L93 Difference]: Finished difference Result 4450 states and 6753 transitions. [2024-10-12 19:57:14,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-12 19:57:14,920 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 81 [2024-10-12 19:57:14,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:57:14,938 INFO L225 Difference]: With dead ends: 4450 [2024-10-12 19:57:14,939 INFO L226 Difference]: Without dead ends: 3173 [2024-10-12 19:57:14,944 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2024-10-12 19:57:14,945 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 590 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 1700 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 599 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 1750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:57:14,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [599 Valid, 869 Invalid, 1750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1700 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 19:57:14,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3173 states. [2024-10-12 19:57:15,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3173 to 2420. [2024-10-12 19:57:15,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2420 states, 2108 states have (on average 1.5071157495256167) internal successors, (3177), 2125 states have internal predecessors, (3177), 193 states have call successors, (193), 102 states have call predecessors, (193), 118 states have return successors, (290), 208 states have call predecessors, (290), 193 states have call successors, (290) [2024-10-12 19:57:15,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2420 states to 2420 states and 3660 transitions. [2024-10-12 19:57:15,188 INFO L78 Accepts]: Start accepts. Automaton has 2420 states and 3660 transitions. Word has length 81 [2024-10-12 19:57:15,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:57:15,189 INFO L471 AbstractCegarLoop]: Abstraction has 2420 states and 3660 transitions. [2024-10-12 19:57:15,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:57:15,189 INFO L276 IsEmpty]: Start isEmpty. Operand 2420 states and 3660 transitions. [2024-10-12 19:57:15,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-12 19:57:15,192 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:57:15,192 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:57:15,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 19:57:15,193 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:57:15,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:57:15,194 INFO L85 PathProgramCache]: Analyzing trace with hash -159780229, now seen corresponding path program 1 times [2024-10-12 19:57:15,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:57:15,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521673740] [2024-10-12 19:57:15,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:57:15,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:57:15,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:15,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:57:15,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:15,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 19:57:15,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:15,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 19:57:15,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:15,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 19:57:15,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:15,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-12 19:57:15,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:15,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:57:15,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:57:15,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521673740] [2024-10-12 19:57:15,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521673740] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:57:15,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:57:15,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:57:15,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405182559] [2024-10-12 19:57:15,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:57:15,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:57:15,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:57:15,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:57:15,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:57:15,347 INFO L87 Difference]: Start difference. First operand 2420 states and 3660 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:57:16,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:57:16,199 INFO L93 Difference]: Finished difference Result 5301 states and 8110 transitions. [2024-10-12 19:57:16,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:57:16,199 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 81 [2024-10-12 19:57:16,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:57:16,218 INFO L225 Difference]: With dead ends: 5301 [2024-10-12 19:57:16,218 INFO L226 Difference]: Without dead ends: 2892 [2024-10-12 19:57:16,227 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-12 19:57:16,229 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 196 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 737 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 19:57:16,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 506 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 737 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 19:57:16,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2892 states. [2024-10-12 19:57:16,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2892 to 2422. [2024-10-12 19:57:16,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2422 states, 2110 states have (on average 1.499052132701422) internal successors, (3163), 2127 states have internal predecessors, (3163), 193 states have call successors, (193), 102 states have call predecessors, (193), 118 states have return successors, (290), 208 states have call predecessors, (290), 193 states have call successors, (290) [2024-10-12 19:57:16,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2422 states to 2422 states and 3646 transitions. [2024-10-12 19:57:16,413 INFO L78 Accepts]: Start accepts. Automaton has 2422 states and 3646 transitions. Word has length 81 [2024-10-12 19:57:16,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:57:16,414 INFO L471 AbstractCegarLoop]: Abstraction has 2422 states and 3646 transitions. [2024-10-12 19:57:16,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:57:16,414 INFO L276 IsEmpty]: Start isEmpty. Operand 2422 states and 3646 transitions. [2024-10-12 19:57:16,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-12 19:57:16,417 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:57:16,417 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:57:16,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 19:57:16,418 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:57:16,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:57:16,418 INFO L85 PathProgramCache]: Analyzing trace with hash 284120445, now seen corresponding path program 1 times [2024-10-12 19:57:16,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:57:16,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649236131] [2024-10-12 19:57:16,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:57:16,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:57:16,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:16,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:57:16,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:16,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 19:57:16,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:16,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 19:57:16,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:16,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 19:57:16,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:16,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-12 19:57:16,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:16,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:57:16,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:57:16,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649236131] [2024-10-12 19:57:16,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649236131] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:57:16,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:57:16,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:57:16,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773782521] [2024-10-12 19:57:16,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:57:16,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:57:16,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:57:16,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:57:16,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:57:16,538 INFO L87 Difference]: Start difference. First operand 2422 states and 3646 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:57:17,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:57:17,238 INFO L93 Difference]: Finished difference Result 5339 states and 8133 transitions. [2024-10-12 19:57:17,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 19:57:17,239 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 81 [2024-10-12 19:57:17,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:57:17,255 INFO L225 Difference]: With dead ends: 5339 [2024-10-12 19:57:17,255 INFO L226 Difference]: Without dead ends: 2928 [2024-10-12 19:57:17,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-12 19:57:17,265 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 207 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 709 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 19:57:17,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 506 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 709 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 19:57:17,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2928 states. [2024-10-12 19:57:17,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2928 to 2456. [2024-10-12 19:57:17,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2456 states, 2144 states have (on average 1.4911380597014925) internal successors, (3197), 2161 states have internal predecessors, (3197), 193 states have call successors, (193), 102 states have call predecessors, (193), 118 states have return successors, (290), 208 states have call predecessors, (290), 193 states have call successors, (290) [2024-10-12 19:57:17,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2456 states to 2456 states and 3680 transitions. [2024-10-12 19:57:17,498 INFO L78 Accepts]: Start accepts. Automaton has 2456 states and 3680 transitions. Word has length 81 [2024-10-12 19:57:17,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:57:17,498 INFO L471 AbstractCegarLoop]: Abstraction has 2456 states and 3680 transitions. [2024-10-12 19:57:17,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:57:17,498 INFO L276 IsEmpty]: Start isEmpty. Operand 2456 states and 3680 transitions. [2024-10-12 19:57:17,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-12 19:57:17,501 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:57:17,502 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:57:17,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 19:57:17,502 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:57:17,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:57:17,503 INFO L85 PathProgramCache]: Analyzing trace with hash -2071684805, now seen corresponding path program 1 times [2024-10-12 19:57:17,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:57:17,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979950546] [2024-10-12 19:57:17,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:57:17,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:57:17,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:17,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:57:17,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:17,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 19:57:17,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:17,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 19:57:17,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:17,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 19:57:17,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:17,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-12 19:57:17,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:17,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:57:17,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:57:17,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979950546] [2024-10-12 19:57:17,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979950546] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:57:17,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:57:17,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:57:17,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558654306] [2024-10-12 19:57:17,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:57:17,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:57:17,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:57:17,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:57:17,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:57:17,660 INFO L87 Difference]: Start difference. First operand 2456 states and 3680 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:57:19,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:57:19,640 INFO L93 Difference]: Finished difference Result 13407 states and 20579 transitions. [2024-10-12 19:57:19,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-12 19:57:19,640 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 81 [2024-10-12 19:57:19,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:57:19,733 INFO L225 Difference]: With dead ends: 13407 [2024-10-12 19:57:19,734 INFO L226 Difference]: Without dead ends: 10962 [2024-10-12 19:57:19,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2024-10-12 19:57:19,749 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 1322 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 1423 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1336 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 1594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 1423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:57:19,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1336 Valid, 808 Invalid, 1594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 1423 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 19:57:19,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10962 states. [2024-10-12 19:57:20,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10962 to 9137. [2024-10-12 19:57:20,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9137 states, 8001 states have (on average 1.4820647419072617) internal successors, (11858), 8066 states have internal predecessors, (11858), 667 states have call successors, (667), 400 states have call predecessors, (667), 468 states have return successors, (1233), 686 states have call predecessors, (1233), 667 states have call successors, (1233) [2024-10-12 19:57:20,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9137 states to 9137 states and 13758 transitions. [2024-10-12 19:57:20,598 INFO L78 Accepts]: Start accepts. Automaton has 9137 states and 13758 transitions. Word has length 81 [2024-10-12 19:57:20,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:57:20,599 INFO L471 AbstractCegarLoop]: Abstraction has 9137 states and 13758 transitions. [2024-10-12 19:57:20,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:57:20,599 INFO L276 IsEmpty]: Start isEmpty. Operand 9137 states and 13758 transitions. [2024-10-12 19:57:20,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-12 19:57:20,604 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:57:20,604 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:57:20,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 19:57:20,604 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:57:20,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:57:20,605 INFO L85 PathProgramCache]: Analyzing trace with hash 915277722, now seen corresponding path program 1 times [2024-10-12 19:57:20,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:57:20,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260544417] [2024-10-12 19:57:20,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:57:20,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:57:20,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:20,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:57:20,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:20,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 19:57:20,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:20,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 19:57:20,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:20,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 19:57:20,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:20,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-12 19:57:20,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:20,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:57:20,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:57:20,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260544417] [2024-10-12 19:57:20,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260544417] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:57:20,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:57:20,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:57:20,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081165689] [2024-10-12 19:57:20,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:57:20,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:57:20,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:57:20,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:57:20,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:57:20,729 INFO L87 Difference]: Start difference. First operand 9137 states and 13758 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:57:22,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:57:22,019 INFO L93 Difference]: Finished difference Result 19756 states and 30386 transitions. [2024-10-12 19:57:22,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 19:57:22,020 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 81 [2024-10-12 19:57:22,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:57:22,079 INFO L225 Difference]: With dead ends: 19756 [2024-10-12 19:57:22,080 INFO L226 Difference]: Without dead ends: 10630 [2024-10-12 19:57:22,113 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-12 19:57:22,114 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 214 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 19:57:22,114 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 506 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 19:57:22,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10630 states. [2024-10-12 19:57:22,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10630 to 9205. [2024-10-12 19:57:22,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9205 states, 8069 states have (on average 1.4737885735531044) internal successors, (11892), 8134 states have internal predecessors, (11892), 667 states have call successors, (667), 400 states have call predecessors, (667), 468 states have return successors, (1233), 686 states have call predecessors, (1233), 667 states have call successors, (1233) [2024-10-12 19:57:22,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9205 states to 9205 states and 13792 transitions. [2024-10-12 19:57:22,986 INFO L78 Accepts]: Start accepts. Automaton has 9205 states and 13792 transitions. Word has length 81 [2024-10-12 19:57:22,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:57:22,987 INFO L471 AbstractCegarLoop]: Abstraction has 9205 states and 13792 transitions. [2024-10-12 19:57:22,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:57:22,988 INFO L276 IsEmpty]: Start isEmpty. Operand 9205 states and 13792 transitions. [2024-10-12 19:57:22,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-12 19:57:22,991 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:57:22,991 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:57:22,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 19:57:22,992 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:57:22,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:57:22,992 INFO L85 PathProgramCache]: Analyzing trace with hash 17884444, now seen corresponding path program 1 times [2024-10-12 19:57:22,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:57:22,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360729618] [2024-10-12 19:57:22,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:57:22,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:57:23,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:23,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:57:23,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:23,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 19:57:23,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:23,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 19:57:23,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:23,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 19:57:23,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:23,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-12 19:57:23,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:23,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:57:23,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:57:23,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360729618] [2024-10-12 19:57:23,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360729618] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:57:23,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:57:23,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:57:23,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960959667] [2024-10-12 19:57:23,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:57:23,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:57:23,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:57:23,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:57:23,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:57:23,176 INFO L87 Difference]: Start difference. First operand 9205 states and 13792 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:57:26,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:57:26,145 INFO L93 Difference]: Finished difference Result 30031 states and 45482 transitions. [2024-10-12 19:57:26,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-12 19:57:26,146 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 81 [2024-10-12 19:57:26,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:57:26,254 INFO L225 Difference]: With dead ends: 30031 [2024-10-12 19:57:26,254 INFO L226 Difference]: Without dead ends: 20837 [2024-10-12 19:57:26,290 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2024-10-12 19:57:26,291 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 1305 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 1418 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1320 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 1581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 1418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:57:26,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1320 Valid, 802 Invalid, 1581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 1418 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 19:57:26,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20837 states. [2024-10-12 19:57:27,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20837 to 17849. [2024-10-12 19:57:27,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17849 states, 15647 states have (on average 1.4687799578193903) internal successors, (22982), 15776 states have internal predecessors, (22982), 1269 states have call successors, (1269), 792 states have call predecessors, (1269), 932 states have return successors, (2506), 1296 states have call predecessors, (2506), 1269 states have call successors, (2506) [2024-10-12 19:57:27,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17849 states to 17849 states and 26757 transitions. [2024-10-12 19:57:27,830 INFO L78 Accepts]: Start accepts. Automaton has 17849 states and 26757 transitions. Word has length 81 [2024-10-12 19:57:27,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:57:27,831 INFO L471 AbstractCegarLoop]: Abstraction has 17849 states and 26757 transitions. [2024-10-12 19:57:27,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:57:27,832 INFO L276 IsEmpty]: Start isEmpty. Operand 17849 states and 26757 transitions. [2024-10-12 19:57:27,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-12 19:57:27,836 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:57:27,836 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:57:27,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 19:57:27,837 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:57:27,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:57:27,837 INFO L85 PathProgramCache]: Analyzing trace with hash -467290275, now seen corresponding path program 1 times [2024-10-12 19:57:27,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:57:27,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546314198] [2024-10-12 19:57:27,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:57:27,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:57:27,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:27,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:57:27,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:27,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 19:57:27,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:27,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 19:57:27,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:27,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 19:57:27,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:27,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-12 19:57:27,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:27,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:57:27,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:57:27,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546314198] [2024-10-12 19:57:27,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546314198] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:57:27,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:57:27,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:57:27,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038628345] [2024-10-12 19:57:27,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:57:27,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:57:27,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:57:27,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:57:27,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:57:27,969 INFO L87 Difference]: Start difference. First operand 17849 states and 26757 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:57:29,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:57:29,797 INFO L93 Difference]: Finished difference Result 38378 states and 58891 transitions. [2024-10-12 19:57:29,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 19:57:29,798 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 81 [2024-10-12 19:57:29,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:57:29,908 INFO L225 Difference]: With dead ends: 38378 [2024-10-12 19:57:29,908 INFO L226 Difference]: Without dead ends: 20540 [2024-10-12 19:57:29,959 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-12 19:57:29,959 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 219 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 19:57:29,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 503 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 648 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 19:57:29,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20540 states. [2024-10-12 19:57:31,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20540 to 17985. [2024-10-12 19:57:31,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17985 states, 15783 states have (on average 1.4604321104986377) internal successors, (23050), 15912 states have internal predecessors, (23050), 1269 states have call successors, (1269), 792 states have call predecessors, (1269), 932 states have return successors, (2506), 1296 states have call predecessors, (2506), 1269 states have call successors, (2506) [2024-10-12 19:57:31,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17985 states to 17985 states and 26825 transitions. [2024-10-12 19:57:31,144 INFO L78 Accepts]: Start accepts. Automaton has 17985 states and 26825 transitions. Word has length 81 [2024-10-12 19:57:31,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:57:31,145 INFO L471 AbstractCegarLoop]: Abstraction has 17985 states and 26825 transitions. [2024-10-12 19:57:31,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:57:31,145 INFO L276 IsEmpty]: Start isEmpty. Operand 17985 states and 26825 transitions. [2024-10-12 19:57:31,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-12 19:57:31,149 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:57:31,149 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:57:31,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 19:57:31,149 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:57:31,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:57:31,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1496649573, now seen corresponding path program 1 times [2024-10-12 19:57:31,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:57:31,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409733818] [2024-10-12 19:57:31,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:57:31,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:57:31,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:31,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:57:31,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:31,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 19:57:31,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:31,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 19:57:31,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:31,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 19:57:31,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:31,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-12 19:57:31,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:31,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:57:31,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:57:31,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409733818] [2024-10-12 19:57:31,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409733818] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:57:31,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:57:31,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 19:57:31,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496783884] [2024-10-12 19:57:31,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:57:31,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 19:57:31,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:57:31,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 19:57:31,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:57:31,455 INFO L87 Difference]: Start difference. First operand 17985 states and 26825 transitions. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 6 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:57:34,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:57:34,570 INFO L93 Difference]: Finished difference Result 25818 states and 38866 transitions. [2024-10-12 19:57:34,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-12 19:57:34,570 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 6 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 81 [2024-10-12 19:57:34,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:57:34,641 INFO L225 Difference]: With dead ends: 25818 [2024-10-12 19:57:34,642 INFO L226 Difference]: Without dead ends: 16037 [2024-10-12 19:57:34,664 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2024-10-12 19:57:34,664 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 852 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 1313 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 863 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 1389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 1313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:57:34,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [863 Valid, 661 Invalid, 1389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 1313 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-12 19:57:34,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16037 states. [2024-10-12 19:57:35,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16037 to 10412. [2024-10-12 19:57:35,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10412 states, 9111 states have (on average 1.446163977609483) internal successors, (13176), 9176 states have internal predecessors, (13176), 762 states have call successors, (762), 468 states have call predecessors, (762), 538 states have return successors, (1334), 775 states have call predecessors, (1334), 762 states have call successors, (1334) [2024-10-12 19:57:35,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10412 states to 10412 states and 15272 transitions. [2024-10-12 19:57:35,454 INFO L78 Accepts]: Start accepts. Automaton has 10412 states and 15272 transitions. Word has length 81 [2024-10-12 19:57:35,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:57:35,455 INFO L471 AbstractCegarLoop]: Abstraction has 10412 states and 15272 transitions. [2024-10-12 19:57:35,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 6 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:57:35,455 INFO L276 IsEmpty]: Start isEmpty. Operand 10412 states and 15272 transitions. [2024-10-12 19:57:35,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-12 19:57:35,457 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:57:35,457 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:57:35,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 19:57:35,458 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:57:35,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:57:35,458 INFO L85 PathProgramCache]: Analyzing trace with hash -2006122663, now seen corresponding path program 1 times [2024-10-12 19:57:35,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:57:35,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552722999] [2024-10-12 19:57:35,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:57:35,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:57:35,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:35,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:57:35,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:35,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 19:57:35,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:35,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 19:57:35,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:35,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 19:57:35,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:35,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-12 19:57:35,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:35,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:57:35,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:57:35,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552722999] [2024-10-12 19:57:35,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552722999] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:57:35,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:57:35,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 19:57:35,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901776929] [2024-10-12 19:57:35,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:57:35,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 19:57:35,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:57:35,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 19:57:35,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:57:35,632 INFO L87 Difference]: Start difference. First operand 10412 states and 15272 transitions. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 6 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:57:37,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:57:37,598 INFO L93 Difference]: Finished difference Result 16235 states and 24253 transitions. [2024-10-12 19:57:37,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-12 19:57:37,599 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 6 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 81 [2024-10-12 19:57:37,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:57:37,653 INFO L225 Difference]: With dead ends: 16235 [2024-10-12 19:57:37,653 INFO L226 Difference]: Without dead ends: 9843 [2024-10-12 19:57:37,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2024-10-12 19:57:37,673 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 843 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 1306 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 854 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 1382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 1306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 19:57:37,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [854 Valid, 661 Invalid, 1382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 1306 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 19:57:37,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9843 states. [2024-10-12 19:57:38,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9843 to 6228. [2024-10-12 19:57:38,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6228 states, 5442 states have (on average 1.444138184490996) internal successors, (7859), 5475 states have internal predecessors, (7859), 468 states have call successors, (468), 282 states have call predecessors, (468), 317 states have return successors, (763), 474 states have call predecessors, (763), 468 states have call successors, (763) [2024-10-12 19:57:38,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6228 states to 6228 states and 9090 transitions. [2024-10-12 19:57:38,237 INFO L78 Accepts]: Start accepts. Automaton has 6228 states and 9090 transitions. Word has length 81 [2024-10-12 19:57:38,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:57:38,237 INFO L471 AbstractCegarLoop]: Abstraction has 6228 states and 9090 transitions. [2024-10-12 19:57:38,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 6 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:57:38,238 INFO L276 IsEmpty]: Start isEmpty. Operand 6228 states and 9090 transitions. [2024-10-12 19:57:38,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-12 19:57:38,239 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:57:38,239 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:57:38,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 19:57:38,239 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:57:38,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:57:38,240 INFO L85 PathProgramCache]: Analyzing trace with hash -82894629, now seen corresponding path program 1 times [2024-10-12 19:57:38,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:57:38,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135358712] [2024-10-12 19:57:38,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:57:38,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:57:38,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:38,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:57:38,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:38,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 19:57:38,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:38,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 19:57:38,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:38,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 19:57:38,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:38,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-12 19:57:38,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:38,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:57:38,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:57:38,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135358712] [2024-10-12 19:57:38,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135358712] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:57:38,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:57:38,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:57:38,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179140023] [2024-10-12 19:57:38,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:57:38,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:57:38,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:57:38,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:57:38,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:57:38,374 INFO L87 Difference]: Start difference. First operand 6228 states and 9090 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:57:39,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:57:39,516 INFO L93 Difference]: Finished difference Result 13623 states and 20184 transitions. [2024-10-12 19:57:39,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 19:57:39,517 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 81 [2024-10-12 19:57:39,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:57:39,562 INFO L225 Difference]: With dead ends: 13623 [2024-10-12 19:57:39,562 INFO L226 Difference]: Without dead ends: 7407 [2024-10-12 19:57:39,582 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:57:39,583 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 610 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 622 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 19:57:39,583 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [622 Valid, 367 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 19:57:39,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7407 states. [2024-10-12 19:57:40,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7407 to 6228. [2024-10-12 19:57:40,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6228 states, 5442 states have (on average 1.426497611172363) internal successors, (7763), 5475 states have internal predecessors, (7763), 468 states have call successors, (468), 282 states have call predecessors, (468), 317 states have return successors, (763), 474 states have call predecessors, (763), 468 states have call successors, (763) [2024-10-12 19:57:40,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6228 states to 6228 states and 8994 transitions. [2024-10-12 19:57:40,421 INFO L78 Accepts]: Start accepts. Automaton has 6228 states and 8994 transitions. Word has length 81 [2024-10-12 19:57:40,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:57:40,422 INFO L471 AbstractCegarLoop]: Abstraction has 6228 states and 8994 transitions. [2024-10-12 19:57:40,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:57:40,422 INFO L276 IsEmpty]: Start isEmpty. Operand 6228 states and 8994 transitions. [2024-10-12 19:57:40,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-12 19:57:40,423 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:57:40,424 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:57:40,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 19:57:40,424 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:57:40,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:57:40,424 INFO L85 PathProgramCache]: Analyzing trace with hash 57653981, now seen corresponding path program 1 times [2024-10-12 19:57:40,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:57:40,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772889118] [2024-10-12 19:57:40,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:57:40,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:57:40,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:40,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:57:40,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:40,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 19:57:40,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:40,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 19:57:40,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:40,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 19:57:40,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:40,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-12 19:57:40,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:40,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:57:40,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:57:40,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772889118] [2024-10-12 19:57:40,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772889118] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:57:40,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:57:40,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 19:57:40,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037444125] [2024-10-12 19:57:40,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:57:40,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 19:57:40,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:57:40,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 19:57:40,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:57:40,622 INFO L87 Difference]: Start difference. First operand 6228 states and 8994 transitions. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 6 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:57:42,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:57:42,590 INFO L93 Difference]: Finished difference Result 15550 states and 22912 transitions. [2024-10-12 19:57:42,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-12 19:57:42,591 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 6 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 81 [2024-10-12 19:57:42,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:57:42,637 INFO L225 Difference]: With dead ends: 15550 [2024-10-12 19:57:42,637 INFO L226 Difference]: Without dead ends: 10041 [2024-10-12 19:57:42,654 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2024-10-12 19:57:42,655 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 1057 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 1343 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1066 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 19:57:42,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1066 Valid, 587 Invalid, 1442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1343 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 19:57:42,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10041 states. [2024-10-12 19:57:43,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10041 to 6184. [2024-10-12 19:57:43,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6184 states, 5406 states have (on average 1.4193488716241214) internal successors, (7673), 5431 states have internal predecessors, (7673), 468 states have call successors, (468), 282 states have call predecessors, (468), 309 states have return successors, (729), 472 states have call predecessors, (729), 468 states have call successors, (729) [2024-10-12 19:57:43,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6184 states to 6184 states and 8870 transitions. [2024-10-12 19:57:43,192 INFO L78 Accepts]: Start accepts. Automaton has 6184 states and 8870 transitions. Word has length 81 [2024-10-12 19:57:43,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:57:43,193 INFO L471 AbstractCegarLoop]: Abstraction has 6184 states and 8870 transitions. [2024-10-12 19:57:43,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 6 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:57:43,193 INFO L276 IsEmpty]: Start isEmpty. Operand 6184 states and 8870 transitions. [2024-10-12 19:57:43,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-12 19:57:43,194 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:57:43,194 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:57:43,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 19:57:43,194 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:57:43,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:57:43,195 INFO L85 PathProgramCache]: Analyzing trace with hash -76359525, now seen corresponding path program 1 times [2024-10-12 19:57:43,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:57:43,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312375018] [2024-10-12 19:57:43,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:57:43,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:57:43,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:43,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:57:43,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:43,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 19:57:43,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:43,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 19:57:43,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:43,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 19:57:43,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:43,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-12 19:57:43,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:43,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:57:43,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:57:43,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312375018] [2024-10-12 19:57:43,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312375018] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:57:43,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:57:43,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:57:43,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155150456] [2024-10-12 19:57:43,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:57:43,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:57:43,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:57:43,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:57:43,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:57:43,319 INFO L87 Difference]: Start difference. First operand 6184 states and 8870 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:57:44,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:57:44,513 INFO L93 Difference]: Finished difference Result 14757 states and 21516 transitions. [2024-10-12 19:57:44,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 19:57:44,514 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 81 [2024-10-12 19:57:44,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:57:44,555 INFO L225 Difference]: With dead ends: 14757 [2024-10-12 19:57:44,555 INFO L226 Difference]: Without dead ends: 8585 [2024-10-12 19:57:44,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-10-12 19:57:44,576 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 697 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 708 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 19:57:44,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [708 Valid, 444 Invalid, 726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 665 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 19:57:44,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8585 states. [2024-10-12 19:57:45,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8585 to 6432. [2024-10-12 19:57:45,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6432 states, 5636 states have (on average 1.3947835344215755) internal successors, (7861), 5661 states have internal predecessors, (7861), 474 states have call successors, (474), 294 states have call predecessors, (474), 321 states have return successors, (747), 478 states have call predecessors, (747), 474 states have call successors, (747) [2024-10-12 19:57:45,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6432 states to 6432 states and 9082 transitions. [2024-10-12 19:57:45,254 INFO L78 Accepts]: Start accepts. Automaton has 6432 states and 9082 transitions. Word has length 81 [2024-10-12 19:57:45,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:57:45,254 INFO L471 AbstractCegarLoop]: Abstraction has 6432 states and 9082 transitions. [2024-10-12 19:57:45,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:57:45,255 INFO L276 IsEmpty]: Start isEmpty. Operand 6432 states and 9082 transitions. [2024-10-12 19:57:45,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-12 19:57:45,256 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:57:45,256 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:57:45,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-12 19:57:45,256 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:57:45,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:57:45,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1881797859, now seen corresponding path program 1 times [2024-10-12 19:57:45,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:57:45,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856350275] [2024-10-12 19:57:45,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:57:45,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:57:45,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:45,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:57:45,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:45,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 19:57:45,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:45,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 19:57:45,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:45,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 19:57:45,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:45,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-12 19:57:45,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:45,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:57:45,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:57:45,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856350275] [2024-10-12 19:57:45,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856350275] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:57:45,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:57:45,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 19:57:45,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410531086] [2024-10-12 19:57:45,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:57:45,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 19:57:45,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:57:45,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 19:57:45,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:57:45,400 INFO L87 Difference]: Start difference. First operand 6432 states and 9082 transitions. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 6 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:57:47,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:57:47,959 INFO L93 Difference]: Finished difference Result 23039 states and 33336 transitions. [2024-10-12 19:57:47,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-12 19:57:47,960 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 6 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 81 [2024-10-12 19:57:47,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:57:48,049 INFO L225 Difference]: With dead ends: 23039 [2024-10-12 19:57:48,049 INFO L226 Difference]: Without dead ends: 16619 [2024-10-12 19:57:48,080 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2024-10-12 19:57:48,081 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 1022 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 1239 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1032 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 1357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 1239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 19:57:48,081 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1032 Valid, 591 Invalid, 1357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 1239 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 19:57:48,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16619 states. [2024-10-12 19:57:49,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16619 to 11074. [2024-10-12 19:57:49,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11074 states, 9762 states have (on average 1.368059823806597) internal successors, (13355), 9835 states have internal predecessors, (13355), 752 states have call successors, (752), 482 states have call predecessors, (752), 559 states have return successors, (1231), 760 states have call predecessors, (1231), 752 states have call successors, (1231) [2024-10-12 19:57:49,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11074 states to 11074 states and 15338 transitions. [2024-10-12 19:57:49,596 INFO L78 Accepts]: Start accepts. Automaton has 11074 states and 15338 transitions. Word has length 81 [2024-10-12 19:57:49,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:57:49,597 INFO L471 AbstractCegarLoop]: Abstraction has 11074 states and 15338 transitions. [2024-10-12 19:57:49,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 6 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:57:49,597 INFO L276 IsEmpty]: Start isEmpty. Operand 11074 states and 15338 transitions. [2024-10-12 19:57:49,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-12 19:57:49,599 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:57:49,599 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:57:49,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-12 19:57:49,600 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:57:49,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:57:49,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1662943141, now seen corresponding path program 1 times [2024-10-12 19:57:49,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:57:49,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758087616] [2024-10-12 19:57:49,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:57:49,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:57:49,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:49,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:57:49,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:49,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 19:57:49,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:49,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 19:57:49,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:49,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 19:57:49,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:49,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-12 19:57:49,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:49,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:57:49,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:57:49,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758087616] [2024-10-12 19:57:49,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758087616] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:57:49,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:57:49,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 19:57:49,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099384401] [2024-10-12 19:57:49,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:57:49,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 19:57:49,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:57:49,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 19:57:49,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:57:49,775 INFO L87 Difference]: Start difference. First operand 11074 states and 15338 transitions. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 6 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:57:52,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:57:52,392 INFO L93 Difference]: Finished difference Result 26397 states and 37943 transitions. [2024-10-12 19:57:52,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-12 19:57:52,392 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 6 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 81 [2024-10-12 19:57:52,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:57:52,457 INFO L225 Difference]: With dead ends: 26397 [2024-10-12 19:57:52,458 INFO L226 Difference]: Without dead ends: 15319 [2024-10-12 19:57:52,491 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2024-10-12 19:57:52,492 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 1073 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 1107 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1082 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 1220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 1107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 19:57:52,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1082 Valid, 580 Invalid, 1220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 1107 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 19:57:52,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15319 states. [2024-10-12 19:57:53,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15319 to 10519. [2024-10-12 19:57:53,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10519 states, 9355 states have (on average 1.3532870122928915) internal successors, (12660), 9392 states have internal predecessors, (12660), 685 states have call successors, (685), 437 states have call predecessors, (685), 478 states have return successors, (1090), 691 states have call predecessors, (1090), 685 states have call successors, (1090) [2024-10-12 19:57:53,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10519 states to 10519 states and 14435 transitions. [2024-10-12 19:57:53,412 INFO L78 Accepts]: Start accepts. Automaton has 10519 states and 14435 transitions. Word has length 81 [2024-10-12 19:57:53,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:57:53,412 INFO L471 AbstractCegarLoop]: Abstraction has 10519 states and 14435 transitions. [2024-10-12 19:57:53,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 6 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:57:53,412 INFO L276 IsEmpty]: Start isEmpty. Operand 10519 states and 14435 transitions. [2024-10-12 19:57:53,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-12 19:57:53,413 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:57:53,413 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:57:53,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-12 19:57:53,414 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:57:53,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:57:53,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1240241315, now seen corresponding path program 1 times [2024-10-12 19:57:53,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:57:53,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16745082] [2024-10-12 19:57:53,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:57:53,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:57:53,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:53,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:57:53,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:53,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 19:57:53,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:53,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 19:57:53,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:53,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 19:57:53,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:53,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-12 19:57:53,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:53,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:57:53,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:57:53,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16745082] [2024-10-12 19:57:53,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16745082] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:57:53,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:57:53,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:57:53,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26924182] [2024-10-12 19:57:53,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:57:53,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:57:53,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:57:53,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:57:53,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:57:53,516 INFO L87 Difference]: Start difference. First operand 10519 states and 14435 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:57:55,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:57:55,810 INFO L93 Difference]: Finished difference Result 34691 states and 48196 transitions. [2024-10-12 19:57:55,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 19:57:55,810 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 81 [2024-10-12 19:57:55,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:57:55,892 INFO L225 Difference]: With dead ends: 34691 [2024-10-12 19:57:55,892 INFO L226 Difference]: Without dead ends: 24186 [2024-10-12 19:57:55,925 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-10-12 19:57:55,926 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 862 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 870 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 19:57:55,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [870 Valid, 504 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 19:57:55,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24186 states. [2024-10-12 19:57:57,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24186 to 20466. [2024-10-12 19:57:57,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20466 states, 18198 states have (on average 1.330915485218156) internal successors, (24220), 18281 states have internal predecessors, (24220), 1306 states have call successors, (1306), 855 states have call predecessors, (1306), 961 states have return successors, (2342), 1333 states have call predecessors, (2342), 1306 states have call successors, (2342) [2024-10-12 19:57:57,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20466 states to 20466 states and 27868 transitions. [2024-10-12 19:57:57,564 INFO L78 Accepts]: Start accepts. Automaton has 20466 states and 27868 transitions. Word has length 81 [2024-10-12 19:57:57,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:57:57,565 INFO L471 AbstractCegarLoop]: Abstraction has 20466 states and 27868 transitions. [2024-10-12 19:57:57,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:57:57,565 INFO L276 IsEmpty]: Start isEmpty. Operand 20466 states and 27868 transitions. [2024-10-12 19:57:57,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-12 19:57:57,567 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:57:57,567 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:57:57,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-12 19:57:57,567 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:57:57,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:57:57,567 INFO L85 PathProgramCache]: Analyzing trace with hash -571553907, now seen corresponding path program 1 times [2024-10-12 19:57:57,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:57:57,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181447253] [2024-10-12 19:57:57,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:57:57,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:57:57,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:57,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:57:57,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:57,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 19:57:57,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:57,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 19:57:57,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:57,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 19:57:57,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:57,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-12 19:57:57,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:57,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:57:57,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:57:57,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181447253] [2024-10-12 19:57:57,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181447253] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:57:57,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:57:57,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 19:57:57,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626881519] [2024-10-12 19:57:57,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:57:57,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 19:57:57,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:57:57,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 19:57:57,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 19:57:57,631 INFO L87 Difference]: Start difference. First operand 20466 states and 27868 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:58:00,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:00,026 INFO L93 Difference]: Finished difference Result 44759 states and 61413 transitions. [2024-10-12 19:58:00,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 19:58:00,027 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 82 [2024-10-12 19:58:00,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:00,099 INFO L225 Difference]: With dead ends: 44759 [2024-10-12 19:58:00,099 INFO L226 Difference]: Without dead ends: 24307 [2024-10-12 19:58:00,131 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:58:00,132 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 508 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 19:58:00,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [529 Valid, 270 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 19:58:00,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24307 states. [2024-10-12 19:58:01,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24307 to 20456. [2024-10-12 19:58:01,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20456 states, 18193 states have (on average 1.3307316000659595) internal successors, (24210), 18275 states have internal predecessors, (24210), 1301 states have call successors, (1301), 855 states have call predecessors, (1301), 961 states have return successors, (2336), 1327 states have call predecessors, (2336), 1301 states have call successors, (2336) [2024-10-12 19:58:01,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20456 states to 20456 states and 27847 transitions. [2024-10-12 19:58:01,726 INFO L78 Accepts]: Start accepts. Automaton has 20456 states and 27847 transitions. Word has length 82 [2024-10-12 19:58:01,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:01,726 INFO L471 AbstractCegarLoop]: Abstraction has 20456 states and 27847 transitions. [2024-10-12 19:58:01,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:58:01,726 INFO L276 IsEmpty]: Start isEmpty. Operand 20456 states and 27847 transitions. [2024-10-12 19:58:01,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-12 19:58:01,727 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:01,727 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:58:01,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-12 19:58:01,727 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:01,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:01,728 INFO L85 PathProgramCache]: Analyzing trace with hash -959801141, now seen corresponding path program 1 times [2024-10-12 19:58:01,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:01,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620413326] [2024-10-12 19:58:01,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:01,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:01,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:01,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:58:01,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:01,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 19:58:01,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:01,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 19:58:01,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:01,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 19:58:01,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:01,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-12 19:58:01,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:01,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:58:01,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:01,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620413326] [2024-10-12 19:58:01,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620413326] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:58:01,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:58:01,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:58:01,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177170298] [2024-10-12 19:58:01,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:01,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:58:01,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:01,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:58:01,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:58:01,825 INFO L87 Difference]: Start difference. First operand 20456 states and 27847 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:58:06,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:06,238 INFO L93 Difference]: Finished difference Result 66733 states and 91958 transitions. [2024-10-12 19:58:06,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 19:58:06,239 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 83 [2024-10-12 19:58:06,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:06,355 INFO L225 Difference]: With dead ends: 66733 [2024-10-12 19:58:06,355 INFO L226 Difference]: Without dead ends: 46291 [2024-10-12 19:58:06,384 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-10-12 19:58:06,384 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 662 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 735 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 670 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 19:58:06,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [670 Valid, 655 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 735 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 19:58:06,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46291 states. [2024-10-12 19:58:09,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46291 to 39546. [2024-10-12 19:58:09,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39546 states, 35065 states have (on average 1.3190075573934121) internal successors, (46251), 35249 states have internal predecessors, (46251), 2561 states have call successors, (2561), 1670 states have call predecessors, (2561), 1919 states have return successors, (4842), 2630 states have call predecessors, (4842), 2561 states have call successors, (4842) [2024-10-12 19:58:09,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39546 states to 39546 states and 53654 transitions. [2024-10-12 19:58:09,932 INFO L78 Accepts]: Start accepts. Automaton has 39546 states and 53654 transitions. Word has length 83 [2024-10-12 19:58:09,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:09,933 INFO L471 AbstractCegarLoop]: Abstraction has 39546 states and 53654 transitions. [2024-10-12 19:58:09,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:58:09,933 INFO L276 IsEmpty]: Start isEmpty. Operand 39546 states and 53654 transitions. [2024-10-12 19:58:09,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-12 19:58:09,935 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:09,935 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:58:09,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-12 19:58:09,935 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:09,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:09,936 INFO L85 PathProgramCache]: Analyzing trace with hash -932735539, now seen corresponding path program 1 times [2024-10-12 19:58:09,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:09,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039028754] [2024-10-12 19:58:09,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:09,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:09,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:09,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:58:09,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:09,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 19:58:09,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:09,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 19:58:09,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:09,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 19:58:09,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:09,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-12 19:58:09,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:09,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:58:09,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:09,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039028754] [2024-10-12 19:58:09,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039028754] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:58:09,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:58:09,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 19:58:09,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206955282] [2024-10-12 19:58:09,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:09,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 19:58:09,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:09,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 19:58:09,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 19:58:09,999 INFO L87 Difference]: Start difference. First operand 39546 states and 53654 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)