./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.05.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 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.05.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 d8722862ca37b1ee13dec8b9e420cd40ba7901837b8f3b6258499da6e8a2ca6f --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 03:24:59,491 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 03:24:59,560 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 03:24:59,565 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 03:24:59,567 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 03:24:59,599 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 03:24:59,600 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 03:24:59,600 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 03:24:59,601 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 03:24:59,602 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 03:24:59,602 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 03:24:59,603 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 03:24:59,603 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 03:24:59,604 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 03:24:59,606 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 03:24:59,606 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 03:24:59,607 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 03:24:59,607 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 03:24:59,607 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 03:24:59,607 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 03:24:59,608 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 03:24:59,612 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 03:24:59,612 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 03:24:59,612 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 03:24:59,612 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 03:24:59,613 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 03:24:59,613 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 03:24:59,613 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 03:24:59,613 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 03:24:59,614 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 03:24:59,614 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 03:24:59,615 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 03:24:59,615 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:24:59,615 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 03:24:59,616 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 03:24:59,616 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 03:24:59,616 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 03:24:59,616 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 03:24:59,617 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 03:24:59,617 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 03:24:59,617 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 03:24:59,617 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 03:24:59,617 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 -> d8722862ca37b1ee13dec8b9e420cd40ba7901837b8f3b6258499da6e8a2ca6f [2024-10-14 03:24:59,904 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 03:24:59,928 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 03:24:59,932 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 03:24:59,933 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 03:24:59,933 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 03:24:59,935 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.05.cil.c [2024-10-14 03:25:01,360 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 03:25:01,578 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 03:25:01,579 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.05.cil.c [2024-10-14 03:25:01,591 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/148f2ea51/c56abc7c94e943a9b5c402b99d1323a7/FLAGc2922269b [2024-10-14 03:25:01,609 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/148f2ea51/c56abc7c94e943a9b5c402b99d1323a7 [2024-10-14 03:25:01,613 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 03:25:01,614 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 03:25:01,617 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 03:25:01,617 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 03:25:01,622 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 03:25:01,623 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:25:01" (1/1) ... [2024-10-14 03:25:01,625 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@768d65b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:25:01, skipping insertion in model container [2024-10-14 03:25:01,626 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:25:01" (1/1) ... [2024-10-14 03:25:01,669 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 03:25:01,823 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.05.cil.c[706,719] [2024-10-14 03:25:01,898 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:25:01,913 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 03:25:01,926 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.05.cil.c[706,719] [2024-10-14 03:25:01,971 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:25:01,995 INFO L204 MainTranslator]: Completed translation [2024-10-14 03:25:01,996 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:25:01 WrapperNode [2024-10-14 03:25:01,996 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 03:25:01,997 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 03:25:01,998 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 03:25:01,999 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 03:25:02,006 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:25:01" (1/1) ... [2024-10-14 03:25:02,017 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:25:01" (1/1) ... [2024-10-14 03:25:02,056 INFO L138 Inliner]: procedures = 38, calls = 45, calls flagged for inlining = 22, calls inlined = 22, statements flattened = 446 [2024-10-14 03:25:02,060 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 03:25:02,061 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 03:25:02,061 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 03:25:02,062 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 03:25:02,081 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:25:01" (1/1) ... [2024-10-14 03:25:02,081 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:25:01" (1/1) ... [2024-10-14 03:25:02,084 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:25:01" (1/1) ... [2024-10-14 03:25:02,114 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-14 03:25:02,115 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:25:01" (1/1) ... [2024-10-14 03:25:02,115 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:25:01" (1/1) ... [2024-10-14 03:25:02,128 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:25:01" (1/1) ... [2024-10-14 03:25:02,143 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:25:01" (1/1) ... [2024-10-14 03:25:02,145 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:25:01" (1/1) ... [2024-10-14 03:25:02,148 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:25:01" (1/1) ... [2024-10-14 03:25:02,155 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 03:25:02,158 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 03:25:02,159 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 03:25:02,159 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 03:25:02,160 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:25:01" (1/1) ... [2024-10-14 03:25:02,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:25:02,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:25:02,196 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-14 03:25:02,199 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-14 03:25:02,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 03:25:02,242 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-14 03:25:02,242 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-14 03:25:02,243 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-14 03:25:02,243 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-14 03:25:02,243 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-14 03:25:02,243 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-14 03:25:02,243 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-14 03:25:02,243 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-14 03:25:02,243 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-14 03:25:02,243 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-14 03:25:02,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 03:25:02,244 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-14 03:25:02,244 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-14 03:25:02,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 03:25:02,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 03:25:02,335 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 03:25:02,337 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 03:25:02,863 INFO L? ?]: Removed 55 outVars from TransFormulas that were not future-live. [2024-10-14 03:25:02,863 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 03:25:02,921 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 03:25:02,922 INFO L314 CfgBuilder]: Removed 9 assume(true) statements. [2024-10-14 03:25:02,922 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:25:02 BoogieIcfgContainer [2024-10-14 03:25:02,922 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 03:25:02,924 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 03:25:02,925 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 03:25:02,928 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 03:25:02,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 03:25:01" (1/3) ... [2024-10-14 03:25:02,930 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@719461c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:25:02, skipping insertion in model container [2024-10-14 03:25:02,930 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:25:01" (2/3) ... [2024-10-14 03:25:02,930 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@719461c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:25:02, skipping insertion in model container [2024-10-14 03:25:02,930 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:25:02" (3/3) ... [2024-10-14 03:25:02,931 INFO L112 eAbstractionObserver]: Analyzing ICFG transmitter.05.cil.c [2024-10-14 03:25:02,949 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 03:25:02,950 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 03:25:03,019 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 03:25:03,026 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;@439c5b93, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 03:25:03,026 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 03:25:03,031 INFO L276 IsEmpty]: Start isEmpty. Operand has 182 states, 156 states have (on average 1.705128205128205) internal successors, (266), 158 states have internal predecessors, (266), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-14 03:25:03,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-14 03:25:03,045 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:25:03,047 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:25:03,047 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:25:03,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:25:03,053 INFO L85 PathProgramCache]: Analyzing trace with hash 388603747, now seen corresponding path program 1 times [2024-10-14 03:25:03,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:25:03,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488539224] [2024-10-14 03:25:03,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:25:03,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:25:03,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:03,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:25:03,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:03,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 03:25:03,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:03,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 03:25:03,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:03,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 03:25:03,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:03,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 03:25:03,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:03,568 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-14 03:25:03,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:25:03,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488539224] [2024-10-14 03:25:03,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488539224] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:25:03,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:25:03,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:25:03,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789355954] [2024-10-14 03:25:03,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:25:03,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:25:03,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:25:03,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:25:03,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:25:03,619 INFO L87 Difference]: Start difference. First operand has 182 states, 156 states have (on average 1.705128205128205) internal successors, (266), 158 states have internal predecessors, (266), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 3 states have internal predecessors, (82), 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-14 03:25:04,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:25:04,626 INFO L93 Difference]: Finished difference Result 418 states and 700 transitions. [2024-10-14 03:25:04,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 03:25:04,630 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 3 states have internal predecessors, (82), 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 92 [2024-10-14 03:25:04,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:25:04,640 INFO L225 Difference]: With dead ends: 418 [2024-10-14 03:25:04,641 INFO L226 Difference]: Without dead ends: 238 [2024-10-14 03:25:04,646 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:25:04,649 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 467 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 03:25:04,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 324 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 03:25:04,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-10-14 03:25:04,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 180. [2024-10-14 03:25:04,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 155 states have (on average 1.5741935483870968) internal successors, (244), 156 states have internal predecessors, (244), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-14 03:25:04,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 280 transitions. [2024-10-14 03:25:04,732 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 280 transitions. Word has length 92 [2024-10-14 03:25:04,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:25:04,733 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 280 transitions. [2024-10-14 03:25:04,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 3 states have internal predecessors, (82), 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-14 03:25:04,736 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 280 transitions. [2024-10-14 03:25:04,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-14 03:25:04,742 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:25:04,742 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:25:04,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 03:25:04,742 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:25:04,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:25:04,743 INFO L85 PathProgramCache]: Analyzing trace with hash 974879969, now seen corresponding path program 1 times [2024-10-14 03:25:04,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:25:04,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524321471] [2024-10-14 03:25:04,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:25:04,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:25:04,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:04,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:25:04,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:04,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 03:25:04,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:05,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 03:25:05,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:05,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 03:25:05,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:05,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 03:25:05,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:05,077 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-14 03:25:05,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:25:05,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524321471] [2024-10-14 03:25:05,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524321471] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:25:05,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:25:05,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:25:05,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39065371] [2024-10-14 03:25:05,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:25:05,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:25:05,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:25:05,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:25:05,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:25:05,084 INFO L87 Difference]: Start difference. First operand 180 states and 280 transitions. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 4 states have internal predecessors, (82), 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-14 03:25:06,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:25:06,413 INFO L93 Difference]: Finished difference Result 638 states and 1024 transitions. [2024-10-14 03:25:06,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 03:25:06,413 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 4 states have internal predecessors, (82), 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 92 [2024-10-14 03:25:06,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:25:06,418 INFO L225 Difference]: With dead ends: 638 [2024-10-14 03:25:06,419 INFO L226 Difference]: Without dead ends: 469 [2024-10-14 03:25:06,421 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-14 03:25:06,422 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 687 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 1067 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 698 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 1144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1067 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:25:06,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [698 Valid, 538 Invalid, 1144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1067 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-14 03:25:06,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2024-10-14 03:25:06,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 354. [2024-10-14 03:25:06,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 309 states have (on average 1.5792880258899675) internal successors, (488), 311 states have internal predecessors, (488), 31 states have call successors, (31), 12 states have call predecessors, (31), 13 states have return successors, (34), 31 states have call predecessors, (34), 31 states have call successors, (34) [2024-10-14 03:25:06,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 553 transitions. [2024-10-14 03:25:06,471 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 553 transitions. Word has length 92 [2024-10-14 03:25:06,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:25:06,472 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 553 transitions. [2024-10-14 03:25:06,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 4 states have internal predecessors, (82), 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-14 03:25:06,473 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 553 transitions. [2024-10-14 03:25:06,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-14 03:25:06,479 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:25:06,479 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:25:06,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 03:25:06,479 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:25:06,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:25:06,480 INFO L85 PathProgramCache]: Analyzing trace with hash -2100169280, now seen corresponding path program 1 times [2024-10-14 03:25:06,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:25:06,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318435778] [2024-10-14 03:25:06,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:25:06,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:25:06,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:06,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:25:06,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:06,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 03:25:06,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:06,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 03:25:06,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:06,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 03:25:06,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:06,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 03:25:06,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:06,739 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-14 03:25:06,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:25:06,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318435778] [2024-10-14 03:25:06,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318435778] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:25:06,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:25:06,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:25:06,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659642292] [2024-10-14 03:25:06,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:25:06,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:25:06,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:25:06,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:25:06,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:25:06,746 INFO L87 Difference]: Start difference. First operand 354 states and 553 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 5 states have internal predecessors, (82), 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-14 03:25:08,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:25:08,845 INFO L93 Difference]: Finished difference Result 1118 states and 1773 transitions. [2024-10-14 03:25:08,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 03:25:08,846 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 5 states have internal predecessors, (82), 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 92 [2024-10-14 03:25:08,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:25:08,852 INFO L225 Difference]: With dead ends: 1118 [2024-10-14 03:25:08,852 INFO L226 Difference]: Without dead ends: 775 [2024-10-14 03:25:08,854 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-14 03:25:08,855 INFO L432 NwaCegarLoop]: 253 mSDtfsCounter, 740 mSDsluCounter, 766 mSDsCounter, 0 mSdLazyCounter, 2157 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 1019 SdHoareTripleChecker+Invalid, 2204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 2157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-14 03:25:08,855 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [751 Valid, 1019 Invalid, 2204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 2157 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-14 03:25:08,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2024-10-14 03:25:08,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 516. [2024-10-14 03:25:08,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 451 states have (on average 1.5698447893569845) internal successors, (708), 454 states have internal predecessors, (708), 44 states have call successors, (44), 18 states have call predecessors, (44), 20 states have return successors, (49), 45 states have call predecessors, (49), 44 states have call successors, (49) [2024-10-14 03:25:08,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 801 transitions. [2024-10-14 03:25:08,911 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 801 transitions. Word has length 92 [2024-10-14 03:25:08,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:25:08,912 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 801 transitions. [2024-10-14 03:25:08,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 5 states have internal predecessors, (82), 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-14 03:25:08,912 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 801 transitions. [2024-10-14 03:25:08,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-14 03:25:08,914 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:25:08,914 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:25:08,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 03:25:08,915 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:25:08,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:25:08,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1261135618, now seen corresponding path program 1 times [2024-10-14 03:25:08,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:25:08,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149716907] [2024-10-14 03:25:08,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:25:08,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:25:08,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:09,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:25:09,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:09,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 03:25:09,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:09,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 03:25:09,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:09,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 03:25:09,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:09,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 03:25:09,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:09,133 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-14 03:25:09,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:25:09,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149716907] [2024-10-14 03:25:09,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149716907] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:25:09,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:25:09,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:25:09,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951944050] [2024-10-14 03:25:09,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:25:09,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:25:09,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:25:09,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:25:09,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:25:09,138 INFO L87 Difference]: Start difference. First operand 516 states and 801 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 5 states have internal predecessors, (82), 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-14 03:25:11,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:25:11,010 INFO L93 Difference]: Finished difference Result 1720 states and 2717 transitions. [2024-10-14 03:25:11,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 03:25:11,011 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 5 states have internal predecessors, (82), 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 92 [2024-10-14 03:25:11,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:25:11,022 INFO L225 Difference]: With dead ends: 1720 [2024-10-14 03:25:11,022 INFO L226 Difference]: Without dead ends: 1215 [2024-10-14 03:25:11,025 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-14 03:25:11,026 INFO L432 NwaCegarLoop]: 251 mSDtfsCounter, 738 mSDsluCounter, 766 mSDsCounter, 0 mSdLazyCounter, 2153 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 749 SdHoareTripleChecker+Valid, 1017 SdHoareTripleChecker+Invalid, 2202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 2153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-14 03:25:11,029 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [749 Valid, 1017 Invalid, 2202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 2153 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-14 03:25:11,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states. [2024-10-14 03:25:11,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 841. [2024-10-14 03:25:11,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 736 states have (on average 1.5611413043478262) internal successors, (1149), 741 states have internal predecessors, (1149), 70 states have call successors, (70), 30 states have call predecessors, (70), 34 states have return successors, (83), 73 states have call predecessors, (83), 70 states have call successors, (83) [2024-10-14 03:25:11,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1302 transitions. [2024-10-14 03:25:11,145 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1302 transitions. Word has length 92 [2024-10-14 03:25:11,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:25:11,146 INFO L471 AbstractCegarLoop]: Abstraction has 841 states and 1302 transitions. [2024-10-14 03:25:11,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 5 states have internal predecessors, (82), 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-14 03:25:11,146 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1302 transitions. [2024-10-14 03:25:11,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-14 03:25:11,149 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:25:11,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:25:11,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 03:25:11,149 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:25:11,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:25:11,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1234070016, now seen corresponding path program 1 times [2024-10-14 03:25:11,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:25:11,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931369033] [2024-10-14 03:25:11,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:25:11,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:25:11,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:11,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:25:11,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:11,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 03:25:11,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:11,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 03:25:11,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:11,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 03:25:11,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:11,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 03:25:11,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:11,313 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-14 03:25:11,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:25:11,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931369033] [2024-10-14 03:25:11,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931369033] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:25:11,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:25:11,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:25:11,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080188461] [2024-10-14 03:25:11,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:25:11,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:25:11,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:25:11,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:25:11,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:25:11,320 INFO L87 Difference]: Start difference. First operand 841 states and 1302 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 5 states have internal predecessors, (82), 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-14 03:25:12,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:25:12,188 INFO L93 Difference]: Finished difference Result 1965 states and 3098 transitions. [2024-10-14 03:25:12,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 03:25:12,189 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 5 states have internal predecessors, (82), 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 92 [2024-10-14 03:25:12,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:25:12,195 INFO L225 Difference]: With dead ends: 1965 [2024-10-14 03:25:12,196 INFO L226 Difference]: Without dead ends: 1135 [2024-10-14 03:25:12,199 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-14 03:25:12,202 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 513 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 03:25:12,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 509 Invalid, 927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 878 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 03:25:12,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1135 states. [2024-10-14 03:25:12,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1135 to 841. [2024-10-14 03:25:12,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 736 states have (on average 1.5543478260869565) internal successors, (1144), 741 states have internal predecessors, (1144), 70 states have call successors, (70), 30 states have call predecessors, (70), 34 states have return successors, (83), 73 states have call predecessors, (83), 70 states have call successors, (83) [2024-10-14 03:25:12,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1297 transitions. [2024-10-14 03:25:12,269 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1297 transitions. Word has length 92 [2024-10-14 03:25:12,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:25:12,269 INFO L471 AbstractCegarLoop]: Abstraction has 841 states and 1297 transitions. [2024-10-14 03:25:12,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 5 states have internal predecessors, (82), 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-14 03:25:12,269 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1297 transitions. [2024-10-14 03:25:12,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-14 03:25:12,271 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:25:12,271 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:25:12,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 03:25:12,271 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:25:12,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:25:12,272 INFO L85 PathProgramCache]: Analyzing trace with hash 983560382, now seen corresponding path program 1 times [2024-10-14 03:25:12,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:25:12,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730280624] [2024-10-14 03:25:12,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:25:12,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:25:12,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:12,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:25:12,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:12,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 03:25:12,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:12,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 03:25:12,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:12,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 03:25:12,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:12,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 03:25:12,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:12,419 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-14 03:25:12,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:25:12,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730280624] [2024-10-14 03:25:12,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730280624] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:25:12,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:25:12,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:25:12,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200557269] [2024-10-14 03:25:12,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:25:12,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:25:12,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:25:12,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:25:12,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:25:12,423 INFO L87 Difference]: Start difference. First operand 841 states and 1297 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 5 states have internal predecessors, (82), 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-14 03:25:13,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:25:13,347 INFO L93 Difference]: Finished difference Result 1959 states and 3072 transitions. [2024-10-14 03:25:13,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 03:25:13,348 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 5 states have internal predecessors, (82), 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 92 [2024-10-14 03:25:13,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:25:13,354 INFO L225 Difference]: With dead ends: 1959 [2024-10-14 03:25:13,354 INFO L226 Difference]: Without dead ends: 1129 [2024-10-14 03:25:13,356 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-14 03:25:13,357 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 516 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 857 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 528 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 03:25:13,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [528 Valid, 509 Invalid, 906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 857 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 03:25:13,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2024-10-14 03:25:13,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 841. [2024-10-14 03:25:13,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 736 states have (on average 1.547554347826087) internal successors, (1139), 741 states have internal predecessors, (1139), 70 states have call successors, (70), 30 states have call predecessors, (70), 34 states have return successors, (83), 73 states have call predecessors, (83), 70 states have call successors, (83) [2024-10-14 03:25:13,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1292 transitions. [2024-10-14 03:25:13,422 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1292 transitions. Word has length 92 [2024-10-14 03:25:13,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:25:13,422 INFO L471 AbstractCegarLoop]: Abstraction has 841 states and 1292 transitions. [2024-10-14 03:25:13,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 5 states have internal predecessors, (82), 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-14 03:25:13,423 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1292 transitions. [2024-10-14 03:25:13,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-14 03:25:13,424 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:25:13,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:25:13,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 03:25:13,425 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:25:13,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:25:13,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1577302464, now seen corresponding path program 1 times [2024-10-14 03:25:13,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:25:13,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248776852] [2024-10-14 03:25:13,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:25:13,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:25:13,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:13,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:25:13,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:13,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 03:25:13,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:13,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 03:25:13,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:13,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 03:25:13,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:13,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 03:25:13,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:13,591 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-14 03:25:13,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:25:13,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248776852] [2024-10-14 03:25:13,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248776852] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:25:13,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:25:13,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:25:13,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397413265] [2024-10-14 03:25:13,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:25:13,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:25:13,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:25:13,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:25:13,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:25:13,594 INFO L87 Difference]: Start difference. First operand 841 states and 1292 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 5 states have internal predecessors, (82), 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-14 03:25:15,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:25:15,650 INFO L93 Difference]: Finished difference Result 3092 states and 4812 transitions. [2024-10-14 03:25:15,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 03:25:15,650 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 5 states have internal predecessors, (82), 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 92 [2024-10-14 03:25:15,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:25:15,663 INFO L225 Difference]: With dead ends: 3092 [2024-10-14 03:25:15,665 INFO L226 Difference]: Without dead ends: 2262 [2024-10-14 03:25:15,670 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2024-10-14 03:25:15,673 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 762 mSDsluCounter, 761 mSDsCounter, 0 mSdLazyCounter, 2082 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 772 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 2133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 2082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-14 03:25:15,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [772 Valid, 1000 Invalid, 2133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 2082 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-14 03:25:15,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2262 states. [2024-10-14 03:25:15,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2262 to 1493. [2024-10-14 03:25:15,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1493 states, 1312 states have (on average 1.5434451219512195) internal successors, (2025), 1321 states have internal predecessors, (2025), 118 states have call successors, (118), 54 states have call predecessors, (118), 62 states have return successors, (153), 125 states have call predecessors, (153), 118 states have call successors, (153) [2024-10-14 03:25:15,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1493 states to 1493 states and 2296 transitions. [2024-10-14 03:25:15,812 INFO L78 Accepts]: Start accepts. Automaton has 1493 states and 2296 transitions. Word has length 92 [2024-10-14 03:25:15,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:25:15,815 INFO L471 AbstractCegarLoop]: Abstraction has 1493 states and 2296 transitions. [2024-10-14 03:25:15,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 5 states have internal predecessors, (82), 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-14 03:25:15,817 INFO L276 IsEmpty]: Start isEmpty. Operand 1493 states and 2296 transitions. [2024-10-14 03:25:15,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-14 03:25:15,820 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:25:15,820 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:25:15,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 03:25:15,821 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:25:15,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:25:15,823 INFO L85 PathProgramCache]: Analyzing trace with hash 806622274, now seen corresponding path program 1 times [2024-10-14 03:25:15,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:25:15,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658933346] [2024-10-14 03:25:15,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:25:15,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:25:15,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:15,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:25:15,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:15,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 03:25:15,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:15,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 03:25:15,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:15,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 03:25:15,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:15,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 03:25:15,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:15,976 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-14 03:25:15,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:25:15,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658933346] [2024-10-14 03:25:15,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658933346] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:25:15,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:25:15,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:25:15,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871628549] [2024-10-14 03:25:15,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:25:15,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:25:15,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:25:15,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:25:15,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:25:15,978 INFO L87 Difference]: Start difference. First operand 1493 states and 2296 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 5 states have internal predecessors, (82), 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-14 03:25:16,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:25:16,747 INFO L93 Difference]: Finished difference Result 3425 states and 5336 transitions. [2024-10-14 03:25:16,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 03:25:16,748 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 5 states have internal predecessors, (82), 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 92 [2024-10-14 03:25:16,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:25:16,759 INFO L225 Difference]: With dead ends: 3425 [2024-10-14 03:25:16,759 INFO L226 Difference]: Without dead ends: 1943 [2024-10-14 03:25:16,764 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-14 03:25:16,766 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 526 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 538 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 03:25:16,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [538 Valid, 507 Invalid, 851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 799 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 03:25:16,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1943 states. [2024-10-14 03:25:16,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1943 to 1493. [2024-10-14 03:25:16,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1493 states, 1312 states have (on average 1.5365853658536586) internal successors, (2016), 1321 states have internal predecessors, (2016), 118 states have call successors, (118), 54 states have call predecessors, (118), 62 states have return successors, (153), 125 states have call predecessors, (153), 118 states have call successors, (153) [2024-10-14 03:25:16,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1493 states to 1493 states and 2287 transitions. [2024-10-14 03:25:16,911 INFO L78 Accepts]: Start accepts. Automaton has 1493 states and 2287 transitions. Word has length 92 [2024-10-14 03:25:16,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:25:16,911 INFO L471 AbstractCegarLoop]: Abstraction has 1493 states and 2287 transitions. [2024-10-14 03:25:16,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 5 states have internal predecessors, (82), 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-14 03:25:16,912 INFO L276 IsEmpty]: Start isEmpty. Operand 1493 states and 2287 transitions. [2024-10-14 03:25:16,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-14 03:25:16,914 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:25:16,915 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:25:16,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 03:25:16,915 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:25:16,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:25:16,916 INFO L85 PathProgramCache]: Analyzing trace with hash 883523072, now seen corresponding path program 1 times [2024-10-14 03:25:16,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:25:16,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289451950] [2024-10-14 03:25:16,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:25:16,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:25:16,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:16,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:25:16,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:17,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 03:25:17,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:17,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 03:25:17,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:17,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 03:25:17,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:17,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 03:25:17,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:17,078 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-14 03:25:17,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:25:17,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289451950] [2024-10-14 03:25:17,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289451950] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:25:17,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:25:17,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:25:17,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232560565] [2024-10-14 03:25:17,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:25:17,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:25:17,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:25:17,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:25:17,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:25:17,082 INFO L87 Difference]: Start difference. First operand 1493 states and 2287 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 5 states have internal predecessors, (82), 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-14 03:25:18,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:25:18,892 INFO L93 Difference]: Finished difference Result 5404 states and 8358 transitions. [2024-10-14 03:25:18,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 03:25:18,892 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 5 states have internal predecessors, (82), 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 92 [2024-10-14 03:25:18,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:25:18,912 INFO L225 Difference]: With dead ends: 5404 [2024-10-14 03:25:18,913 INFO L226 Difference]: Without dead ends: 3922 [2024-10-14 03:25:18,918 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-14 03:25:18,920 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 800 mSDsluCounter, 761 mSDsCounter, 0 mSdLazyCounter, 1861 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 816 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 1913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:25:18,920 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [816 Valid, 1000 Invalid, 1913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1861 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-14 03:25:18,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3922 states. [2024-10-14 03:25:19,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3922 to 2803. [2024-10-14 03:25:19,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2803 states, 2474 states have (on average 1.5311236863379143) internal successors, (3788), 2491 states have internal predecessors, (3788), 210 states have call successors, (210), 102 states have call predecessors, (210), 118 states have return successors, (307), 225 states have call predecessors, (307), 210 states have call successors, (307) [2024-10-14 03:25:19,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2803 states to 2803 states and 4305 transitions. [2024-10-14 03:25:19,137 INFO L78 Accepts]: Start accepts. Automaton has 2803 states and 4305 transitions. Word has length 92 [2024-10-14 03:25:19,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:25:19,138 INFO L471 AbstractCegarLoop]: Abstraction has 2803 states and 4305 transitions. [2024-10-14 03:25:19,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 5 states have internal predecessors, (82), 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-14 03:25:19,138 INFO L276 IsEmpty]: Start isEmpty. Operand 2803 states and 4305 transitions. [2024-10-14 03:25:19,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-14 03:25:19,143 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:25:19,143 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:25:19,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 03:25:19,143 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:25:19,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:25:19,144 INFO L85 PathProgramCache]: Analyzing trace with hash -83827582, now seen corresponding path program 1 times [2024-10-14 03:25:19,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:25:19,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101340010] [2024-10-14 03:25:19,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:25:19,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:25:19,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:19,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:25:19,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:19,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 03:25:19,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:19,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 03:25:19,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:19,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 03:25:19,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:19,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 03:25:19,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:19,307 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-14 03:25:19,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:25:19,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101340010] [2024-10-14 03:25:19,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101340010] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:25:19,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:25:19,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:25:19,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313395589] [2024-10-14 03:25:19,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:25:19,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:25:19,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:25:19,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:25:19,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:25:19,310 INFO L87 Difference]: Start difference. First operand 2803 states and 4305 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 5 states have internal predecessors, (82), 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-14 03:25:21,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:25:21,239 INFO L93 Difference]: Finished difference Result 10032 states and 15542 transitions. [2024-10-14 03:25:21,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 03:25:21,239 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 5 states have internal predecessors, (82), 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 92 [2024-10-14 03:25:21,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:25:21,280 INFO L225 Difference]: With dead ends: 10032 [2024-10-14 03:25:21,281 INFO L226 Difference]: Without dead ends: 7240 [2024-10-14 03:25:21,293 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-14 03:25:21,294 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 726 mSDsluCounter, 761 mSDsCounter, 0 mSdLazyCounter, 2031 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 736 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 2082 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 2031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:25:21,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [736 Valid, 1000 Invalid, 2082 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 2031 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 03:25:21,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7240 states. [2024-10-14 03:25:21,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7240 to 5420. [2024-10-14 03:25:21,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5420 states, 4803 states have (on average 1.5286279408702894) internal successors, (7342), 4836 states have internal predecessors, (7342), 386 states have call successors, (386), 198 states have call predecessors, (386), 230 states have return successors, (661), 417 states have call predecessors, (661), 386 states have call successors, (661) [2024-10-14 03:25:21,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5420 states to 5420 states and 8389 transitions. [2024-10-14 03:25:21,795 INFO L78 Accepts]: Start accepts. Automaton has 5420 states and 8389 transitions. Word has length 92 [2024-10-14 03:25:21,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:25:21,796 INFO L471 AbstractCegarLoop]: Abstraction has 5420 states and 8389 transitions. [2024-10-14 03:25:21,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 5 states have internal predecessors, (82), 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-14 03:25:21,796 INFO L276 IsEmpty]: Start isEmpty. Operand 5420 states and 8389 transitions. [2024-10-14 03:25:21,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-14 03:25:21,804 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:25:21,804 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:25:21,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 03:25:21,804 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:25:21,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:25:21,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1824630208, now seen corresponding path program 1 times [2024-10-14 03:25:21,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:25:21,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665372217] [2024-10-14 03:25:21,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:25:21,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:25:21,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:21,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:25:21,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:21,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 03:25:21,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:21,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 03:25:21,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:21,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 03:25:21,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:21,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 03:25:21,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:21,938 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-14 03:25:21,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:25:21,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665372217] [2024-10-14 03:25:21,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665372217] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:25:21,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:25:21,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:25:21,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186514269] [2024-10-14 03:25:21,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:25:21,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:25:21,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:25:21,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:25:21,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:25:21,941 INFO L87 Difference]: Start difference. First operand 5420 states and 8389 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 5 states have internal predecessors, (82), 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-14 03:25:22,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:25:22,984 INFO L93 Difference]: Finished difference Result 12193 states and 19105 transitions. [2024-10-14 03:25:22,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 03:25:22,985 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 5 states have internal predecessors, (82), 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 92 [2024-10-14 03:25:22,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:25:23,028 INFO L225 Difference]: With dead ends: 12193 [2024-10-14 03:25:23,028 INFO L226 Difference]: Without dead ends: 6784 [2024-10-14 03:25:23,048 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 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-14 03:25:23,049 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 509 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 03:25:23,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 508 Invalid, 837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 03:25:23,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6784 states. [2024-10-14 03:25:23,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6784 to 5420. [2024-10-14 03:25:23,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5420 states, 4803 states have (on average 1.52175723506142) internal successors, (7309), 4836 states have internal predecessors, (7309), 386 states have call successors, (386), 198 states have call predecessors, (386), 230 states have return successors, (661), 417 states have call predecessors, (661), 386 states have call successors, (661) [2024-10-14 03:25:23,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5420 states to 5420 states and 8356 transitions. [2024-10-14 03:25:23,652 INFO L78 Accepts]: Start accepts. Automaton has 5420 states and 8356 transitions. Word has length 92 [2024-10-14 03:25:23,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:25:23,654 INFO L471 AbstractCegarLoop]: Abstraction has 5420 states and 8356 transitions. [2024-10-14 03:25:23,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 5 states have internal predecessors, (82), 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-14 03:25:23,655 INFO L276 IsEmpty]: Start isEmpty. Operand 5420 states and 8356 transitions. [2024-10-14 03:25:23,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-14 03:25:23,666 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:25:23,666 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:25:23,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 03:25:23,667 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:25:23,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:25:23,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1332004034, now seen corresponding path program 1 times [2024-10-14 03:25:23,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:25:23,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471769563] [2024-10-14 03:25:23,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:25:23,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:25:23,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:23,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:25:23,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:23,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 03:25:23,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:23,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 03:25:23,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:23,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 03:25:23,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:23,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 03:25:23,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:23,832 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-14 03:25:23,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:25:23,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471769563] [2024-10-14 03:25:23,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471769563] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:25:23,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:25:23,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:25:23,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236474989] [2024-10-14 03:25:23,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:25:23,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:25:23,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:25:23,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:25:23,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:25:23,837 INFO L87 Difference]: Start difference. First operand 5420 states and 8356 transitions. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 4 states have internal predecessors, (82), 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-14 03:25:25,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:25:25,064 INFO L93 Difference]: Finished difference Result 11934 states and 18558 transitions. [2024-10-14 03:25:25,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 03:25:25,065 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 4 states have internal predecessors, (82), 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 92 [2024-10-14 03:25:25,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:25:25,096 INFO L225 Difference]: With dead ends: 11934 [2024-10-14 03:25:25,096 INFO L226 Difference]: Without dead ends: 6526 [2024-10-14 03:25:25,114 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-14 03:25:25,114 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 230 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 880 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 03:25:25,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 577 Invalid, 916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 880 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 03:25:25,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6526 states. [2024-10-14 03:25:25,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6526 to 5422. [2024-10-14 03:25:25,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5422 states, 4805 states have (on average 1.5148803329864724) internal successors, (7279), 4838 states have internal predecessors, (7279), 386 states have call successors, (386), 198 states have call predecessors, (386), 230 states have return successors, (661), 417 states have call predecessors, (661), 386 states have call successors, (661) [2024-10-14 03:25:25,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5422 states to 5422 states and 8326 transitions. [2024-10-14 03:25:25,711 INFO L78 Accepts]: Start accepts. Automaton has 5422 states and 8326 transitions. Word has length 92 [2024-10-14 03:25:25,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:25:25,711 INFO L471 AbstractCegarLoop]: Abstraction has 5422 states and 8326 transitions. [2024-10-14 03:25:25,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 4 states have internal predecessors, (82), 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-14 03:25:25,712 INFO L276 IsEmpty]: Start isEmpty. Operand 5422 states and 8326 transitions. [2024-10-14 03:25:25,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-14 03:25:25,720 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:25:25,720 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:25:25,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 03:25:25,721 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:25:25,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:25:25,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1001388604, now seen corresponding path program 1 times [2024-10-14 03:25:25,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:25:25,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734965355] [2024-10-14 03:25:25,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:25:25,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:25:25,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:25,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:25:25,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:25,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 03:25:25,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:25,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 03:25:25,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:25,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 03:25:25,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:25,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 03:25:25,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:25,881 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-14 03:25:25,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:25:25,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734965355] [2024-10-14 03:25:25,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734965355] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:25:25,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:25:25,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:25:25,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305256752] [2024-10-14 03:25:25,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:25:25,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:25:25,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:25:25,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:25:25,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:25:25,884 INFO L87 Difference]: Start difference. First operand 5422 states and 8326 transitions. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 4 states have internal predecessors, (82), 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-14 03:25:27,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:25:27,289 INFO L93 Difference]: Finished difference Result 12004 states and 18597 transitions. [2024-10-14 03:25:27,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 03:25:27,289 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 4 states have internal predecessors, (82), 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 92 [2024-10-14 03:25:27,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:25:27,316 INFO L225 Difference]: With dead ends: 12004 [2024-10-14 03:25:27,316 INFO L226 Difference]: Without dead ends: 6594 [2024-10-14 03:25:27,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-14 03:25:27,333 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 241 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 852 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 03:25:27,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 577 Invalid, 888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 852 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 03:25:27,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6594 states. [2024-10-14 03:25:27,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6594 to 5488. [2024-10-14 03:25:27,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5488 states, 4871 states have (on average 1.507903921166085) internal successors, (7345), 4904 states have internal predecessors, (7345), 386 states have call successors, (386), 198 states have call predecessors, (386), 230 states have return successors, (661), 417 states have call predecessors, (661), 386 states have call successors, (661) [2024-10-14 03:25:27,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5488 states to 5488 states and 8392 transitions. [2024-10-14 03:25:27,711 INFO L78 Accepts]: Start accepts. Automaton has 5488 states and 8392 transitions. Word has length 92 [2024-10-14 03:25:27,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:25:27,712 INFO L471 AbstractCegarLoop]: Abstraction has 5488 states and 8392 transitions. [2024-10-14 03:25:27,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 4 states have internal predecessors, (82), 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-14 03:25:27,712 INFO L276 IsEmpty]: Start isEmpty. Operand 5488 states and 8392 transitions. [2024-10-14 03:25:27,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-14 03:25:27,719 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:25:27,719 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:25:27,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 03:25:27,720 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:25:27,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:25:27,720 INFO L85 PathProgramCache]: Analyzing trace with hash -960713854, now seen corresponding path program 1 times [2024-10-14 03:25:27,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:25:27,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371970057] [2024-10-14 03:25:27,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:25:27,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:25:27,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:27,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:25:27,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:27,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 03:25:27,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:27,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 03:25:27,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:27,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 03:25:27,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:27,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 03:25:27,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:27,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:25:27,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:25:27,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371970057] [2024-10-14 03:25:27,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371970057] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:25:27,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:25:27,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:25:27,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946710673] [2024-10-14 03:25:27,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:25:27,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:25:27,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:25:27,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:25:27,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:25:27,883 INFO L87 Difference]: Start difference. First operand 5488 states and 8392 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 5 states have internal predecessors, (82), 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-14 03:25:30,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:25:30,919 INFO L93 Difference]: Finished difference Result 30515 states and 47792 transitions. [2024-10-14 03:25:30,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-14 03:25:30,919 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 5 states have internal predecessors, (82), 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 92 [2024-10-14 03:25:30,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:25:31,058 INFO L225 Difference]: With dead ends: 30515 [2024-10-14 03:25:31,059 INFO L226 Difference]: Without dead ends: 25039 [2024-10-14 03:25:31,093 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-14 03:25:31,094 INFO L432 NwaCegarLoop]: 273 mSDtfsCounter, 1855 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 1595 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1873 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 1824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 1595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:25:31,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1873 Valid, 870 Invalid, 1824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 1595 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-14 03:25:31,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25039 states. [2024-10-14 03:25:32,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25039 to 20750. [2024-10-14 03:25:32,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20750 states, 18430 states have (on average 1.5003255561584374) internal successors, (27651), 18559 states have internal predecessors, (27651), 1399 states have call successors, (1399), 792 states have call predecessors, (1399), 920 states have return successors, (2908), 1430 states have call predecessors, (2908), 1399 states have call successors, (2908) [2024-10-14 03:25:32,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20750 states to 20750 states and 31958 transitions. [2024-10-14 03:25:32,886 INFO L78 Accepts]: Start accepts. Automaton has 20750 states and 31958 transitions. Word has length 92 [2024-10-14 03:25:32,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:25:32,887 INFO L471 AbstractCegarLoop]: Abstraction has 20750 states and 31958 transitions. [2024-10-14 03:25:32,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 5 states have internal predecessors, (82), 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-14 03:25:32,888 INFO L276 IsEmpty]: Start isEmpty. Operand 20750 states and 31958 transitions. [2024-10-14 03:25:32,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-14 03:25:32,897 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:25:32,897 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:25:32,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 03:25:32,898 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:25:32,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:25:32,898 INFO L85 PathProgramCache]: Analyzing trace with hash -857912607, now seen corresponding path program 1 times [2024-10-14 03:25:32,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:25:32,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066806849] [2024-10-14 03:25:32,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:25:32,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:25:32,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:32,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:25:32,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:32,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 03:25:32,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:32,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 03:25:32,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:33,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 03:25:33,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:33,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 03:25:33,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:33,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:25:33,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:25:33,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066806849] [2024-10-14 03:25:33,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066806849] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:25:33,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:25:33,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:25:33,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395140839] [2024-10-14 03:25:33,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:25:33,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:25:33,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:25:33,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:25:33,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:25:33,025 INFO L87 Difference]: Start difference. First operand 20750 states and 31958 transitions. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 4 states have internal predecessors, (82), 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-14 03:25:35,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:25:35,256 INFO L93 Difference]: Finished difference Result 45141 states and 70919 transitions. [2024-10-14 03:25:35,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 03:25:35,257 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 4 states have internal predecessors, (82), 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 92 [2024-10-14 03:25:35,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:25:35,375 INFO L225 Difference]: With dead ends: 45141 [2024-10-14 03:25:35,375 INFO L226 Difference]: Without dead ends: 24403 [2024-10-14 03:25:35,434 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-14 03:25:35,435 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 248 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 03:25:35,435 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 577 Invalid, 862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 826 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 03:25:35,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24403 states. [2024-10-14 03:25:37,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24403 to 20882. [2024-10-14 03:25:37,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20882 states, 18562 states have (on average 1.4932119383687104) internal successors, (27717), 18691 states have internal predecessors, (27717), 1399 states have call successors, (1399), 792 states have call predecessors, (1399), 920 states have return successors, (2908), 1430 states have call predecessors, (2908), 1399 states have call successors, (2908) [2024-10-14 03:25:37,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20882 states to 20882 states and 32024 transitions. [2024-10-14 03:25:37,873 INFO L78 Accepts]: Start accepts. Automaton has 20882 states and 32024 transitions. Word has length 92 [2024-10-14 03:25:37,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:25:37,874 INFO L471 AbstractCegarLoop]: Abstraction has 20882 states and 32024 transitions. [2024-10-14 03:25:37,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 4 states have internal predecessors, (82), 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-14 03:25:37,874 INFO L276 IsEmpty]: Start isEmpty. Operand 20882 states and 32024 transitions. [2024-10-14 03:25:37,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-14 03:25:37,883 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:25:37,883 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:25:37,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 03:25:37,883 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:25:37,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:25:37,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1408468579, now seen corresponding path program 1 times [2024-10-14 03:25:37,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:25:37,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230425075] [2024-10-14 03:25:37,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:25:37,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:25:37,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:37,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:25:37,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:37,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 03:25:37,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:37,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 03:25:37,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:38,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 03:25:38,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:38,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 03:25:38,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:38,024 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-14 03:25:38,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:25:38,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230425075] [2024-10-14 03:25:38,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230425075] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:25:38,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:25:38,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:25:38,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103686459] [2024-10-14 03:25:38,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:25:38,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:25:38,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:25:38,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:25:38,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:25:38,028 INFO L87 Difference]: Start difference. First operand 20882 states and 32024 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 5 states have internal predecessors, (82), 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-14 03:25:43,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:25:43,509 INFO L93 Difference]: Finished difference Result 68908 states and 106926 transitions. [2024-10-14 03:25:43,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-14 03:25:43,509 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 5 states have internal predecessors, (82), 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 92 [2024-10-14 03:25:43,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:25:43,712 INFO L225 Difference]: With dead ends: 68908 [2024-10-14 03:25:43,713 INFO L226 Difference]: Without dead ends: 48038 [2024-10-14 03:25:43,775 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2024-10-14 03:25:43,776 INFO L432 NwaCegarLoop]: 276 mSDtfsCounter, 1630 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 1626 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1646 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 1812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 1626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-14 03:25:43,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1646 Valid, 889 Invalid, 1812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 1626 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-14 03:25:43,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48038 states. [2024-10-14 03:25:47,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48038 to 40722. [2024-10-14 03:25:47,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40722 states, 36188 states have (on average 1.4894163811208134) internal successors, (53899), 36445 states have internal predecessors, (53899), 2693 states have call successors, (2693), 1584 states have call predecessors, (2693), 1840 states have return successors, (6031), 2724 states have call predecessors, (6031), 2693 states have call successors, (6031) [2024-10-14 03:25:47,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40722 states to 40722 states and 62623 transitions. [2024-10-14 03:25:47,487 INFO L78 Accepts]: Start accepts. Automaton has 40722 states and 62623 transitions. Word has length 92 [2024-10-14 03:25:47,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:25:47,489 INFO L471 AbstractCegarLoop]: Abstraction has 40722 states and 62623 transitions. [2024-10-14 03:25:47,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 5 states have internal predecessors, (82), 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-14 03:25:47,489 INFO L276 IsEmpty]: Start isEmpty. Operand 40722 states and 62623 transitions. [2024-10-14 03:25:47,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-14 03:25:47,499 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:25:47,499 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:25:47,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 03:25:47,500 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:25:47,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:25:47,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1418295388, now seen corresponding path program 1 times [2024-10-14 03:25:47,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:25:47,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004875965] [2024-10-14 03:25:47,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:25:47,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:25:47,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:47,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:25:47,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:47,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 03:25:47,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:47,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 03:25:47,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:47,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 03:25:47,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:47,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 03:25:47,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:47,621 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-14 03:25:47,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:25:47,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004875965] [2024-10-14 03:25:47,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004875965] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:25:47,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:25:47,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:25:47,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961572735] [2024-10-14 03:25:47,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:25:47,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:25:47,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:25:47,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:25:47,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:25:47,623 INFO L87 Difference]: Start difference. First operand 40722 states and 62623 transitions. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 4 states have internal predecessors, (82), 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-14 03:25:51,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:25:51,596 INFO L93 Difference]: Finished difference Result 88163 states and 138796 transitions. [2024-10-14 03:25:51,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 03:25:51,596 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 4 states have internal predecessors, (82), 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 92 [2024-10-14 03:25:51,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:25:51,823 INFO L225 Difference]: With dead ends: 88163 [2024-10-14 03:25:51,824 INFO L226 Difference]: Without dead ends: 47453 [2024-10-14 03:25:51,922 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-14 03:25:51,923 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 260 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 03:25:51,923 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 577 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 784 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 03:25:51,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47453 states. [2024-10-14 03:25:55,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47453 to 40986. [2024-10-14 03:25:55,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40986 states, 36452 states have (on average 1.4822506309667507) internal successors, (54031), 36709 states have internal predecessors, (54031), 2693 states have call successors, (2693), 1584 states have call predecessors, (2693), 1840 states have return successors, (6031), 2724 states have call predecessors, (6031), 2693 states have call successors, (6031) [2024-10-14 03:25:55,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40986 states to 40986 states and 62755 transitions. [2024-10-14 03:25:55,556 INFO L78 Accepts]: Start accepts. Automaton has 40986 states and 62755 transitions. Word has length 92 [2024-10-14 03:25:55,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:25:55,557 INFO L471 AbstractCegarLoop]: Abstraction has 40986 states and 62755 transitions. [2024-10-14 03:25:55,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 4 states have internal predecessors, (82), 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-14 03:25:55,557 INFO L276 IsEmpty]: Start isEmpty. Operand 40986 states and 62755 transitions. [2024-10-14 03:25:55,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-14 03:25:55,564 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:25:55,565 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:25:55,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 03:25:55,565 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:25:55,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:25:55,566 INFO L85 PathProgramCache]: Analyzing trace with hash 509977314, now seen corresponding path program 1 times [2024-10-14 03:25:55,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:25:55,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354431932] [2024-10-14 03:25:55,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:25:55,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:25:55,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:55,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:25:55,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:55,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 03:25:55,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:55,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 03:25:55,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:55,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 03:25:55,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:55,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 03:25:55,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:55,711 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-14 03:25:55,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:25:55,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354431932] [2024-10-14 03:25:55,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354431932] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:25:55,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:25:55,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:25:55,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889533687] [2024-10-14 03:25:55,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:25:55,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:25:55,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:25:55,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:25:55,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:25:55,713 INFO L87 Difference]: Start difference. First operand 40986 states and 62755 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 5 states have internal predecessors, (82), 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)