./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.07.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.07.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 022987cd4c8c671e376c5c3e5a08e2f1b98444b4d5d48bc73787bff74aa0de0f --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 03:24:59,935 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 03:24:59,985 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,988 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 03:24:59,989 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 03:25:00,004 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 03:25:00,005 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 03:25:00,005 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 03:25:00,006 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 03:25:00,006 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 03:25:00,006 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 03:25:00,006 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 03:25:00,007 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 03:25:00,007 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 03:25:00,007 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 03:25:00,008 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 03:25:00,008 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 03:25:00,008 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 03:25:00,008 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 03:25:00,009 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 03:25:00,009 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 03:25:00,009 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 03:25:00,009 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 03:25:00,010 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 03:25:00,010 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 03:25:00,010 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 03:25:00,010 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 03:25:00,011 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 03:25:00,011 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 03:25:00,011 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 03:25:00,011 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 03:25:00,011 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 03:25:00,012 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:25:00,012 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 03:25:00,012 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 03:25:00,012 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 03:25:00,012 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 03:25:00,012 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 03:25:00,013 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 03:25:00,013 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 03:25:00,013 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 03:25:00,014 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 03:25:00,014 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 -> 022987cd4c8c671e376c5c3e5a08e2f1b98444b4d5d48bc73787bff74aa0de0f [2024-10-14 03:25:00,203 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 03:25:00,221 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 03:25:00,223 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 03:25:00,224 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 03:25:00,224 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 03:25:00,225 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.07.cil.c [2024-10-14 03:25:01,426 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 03:25:01,582 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 03:25:01,583 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.07.cil.c [2024-10-14 03:25:01,592 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75065e773/e178e4abc1994d01a4e85118e08b58f3/FLAG7f78497c5 [2024-10-14 03:25:01,603 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75065e773/e178e4abc1994d01a4e85118e08b58f3 [2024-10-14 03:25:01,605 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 03:25:01,607 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 03:25:01,608 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 03:25:01,608 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 03:25:01,613 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 03:25:01,613 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,615 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44703fa2 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,616 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,646 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 03:25:01,797 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.07.cil.c[706,719] [2024-10-14 03:25:01,873 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:25:01,881 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 03:25:01,888 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.07.cil.c[706,719] [2024-10-14 03:25:01,915 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:25:01,931 INFO L204 MainTranslator]: Completed translation [2024-10-14 03:25:01,931 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,931 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 03:25:01,932 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 03:25:01,932 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 03:25:01,933 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 03:25:01,937 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:01,946 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:01,975 INFO L138 Inliner]: procedures = 42, calls = 51, calls flagged for inlining = 26, calls inlined = 26, statements flattened = 564 [2024-10-14 03:25:01,976 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 03:25:01,976 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 03:25:01,976 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 03:25:01,976 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 03:25:01,984 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:01,984 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:01,986 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:01,998 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:01,999 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:01,999 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,004 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,014 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,016 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,017 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,020 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 03:25:02,023 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 03:25:02,023 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 03:25:02,023 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 03:25:02,024 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,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:25:02,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:25:02,049 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,051 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,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 03:25:02,086 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-14 03:25:02,086 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-14 03:25:02,086 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-14 03:25:02,086 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-14 03:25:02,087 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-14 03:25:02,087 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-14 03:25:02,087 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-14 03:25:02,088 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-14 03:25:02,088 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-14 03:25:02,088 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-14 03:25:02,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 03:25:02,088 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-14 03:25:02,088 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-14 03:25:02,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 03:25:02,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 03:25:02,170 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 03:25:02,174 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 03:25:02,585 INFO L? ?]: Removed 67 outVars from TransFormulas that were not future-live. [2024-10-14 03:25:02,585 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 03:25:02,640 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 03:25:02,640 INFO L314 CfgBuilder]: Removed 11 assume(true) statements. [2024-10-14 03:25:02,641 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,641 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 03:25:02,643 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 03:25:02,643 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 03:25:02,646 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 03:25:02,647 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,647 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69df4284 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,647 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,647 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69df4284 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,648 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,648 INFO L112 eAbstractionObserver]: Analyzing ICFG transmitter.07.cil.c [2024-10-14 03:25:02,661 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 03:25:02,661 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 03:25:02,726 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 03:25:02,754 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;@31331c97, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 03:25:02,754 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 03:25:02,758 INFO L276 IsEmpty]: Start isEmpty. Operand has 228 states, 200 states have (on average 1.72) internal successors, (344), 202 states have internal predecessors, (344), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-14 03:25:02,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-14 03:25:02,768 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:25:02,769 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:25:02,769 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:25:02,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:25:02,774 INFO L85 PathProgramCache]: Analyzing trace with hash -934557041, now seen corresponding path program 1 times [2024-10-14 03:25:02,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:25:02,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576283904] [2024-10-14 03:25:02,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:25:02,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:25:02,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:03,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:25:03,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:03,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:25:03,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:03,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 03:25:03,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:03,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 03:25:03,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:03,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 03:25:03,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:03,184 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,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:25:03,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576283904] [2024-10-14 03:25:03,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576283904] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:25:03,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:25:03,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:25:03,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801364717] [2024-10-14 03:25:03,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:25:03,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:25:03,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:25:03,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:25:03,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:25:03,212 INFO L87 Difference]: Start difference. First operand has 228 states, 200 states have (on average 1.72) internal successors, (344), 202 states have internal predecessors, (344), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 3 states have internal predecessors, (104), 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,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:25:04,130 INFO L93 Difference]: Finished difference Result 526 states and 892 transitions. [2024-10-14 03:25:04,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 03:25:04,133 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 3 states have internal predecessors, (104), 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 114 [2024-10-14 03:25:04,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:25:04,145 INFO L225 Difference]: With dead ends: 526 [2024-10-14 03:25:04,145 INFO L226 Difference]: Without dead ends: 304 [2024-10-14 03:25:04,152 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,156 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 605 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 650 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 03:25:04,157 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [623 Valid, 406 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 650 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 03:25:04,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-10-14 03:25:04,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 226. [2024-10-14 03:25:04,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 199 states have (on average 1.5979899497487438) internal successors, (318), 200 states have internal predecessors, (318), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-14 03:25:04,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 358 transitions. [2024-10-14 03:25:04,225 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 358 transitions. Word has length 114 [2024-10-14 03:25:04,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:25:04,225 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 358 transitions. [2024-10-14 03:25:04,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 3 states have internal predecessors, (104), 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,226 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 358 transitions. [2024-10-14 03:25:04,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-14 03:25:04,232 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:25:04,232 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:25:04,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 03:25:04,232 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:25:04,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:25:04,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1052998515, now seen corresponding path program 1 times [2024-10-14 03:25:04,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:25:04,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974723165] [2024-10-14 03:25:04,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:25:04,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:25:04,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:04,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:25:04,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:04,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:25:04,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:04,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 03:25:04,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:04,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 03:25:04,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:04,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 03:25:04,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:04,535 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:04,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:25:04,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974723165] [2024-10-14 03:25:04,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974723165] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:25:04,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:25:04,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:25:04,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057223072] [2024-10-14 03:25:04,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:25:04,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:25:04,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:25:04,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:25:04,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:25:04,542 INFO L87 Difference]: Start difference. First operand 226 states and 358 transitions. Second operand has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 4 states have internal predecessors, (104), 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:05,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:25:05,886 INFO L93 Difference]: Finished difference Result 816 states and 1332 transitions. [2024-10-14 03:25:05,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 03:25:05,887 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 4 states have internal predecessors, (104), 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 114 [2024-10-14 03:25:05,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:25:05,890 INFO L225 Difference]: With dead ends: 816 [2024-10-14 03:25:05,890 INFO L226 Difference]: Without dead ends: 603 [2024-10-14 03:25:05,891 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-14 03:25:05,892 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 911 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 1400 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 924 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 1485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:25:05,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [924 Valid, 678 Invalid, 1485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1400 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 03:25:05,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2024-10-14 03:25:05,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 448. [2024-10-14 03:25:05,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 399 states have (on average 1.6040100250626566) internal successors, (640), 401 states have internal predecessors, (640), 35 states have call successors, (35), 12 states have call predecessors, (35), 13 states have return successors, (38), 35 states have call predecessors, (38), 35 states have call successors, (38) [2024-10-14 03:25:05,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 713 transitions. [2024-10-14 03:25:05,957 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 713 transitions. Word has length 114 [2024-10-14 03:25:05,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:25:05,958 INFO L471 AbstractCegarLoop]: Abstraction has 448 states and 713 transitions. [2024-10-14 03:25:05,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 4 states have internal predecessors, (104), 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:05,958 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 713 transitions. [2024-10-14 03:25:05,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-14 03:25:05,962 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:25:05,962 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:25:05,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 03:25:05,962 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:25:05,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:25:05,963 INFO L85 PathProgramCache]: Analyzing trace with hash -34389012, now seen corresponding path program 1 times [2024-10-14 03:25:05,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:25:05,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297040290] [2024-10-14 03:25:05,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:25:05,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:25:05,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:06,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:25:06,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:06,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:25:06,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:06,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 03:25:06,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:06,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 03:25:06,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:06,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 03:25:06,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:06,181 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,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:25:06,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297040290] [2024-10-14 03:25:06,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297040290] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:25:06,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:25:06,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:25:06,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56667578] [2024-10-14 03:25:06,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:25:06,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:25:06,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:25:06,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:25:06,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:25:06,183 INFO L87 Difference]: Start difference. First operand 448 states and 713 transitions. Second operand has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 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,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:25:08,337 INFO L93 Difference]: Finished difference Result 1442 states and 2333 transitions. [2024-10-14 03:25:08,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 03:25:08,338 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 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 114 [2024-10-14 03:25:08,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:25:08,347 INFO L225 Difference]: With dead ends: 1442 [2024-10-14 03:25:08,348 INFO L226 Difference]: Without dead ends: 1007 [2024-10-14 03:25:08,349 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,349 INFO L432 NwaCegarLoop]: 317 mSDtfsCounter, 998 mSDsluCounter, 976 mSDsCounter, 0 mSdLazyCounter, 2841 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1011 SdHoareTripleChecker+Valid, 1293 SdHoareTripleChecker+Invalid, 2893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 2841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-14 03:25:08,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1011 Valid, 1293 Invalid, 2893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 2841 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-14 03:25:08,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2024-10-14 03:25:08,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 655. [2024-10-14 03:25:08,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 584 states have (on average 1.595890410958904) internal successors, (932), 587 states have internal predecessors, (932), 50 states have call successors, (50), 18 states have call predecessors, (50), 20 states have return successors, (55), 51 states have call predecessors, (55), 50 states have call successors, (55) [2024-10-14 03:25:08,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1037 transitions. [2024-10-14 03:25:08,382 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1037 transitions. Word has length 114 [2024-10-14 03:25:08,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:25:08,382 INFO L471 AbstractCegarLoop]: Abstraction has 655 states and 1037 transitions. [2024-10-14 03:25:08,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 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,382 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1037 transitions. [2024-10-14 03:25:08,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-14 03:25:08,384 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:25:08,384 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:25:08,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 03:25:08,384 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:25:08,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:25:08,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1566682094, now seen corresponding path program 1 times [2024-10-14 03:25:08,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:25:08,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298089797] [2024-10-14 03:25:08,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:25:08,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:25:08,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:08,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:25:08,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:08,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:25:08,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:08,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 03:25:08,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:08,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 03:25:08,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:08,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 03:25:08,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:08,555 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:08,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:25:08,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298089797] [2024-10-14 03:25:08,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298089797] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:25:08,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:25:08,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:25:08,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234131570] [2024-10-14 03:25:08,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:25:08,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:25:08,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:25:08,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:25:08,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:25:08,557 INFO L87 Difference]: Start difference. First operand 655 states and 1037 transitions. Second operand has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 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:09,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:25:09,343 INFO L93 Difference]: Finished difference Result 1562 states and 2522 transitions. [2024-10-14 03:25:09,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 03:25:09,344 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 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 114 [2024-10-14 03:25:09,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:25:09,347 INFO L225 Difference]: With dead ends: 1562 [2024-10-14 03:25:09,348 INFO L226 Difference]: Without dead ends: 920 [2024-10-14 03:25:09,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 03:25:09,350 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 766 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 1041 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 780 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 1115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1041 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 03:25:09,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [780 Valid, 545 Invalid, 1115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1041 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 03:25:09,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2024-10-14 03:25:09,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 655. [2024-10-14 03:25:09,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 584 states have (on average 1.5907534246575343) internal successors, (929), 587 states have internal predecessors, (929), 50 states have call successors, (50), 18 states have call predecessors, (50), 20 states have return successors, (55), 51 states have call predecessors, (55), 50 states have call successors, (55) [2024-10-14 03:25:09,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1034 transitions. [2024-10-14 03:25:09,386 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1034 transitions. Word has length 114 [2024-10-14 03:25:09,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:25:09,387 INFO L471 AbstractCegarLoop]: Abstraction has 655 states and 1034 transitions. [2024-10-14 03:25:09,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 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:09,387 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1034 transitions. [2024-10-14 03:25:09,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-14 03:25:09,389 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:25:09,389 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:25:09,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 03:25:09,390 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:25:09,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:25:09,390 INFO L85 PathProgramCache]: Analyzing trace with hash 509950892, now seen corresponding path program 1 times [2024-10-14 03:25:09,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:25:09,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281423286] [2024-10-14 03:25:09,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:25:09,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:25:09,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:09,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:25:09,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:09,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:25:09,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:09,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 03:25:09,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:09,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 03:25:09,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:09,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 03:25:09,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:09,525 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,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:25:09,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281423286] [2024-10-14 03:25:09,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281423286] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:25:09,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:25:09,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:25:09,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819789488] [2024-10-14 03:25:09,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:25:09,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:25:09,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:25:09,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:25:09,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:25:09,527 INFO L87 Difference]: Start difference. First operand 655 states and 1034 transitions. Second operand has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 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:10,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:25:10,330 INFO L93 Difference]: Finished difference Result 1558 states and 2505 transitions. [2024-10-14 03:25:10,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 03:25:10,331 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 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 114 [2024-10-14 03:25:10,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:25:10,334 INFO L225 Difference]: With dead ends: 1558 [2024-10-14 03:25:10,334 INFO L226 Difference]: Without dead ends: 916 [2024-10-14 03:25:10,336 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 03:25:10,336 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 764 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 1027 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 778 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 1101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1027 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 03:25:10,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [778 Valid, 545 Invalid, 1101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1027 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 03:25:10,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916 states. [2024-10-14 03:25:10,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 916 to 655. [2024-10-14 03:25:10,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 584 states have (on average 1.5856164383561644) internal successors, (926), 587 states have internal predecessors, (926), 50 states have call successors, (50), 18 states have call predecessors, (50), 20 states have return successors, (55), 51 states have call predecessors, (55), 50 states have call successors, (55) [2024-10-14 03:25:10,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1031 transitions. [2024-10-14 03:25:10,379 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1031 transitions. Word has length 114 [2024-10-14 03:25:10,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:25:10,380 INFO L471 AbstractCegarLoop]: Abstraction has 655 states and 1031 transitions. [2024-10-14 03:25:10,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 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:10,380 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1031 transitions. [2024-10-14 03:25:10,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-14 03:25:10,381 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:25:10,381 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:25:10,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 03:25:10,382 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:25:10,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:25:10,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1861336110, now seen corresponding path program 1 times [2024-10-14 03:25:10,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:25:10,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713738923] [2024-10-14 03:25:10,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:25:10,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:25:10,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:10,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:25:10,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:10,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:25:10,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:10,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 03:25:10,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:10,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 03:25:10,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:10,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 03:25:10,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:10,505 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:10,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:25:10,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713738923] [2024-10-14 03:25:10,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713738923] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:25:10,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:25:10,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:25:10,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281660814] [2024-10-14 03:25:10,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:25:10,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:25:10,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:25:10,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:25:10,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:25:10,507 INFO L87 Difference]: Start difference. First operand 655 states and 1031 transitions. Second operand has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 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,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:25:11,295 INFO L93 Difference]: Finished difference Result 1554 states and 2488 transitions. [2024-10-14 03:25:11,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 03:25:11,296 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 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 114 [2024-10-14 03:25:11,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:25:11,299 INFO L225 Difference]: With dead ends: 1554 [2024-10-14 03:25:11,299 INFO L226 Difference]: Without dead ends: 912 [2024-10-14 03:25:11,301 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 03:25:11,301 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 762 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 1013 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 776 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 1087 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1013 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 03:25:11,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [776 Valid, 545 Invalid, 1087 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1013 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 03:25:11,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2024-10-14 03:25:11,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 655. [2024-10-14 03:25:11,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 584 states have (on average 1.5804794520547945) internal successors, (923), 587 states have internal predecessors, (923), 50 states have call successors, (50), 18 states have call predecessors, (50), 20 states have return successors, (55), 51 states have call predecessors, (55), 50 states have call successors, (55) [2024-10-14 03:25:11,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1028 transitions. [2024-10-14 03:25:11,334 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1028 transitions. Word has length 114 [2024-10-14 03:25:11,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:25:11,335 INFO L471 AbstractCegarLoop]: Abstraction has 655 states and 1028 transitions. [2024-10-14 03:25:11,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 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,335 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1028 transitions. [2024-10-14 03:25:11,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-14 03:25:11,337 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:25:11,337 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:25:11,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 03:25:11,337 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:25:11,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:25:11,338 INFO L85 PathProgramCache]: Analyzing trace with hash 242361196, now seen corresponding path program 1 times [2024-10-14 03:25:11,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:25:11,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400041732] [2024-10-14 03:25:11,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:25:11,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:25:11,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:11,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:25:11,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:11,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:25:11,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:11,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 03:25:11,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:11,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 03:25:11,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:11,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 03:25:11,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:11,500 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,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:25:11,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400041732] [2024-10-14 03:25:11,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400041732] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:25:11,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:25:11,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:25:11,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108300114] [2024-10-14 03:25:11,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:25:11,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:25:11,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:25:11,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:25:11,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:25:11,501 INFO L87 Difference]: Start difference. First operand 655 states and 1028 transitions. Second operand has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 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,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:25:13,265 INFO L93 Difference]: Finished difference Result 2209 states and 3515 transitions. [2024-10-14 03:25:13,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 03:25:13,266 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 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 114 [2024-10-14 03:25:13,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:25:13,271 INFO L225 Difference]: With dead ends: 2209 [2024-10-14 03:25:13,272 INFO L226 Difference]: Without dead ends: 1567 [2024-10-14 03:25:13,273 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:13,273 INFO L432 NwaCegarLoop]: 315 mSDtfsCounter, 972 mSDsluCounter, 976 mSDsCounter, 0 mSdLazyCounter, 2741 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 985 SdHoareTripleChecker+Valid, 1291 SdHoareTripleChecker+Invalid, 2795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 2741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:25:13,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [985 Valid, 1291 Invalid, 2795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 2741 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-14 03:25:13,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1567 states. [2024-10-14 03:25:13,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1567 to 1081. [2024-10-14 03:25:13,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1081 states, 966 states have (on average 1.5714285714285714) internal successors, (1518), 971 states have internal predecessors, (1518), 80 states have call successors, (80), 30 states have call predecessors, (80), 34 states have return successors, (93), 83 states have call predecessors, (93), 80 states have call successors, (93) [2024-10-14 03:25:13,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081 states to 1081 states and 1691 transitions. [2024-10-14 03:25:13,338 INFO L78 Accepts]: Start accepts. Automaton has 1081 states and 1691 transitions. Word has length 114 [2024-10-14 03:25:13,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:25:13,340 INFO L471 AbstractCegarLoop]: Abstraction has 1081 states and 1691 transitions. [2024-10-14 03:25:13,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 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,340 INFO L276 IsEmpty]: Start isEmpty. Operand 1081 states and 1691 transitions. [2024-10-14 03:25:13,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-14 03:25:13,342 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:25:13,342 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:25:13,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 03:25:13,342 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:25:13,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:25:13,342 INFO L85 PathProgramCache]: Analyzing trace with hash -641147794, now seen corresponding path program 1 times [2024-10-14 03:25:13,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:25:13,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253092541] [2024-10-14 03:25:13,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:25:13,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:25:13,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:13,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:25:13,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:13,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:25:13,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:13,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 03:25:13,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:13,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 03:25:13,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:13,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 03:25:13,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:13,470 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,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:25:13,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253092541] [2024-10-14 03:25:13,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253092541] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:25:13,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:25:13,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:25:13,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348236027] [2024-10-14 03:25:13,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:25:13,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:25:13,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:25:13,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:25:13,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:25:13,472 INFO L87 Difference]: Start difference. First operand 1081 states and 1691 transitions. Second operand has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 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:14,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:25:14,302 INFO L93 Difference]: Finished difference Result 2528 states and 4013 transitions. [2024-10-14 03:25:14,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 03:25:14,303 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 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 114 [2024-10-14 03:25:14,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:25:14,308 INFO L225 Difference]: With dead ends: 2528 [2024-10-14 03:25:14,309 INFO L226 Difference]: Without dead ends: 1460 [2024-10-14 03:25:14,311 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 03:25:14,311 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 694 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 1048 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 708 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 1103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 03:25:14,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [708 Valid, 650 Invalid, 1103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1048 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 03:25:14,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1460 states. [2024-10-14 03:25:14,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1460 to 1081. [2024-10-14 03:25:14,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1081 states, 966 states have (on average 1.5662525879917184) internal successors, (1513), 971 states have internal predecessors, (1513), 80 states have call successors, (80), 30 states have call predecessors, (80), 34 states have return successors, (93), 83 states have call predecessors, (93), 80 states have call successors, (93) [2024-10-14 03:25:14,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081 states to 1081 states and 1686 transitions. [2024-10-14 03:25:14,373 INFO L78 Accepts]: Start accepts. Automaton has 1081 states and 1686 transitions. Word has length 114 [2024-10-14 03:25:14,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:25:14,373 INFO L471 AbstractCegarLoop]: Abstraction has 1081 states and 1686 transitions. [2024-10-14 03:25:14,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 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:14,374 INFO L276 IsEmpty]: Start isEmpty. Operand 1081 states and 1686 transitions. [2024-10-14 03:25:14,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-14 03:25:14,375 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:25:14,375 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:25:14,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 03:25:14,375 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:25:14,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:25:14,375 INFO L85 PathProgramCache]: Analyzing trace with hash -669648084, now seen corresponding path program 1 times [2024-10-14 03:25:14,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:25:14,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427827570] [2024-10-14 03:25:14,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:25:14,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:25:14,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:14,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:25:14,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:14,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:25:14,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:14,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 03:25:14,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:14,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 03:25:14,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:14,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 03:25:14,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:14,504 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:14,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:25:14,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427827570] [2024-10-14 03:25:14,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427827570] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:25:14,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:25:14,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:25:14,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105479127] [2024-10-14 03:25:14,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:25:14,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:25:14,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:25:14,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:25:14,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:25:14,506 INFO L87 Difference]: Start difference. First operand 1081 states and 1686 transitions. Second operand has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 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,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:25:16,390 INFO L93 Difference]: Finished difference Result 4039 states and 6376 transitions. [2024-10-14 03:25:16,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 03:25:16,391 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 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 114 [2024-10-14 03:25:16,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:25:16,400 INFO L225 Difference]: With dead ends: 4039 [2024-10-14 03:25:16,400 INFO L226 Difference]: Without dead ends: 2971 [2024-10-14 03:25:16,402 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:16,403 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 1026 mSDsluCounter, 971 mSDsCounter, 0 mSdLazyCounter, 2712 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1038 SdHoareTripleChecker+Valid, 1270 SdHoareTripleChecker+Invalid, 2768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 2712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-14 03:25:16,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1038 Valid, 1270 Invalid, 2768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 2712 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-14 03:25:16,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2971 states. [2024-10-14 03:25:16,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2971 to 1923. [2024-10-14 03:25:16,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1923 states, 1724 states have (on average 1.5597447795823667) internal successors, (2689), 1733 states have internal predecessors, (2689), 136 states have call successors, (136), 54 states have call predecessors, (136), 62 states have return successors, (171), 143 states have call predecessors, (171), 136 states have call successors, (171) [2024-10-14 03:25:16,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1923 states to 1923 states and 2996 transitions. [2024-10-14 03:25:16,497 INFO L78 Accepts]: Start accepts. Automaton has 1923 states and 2996 transitions. Word has length 114 [2024-10-14 03:25:16,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:25:16,498 INFO L471 AbstractCegarLoop]: Abstraction has 1923 states and 2996 transitions. [2024-10-14 03:25:16,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 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,498 INFO L276 IsEmpty]: Start isEmpty. Operand 1923 states and 2996 transitions. [2024-10-14 03:25:16,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-14 03:25:16,500 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:25:16,500 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:25:16,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 03:25:16,501 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:25:16,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:25:16,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1684737198, now seen corresponding path program 1 times [2024-10-14 03:25:16,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:25:16,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613192217] [2024-10-14 03:25:16,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:25:16,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:25:16,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:16,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:25:16,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:16,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:25:16,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:16,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 03:25:16,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:16,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 03:25:16,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:16,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 03:25:16,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:16,646 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:16,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:25:16,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613192217] [2024-10-14 03:25:16,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613192217] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:25:16,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:25:16,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:25:16,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874147890] [2024-10-14 03:25:16,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:25:16,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:25:16,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:25:16,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:25:16,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:25:16,648 INFO L87 Difference]: Start difference. First operand 1923 states and 2996 transitions. Second operand has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 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,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:25:18,539 INFO L93 Difference]: Finished difference Result 7141 states and 11260 transitions. [2024-10-14 03:25:18,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 03:25:18,539 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 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 114 [2024-10-14 03:25:18,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:25:18,556 INFO L225 Difference]: With dead ends: 7141 [2024-10-14 03:25:18,556 INFO L226 Difference]: Without dead ends: 5231 [2024-10-14 03:25:18,559 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:18,560 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 1119 mSDsluCounter, 971 mSDsCounter, 0 mSdLazyCounter, 2390 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1139 SdHoareTripleChecker+Valid, 1270 SdHoareTripleChecker+Invalid, 2447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:25:18,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1139 Valid, 1270 Invalid, 2447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 2390 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-14 03:25:18,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5231 states. [2024-10-14 03:25:18,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5231 to 3617. [2024-10-14 03:25:18,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3617 states, 3254 states have (on average 1.5565457897971726) internal successors, (5065), 3271 states have internal predecessors, (5065), 244 states have call successors, (244), 102 states have call predecessors, (244), 118 states have return successors, (341), 259 states have call predecessors, (341), 244 states have call successors, (341) [2024-10-14 03:25:18,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3617 states to 3617 states and 5650 transitions. [2024-10-14 03:25:18,738 INFO L78 Accepts]: Start accepts. Automaton has 3617 states and 5650 transitions. Word has length 114 [2024-10-14 03:25:18,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:25:18,739 INFO L471 AbstractCegarLoop]: Abstraction has 3617 states and 5650 transitions. [2024-10-14 03:25:18,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 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,739 INFO L276 IsEmpty]: Start isEmpty. Operand 3617 states and 5650 transitions. [2024-10-14 03:25:18,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-14 03:25:18,742 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:25:18,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, 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:18,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 03:25:18,743 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:25:18,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:25:18,743 INFO L85 PathProgramCache]: Analyzing trace with hash 914003632, now seen corresponding path program 1 times [2024-10-14 03:25:18,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:25:18,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731134626] [2024-10-14 03:25:18,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:25:18,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:25:18,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:18,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:25:18,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:18,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:25:18,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:18,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 03:25:18,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:18,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 03:25:18,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:18,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 03:25:18,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:18,886 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:18,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:25:18,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731134626] [2024-10-14 03:25:18,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731134626] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:25:18,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:25:18,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:25:18,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307908448] [2024-10-14 03:25:18,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:25:18,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:25:18,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:25:18,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:25:18,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:25:18,888 INFO L87 Difference]: Start difference. First operand 3617 states and 5650 transitions. Second operand has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 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,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:25:21,020 INFO L93 Difference]: Finished difference Result 13353 states and 21088 transitions. [2024-10-14 03:25:21,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 03:25:21,020 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 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 114 [2024-10-14 03:25:21,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:25:21,052 INFO L225 Difference]: With dead ends: 13353 [2024-10-14 03:25:21,053 INFO L226 Difference]: Without dead ends: 9749 [2024-10-14 03:25:21,062 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:21,063 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 993 mSDsluCounter, 971 mSDsCounter, 0 mSdLazyCounter, 2672 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1005 SdHoareTripleChecker+Valid, 1270 SdHoareTripleChecker+Invalid, 2728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 2672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-14 03:25:21,063 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1005 Valid, 1270 Invalid, 2728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 2672 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-14 03:25:21,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9749 states. [2024-10-14 03:25:21,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9749 to 7002. [2024-10-14 03:25:21,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7002 states, 6319 states have (on average 1.55515113150815) internal successors, (9827), 6352 states have internal predecessors, (9827), 452 states have call successors, (452), 198 states have call predecessors, (452), 230 states have return successors, (727), 483 states have call predecessors, (727), 452 states have call successors, (727) [2024-10-14 03:25:21,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7002 states to 7002 states and 11006 transitions. [2024-10-14 03:25:21,542 INFO L78 Accepts]: Start accepts. Automaton has 7002 states and 11006 transitions. Word has length 114 [2024-10-14 03:25:21,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:25:21,543 INFO L471 AbstractCegarLoop]: Abstraction has 7002 states and 11006 transitions. [2024-10-14 03:25:21,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 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,543 INFO L276 IsEmpty]: Start isEmpty. Operand 7002 states and 11006 transitions. [2024-10-14 03:25:21,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-14 03:25:21,550 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:25:21,550 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:25:21,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 03:25:21,551 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:25:21,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:25:21,551 INFO L85 PathProgramCache]: Analyzing trace with hash -80690066, now seen corresponding path program 1 times [2024-10-14 03:25:21,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:25:21,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114481540] [2024-10-14 03:25:21,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:25:21,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:25:21,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:21,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:25:21,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:21,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:25:21,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:21,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 03:25:21,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:21,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 03:25:21,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:21,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 03:25:21,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:21,677 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,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:25:21,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114481540] [2024-10-14 03:25:21,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114481540] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:25:21,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:25:21,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:25:21,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186975894] [2024-10-14 03:25:21,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:25:21,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:25:21,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:25:21,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:25:21,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:25:21,678 INFO L87 Difference]: Start difference. First operand 7002 states and 11006 transitions. Second operand has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 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,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:25:22,732 INFO L93 Difference]: Finished difference Result 15900 states and 25296 transitions. [2024-10-14 03:25:22,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 03:25:22,733 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 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 114 [2024-10-14 03:25:22,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:25:22,768 INFO L225 Difference]: With dead ends: 15900 [2024-10-14 03:25:22,768 INFO L226 Difference]: Without dead ends: 8911 [2024-10-14 03:25:22,782 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:22,782 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 667 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 1039 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 681 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 1095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 03:25:22,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [681 Valid, 650 Invalid, 1095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1039 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 03:25:22,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8911 states. [2024-10-14 03:25:23,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8911 to 7002. [2024-10-14 03:25:23,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7002 states, 6319 states have (on average 1.5499287862003481) internal successors, (9794), 6352 states have internal predecessors, (9794), 452 states have call successors, (452), 198 states have call predecessors, (452), 230 states have return successors, (727), 483 states have call predecessors, (727), 452 states have call successors, (727) [2024-10-14 03:25:23,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7002 states to 7002 states and 10973 transitions. [2024-10-14 03:25:23,291 INFO L78 Accepts]: Start accepts. Automaton has 7002 states and 10973 transitions. Word has length 114 [2024-10-14 03:25:23,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:25:23,292 INFO L471 AbstractCegarLoop]: Abstraction has 7002 states and 10973 transitions. [2024-10-14 03:25:23,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 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,292 INFO L276 IsEmpty]: Start isEmpty. Operand 7002 states and 10973 transitions. [2024-10-14 03:25:23,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-14 03:25:23,300 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:25:23,300 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:25:23,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 03:25:23,300 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:25:23,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:25:23,301 INFO L85 PathProgramCache]: Analyzing trace with hash -666966288, now seen corresponding path program 1 times [2024-10-14 03:25:23,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:25:23,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915809649] [2024-10-14 03:25:23,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:25:23,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:25:23,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:23,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:25:23,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:23,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:25:23,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:23,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 03:25:23,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:23,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 03:25:23,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:23,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 03:25:23,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:23,422 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,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:25:23,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915809649] [2024-10-14 03:25:23,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915809649] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:25:23,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:25:23,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:25:23,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451964581] [2024-10-14 03:25:23,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:25:23,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:25:23,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:25:23,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:25:23,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:25:23,428 INFO L87 Difference]: Start difference. First operand 7002 states and 10973 transitions. Second operand has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 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,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:25:25,939 INFO L93 Difference]: Finished difference Result 25118 states and 39734 transitions. [2024-10-14 03:25:25,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 03:25:25,940 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 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 114 [2024-10-14 03:25:25,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:25:25,987 INFO L225 Difference]: With dead ends: 25118 [2024-10-14 03:25:25,988 INFO L226 Difference]: Without dead ends: 18129 [2024-10-14 03:25:26,007 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:26,008 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 967 mSDsluCounter, 971 mSDsCounter, 0 mSdLazyCounter, 2634 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 979 SdHoareTripleChecker+Valid, 1270 SdHoareTripleChecker+Invalid, 2690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 2634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-14 03:25:26,008 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [979 Valid, 1270 Invalid, 2690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 2634 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-14 03:25:26,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18129 states. [2024-10-14 03:25:26,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18129 to 13804. [2024-10-14 03:25:26,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13804 states, 12497 states have (on average 1.5483716091862048) internal successors, (19350), 12562 states have internal predecessors, (19350), 852 states have call successors, (852), 390 states have call predecessors, (852), 454 states have return successors, (1645), 915 states have call predecessors, (1645), 852 states have call successors, (1645) [2024-10-14 03:25:27,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13804 states to 13804 states and 21847 transitions. [2024-10-14 03:25:27,016 INFO L78 Accepts]: Start accepts. Automaton has 13804 states and 21847 transitions. Word has length 114 [2024-10-14 03:25:27,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:25:27,016 INFO L471 AbstractCegarLoop]: Abstraction has 13804 states and 21847 transitions. [2024-10-14 03:25:27,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 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,016 INFO L276 IsEmpty]: Start isEmpty. Operand 13804 states and 21847 transitions. [2024-10-14 03:25:27,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-14 03:25:27,030 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:25:27,030 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:25:27,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 03:25:27,030 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:25:27,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:25:27,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1669426222, now seen corresponding path program 1 times [2024-10-14 03:25:27,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:25:27,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392089134] [2024-10-14 03:25:27,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:25:27,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:25:27,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:27,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:25:27,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:27,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:25:27,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:27,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 03:25:27,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:27,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 03:25:27,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:27,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 03:25:27,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:27,147 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,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:25:27,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392089134] [2024-10-14 03:25:27,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392089134] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:25:27,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:25:27,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:25:27,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193472614] [2024-10-14 03:25:27,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:25:27,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:25:27,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:25:27,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:25:27,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:25:27,149 INFO L87 Difference]: Start difference. First operand 13804 states and 21847 transitions. Second operand has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 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:31,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:25:31,016 INFO L93 Difference]: Finished difference Result 48622 states and 77694 transitions. [2024-10-14 03:25:31,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 03:25:31,017 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 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 114 [2024-10-14 03:25:31,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:25:31,099 INFO L225 Difference]: With dead ends: 48622 [2024-10-14 03:25:31,099 INFO L226 Difference]: Without dead ends: 34831 [2024-10-14 03:25:31,127 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:31,128 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 966 mSDsluCounter, 971 mSDsCounter, 0 mSdLazyCounter, 2508 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 986 SdHoareTripleChecker+Valid, 1270 SdHoareTripleChecker+Invalid, 2566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 2508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:25:31,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [986 Valid, 1270 Invalid, 2566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 2508 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-14 03:25:31,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34831 states. [2024-10-14 03:25:32,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34831 to 27405. [2024-10-14 03:25:32,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27405 states, 24882 states have (on average 1.5481070653484446) internal successors, (38520), 25011 states have internal predecessors, (38520), 1620 states have call successors, (1620), 774 states have call predecessors, (1620), 902 states have return successors, (3935), 1747 states have call predecessors, (3935), 1620 states have call successors, (3935) [2024-10-14 03:25:32,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27405 states to 27405 states and 44075 transitions. [2024-10-14 03:25:32,614 INFO L78 Accepts]: Start accepts. Automaton has 27405 states and 44075 transitions. Word has length 114 [2024-10-14 03:25:32,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:25:32,615 INFO L471 AbstractCegarLoop]: Abstraction has 27405 states and 44075 transitions. [2024-10-14 03:25:32,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 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,616 INFO L276 IsEmpty]: Start isEmpty. Operand 27405 states and 44075 transitions. [2024-10-14 03:25:32,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-14 03:25:32,640 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:25:32,640 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:25:32,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 03:25:32,641 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:25:32,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:25:32,641 INFO L85 PathProgramCache]: Analyzing trace with hash -749058256, now seen corresponding path program 1 times [2024-10-14 03:25:32,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:25:32,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448476067] [2024-10-14 03:25:32,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:25:32,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:25:32,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:32,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:25:32,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:32,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:25:32,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:32,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 03:25:32,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:32,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 03:25:32,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:32,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 03:25:32,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:32,752 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:32,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:25:32,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448476067] [2024-10-14 03:25:32,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448476067] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:25:32,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:25:32,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:25:32,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767649916] [2024-10-14 03:25:32,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:25:32,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:25:32,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:25:32,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:25:32,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:25:32,753 INFO L87 Difference]: Start difference. First operand 27405 states and 44075 transitions. Second operand has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 4 states have internal predecessors, (104), 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,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:25:35,718 INFO L93 Difference]: Finished difference Result 60443 states and 97699 transitions. [2024-10-14 03:25:35,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 03:25:35,718 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 4 states have internal predecessors, (104), 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 114 [2024-10-14 03:25:35,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:25:35,835 INFO L225 Difference]: With dead ends: 60443 [2024-10-14 03:25:35,835 INFO L226 Difference]: Without dead ends: 33052 [2024-10-14 03:25:35,905 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:35,905 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 299 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 1172 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 1212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 03:25:35,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 726 Invalid, 1212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1172 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 03:25:35,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33052 states. [2024-10-14 03:25:37,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33052 to 27407. [2024-10-14 03:25:37,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27407 states, 24884 states have (on average 1.5429191448320205) internal successors, (38394), 25013 states have internal predecessors, (38394), 1620 states have call successors, (1620), 774 states have call predecessors, (1620), 902 states have return successors, (3935), 1747 states have call predecessors, (3935), 1620 states have call successors, (3935) [2024-10-14 03:25:37,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27407 states to 27407 states and 43949 transitions. [2024-10-14 03:25:37,834 INFO L78 Accepts]: Start accepts. Automaton has 27407 states and 43949 transitions. Word has length 114 [2024-10-14 03:25:37,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:25:37,834 INFO L471 AbstractCegarLoop]: Abstraction has 27407 states and 43949 transitions. [2024-10-14 03:25:37,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 4 states have internal predecessors, (104), 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,835 INFO L276 IsEmpty]: Start isEmpty. Operand 27407 states and 43949 transitions. [2024-10-14 03:25:37,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-14 03:25:37,859 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:25:37,859 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:25:37,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 03:25:37,859 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:25:37,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:25:37,860 INFO L85 PathProgramCache]: Analyzing trace with hash -721992654, now seen corresponding path program 1 times [2024-10-14 03:25:37,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:25:37,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555041512] [2024-10-14 03:25:37,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:25:37,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:25:37,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:37,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:25:37,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:37,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:25:37,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:37,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 03:25:37,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:37,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 03:25:37,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:37,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 03:25:37,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:37,960 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:37,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:25:37,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555041512] [2024-10-14 03:25:37,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555041512] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:25:37,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:25:37,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:25:37,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304181154] [2024-10-14 03:25:37,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:25:37,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:25:37,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:25:37,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:25:37,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:25:37,964 INFO L87 Difference]: Start difference. First operand 27407 states and 43949 transitions. Second operand has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 4 states have internal predecessors, (104), 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:40,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:25:40,321 INFO L93 Difference]: Finished difference Result 60705 states and 97834 transitions. [2024-10-14 03:25:40,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 03:25:40,321 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 4 states have internal predecessors, (104), 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 114 [2024-10-14 03:25:40,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:25:40,419 INFO L225 Difference]: With dead ends: 60705 [2024-10-14 03:25:40,419 INFO L226 Difference]: Without dead ends: 33312 [2024-10-14 03:25:40,480 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:40,481 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 310 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 1144 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 1184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 03:25:40,481 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 726 Invalid, 1184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1144 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 03:25:40,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33312 states. [2024-10-14 03:25:41,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33312 to 27665. [2024-10-14 03:25:41,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27665 states, 25142 states have (on average 1.5373478641317317) internal successors, (38652), 25271 states have internal predecessors, (38652), 1620 states have call successors, (1620), 774 states have call predecessors, (1620), 902 states have return successors, (3935), 1747 states have call predecessors, (3935), 1620 states have call successors, (3935) [2024-10-14 03:25:42,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27665 states to 27665 states and 44207 transitions. [2024-10-14 03:25:42,061 INFO L78 Accepts]: Start accepts. Automaton has 27665 states and 44207 transitions. Word has length 114 [2024-10-14 03:25:42,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:25:42,061 INFO L471 AbstractCegarLoop]: Abstraction has 27665 states and 44207 transitions. [2024-10-14 03:25:42,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 4 states have internal predecessors, (104), 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:42,062 INFO L276 IsEmpty]: Start isEmpty. Operand 27665 states and 44207 transitions. [2024-10-14 03:25:42,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-14 03:25:42,083 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:25:42,083 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:25:42,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 03:25:42,084 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:25:42,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:25:42,084 INFO L85 PathProgramCache]: Analyzing trace with hash -645091856, now seen corresponding path program 1 times [2024-10-14 03:25:42,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:25:42,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136928748] [2024-10-14 03:25:42,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:25:42,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:25:42,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:42,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:25:42,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:42,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:25:42,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:42,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 03:25:42,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:42,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 03:25:42,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:42,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 03:25:42,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:42,217 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:42,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:25:42,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136928748] [2024-10-14 03:25:42,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136928748] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:25:42,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:25:42,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:25:42,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765156474] [2024-10-14 03:25:42,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:25:42,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:25:42,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:25:42,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:25:42,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:25:42,219 INFO L87 Difference]: Start difference. First operand 27665 states and 44207 transitions. Second operand has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 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,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:25:51,860 INFO L93 Difference]: Finished difference Result 155764 states and 253817 transitions. [2024-10-14 03:25:51,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-14 03:25:51,861 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 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 114 [2024-10-14 03:25:51,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:25:52,312 INFO L225 Difference]: With dead ends: 155764 [2024-10-14 03:25:52,312 INFO L226 Difference]: Without dead ends: 128113 [2024-10-14 03:25:52,412 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2024-10-14 03:25:52,413 INFO L432 NwaCegarLoop]: 352 mSDtfsCounter, 2370 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 2222 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2384 SdHoareTripleChecker+Valid, 1198 SdHoareTripleChecker+Invalid, 2459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 2222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-14 03:25:52,413 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2384 Valid, 1198 Invalid, 2459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 2222 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-14 03:25:52,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128113 states. [2024-10-14 03:25:59,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128113 to 106092. [2024-10-14 03:25:59,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106092 states, 96532 states have (on average 1.5328699291426677) internal successors, (147971), 97045 states have internal predecessors, (147971), 5951 states have call successors, (5951), 3096 states have call predecessors, (5951), 3608 states have return successors, (17162), 6078 states have call predecessors, (17162), 5951 states have call successors, (17162) [2024-10-14 03:25:59,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106092 states to 106092 states and 171084 transitions. [2024-10-14 03:25:59,715 INFO L78 Accepts]: Start accepts. Automaton has 106092 states and 171084 transitions. Word has length 114 [2024-10-14 03:25:59,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:25:59,716 INFO L471 AbstractCegarLoop]: Abstraction has 106092 states and 171084 transitions. [2024-10-14 03:25:59,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 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:59,716 INFO L276 IsEmpty]: Start isEmpty. Operand 106092 states and 171084 transitions. [2024-10-14 03:25:59,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-14 03:25:59,741 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:25:59,745 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:25:59,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 03:25:59,745 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:25:59,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:25:59,746 INFO L85 PathProgramCache]: Analyzing trace with hash 261664591, now seen corresponding path program 1 times [2024-10-14 03:25:59,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:25:59,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727730239] [2024-10-14 03:25:59,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:25:59,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:25:59,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:59,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:25:59,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:59,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:25:59,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:59,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 03:25:59,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:59,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 03:25:59,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:59,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 03:25:59,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:25:59,862 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:59,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:25:59,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727730239] [2024-10-14 03:25:59,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727730239] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:25:59,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:25:59,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:25:59,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876523513] [2024-10-14 03:25:59,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:25:59,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:25:59,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:25:59,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:25:59,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:25:59,864 INFO L87 Difference]: Start difference. First operand 106092 states and 171084 transitions. Second operand has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 4 states have internal predecessors, (104), 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)