./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.5.ufo.BOUNDED-10.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 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/seq-mthreaded/pals_STARTPALS_ActiveStandby.5.ufo.BOUNDED-10.pals.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 b1fa78b32466948213cdbfc05d3adcde2ac2fc14323ec3ac2f4b441976452676 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 01:18:42,052 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 01:18:42,117 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 01:18:42,124 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 01:18:42,125 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 01:18:42,156 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 01:18:42,157 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 01:18:42,158 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 01:18:42,158 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 01:18:42,160 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 01:18:42,160 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 01:18:42,161 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 01:18:42,161 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 01:18:42,161 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 01:18:42,164 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 01:18:42,165 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 01:18:42,165 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 01:18:42,165 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 01:18:42,166 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 01:18:42,166 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 01:18:42,166 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 01:18:42,166 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 01:18:42,167 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 01:18:42,167 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 01:18:42,167 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 01:18:42,167 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 01:18:42,168 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 01:18:42,168 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 01:18:42,168 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 01:18:42,168 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 01:18:42,168 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 01:18:42,169 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 01:18:42,169 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 01:18:42,169 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 01:18:42,169 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 01:18:42,169 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 01:18:42,170 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 01:18:42,170 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 01:18:42,170 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 01:18:42,170 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 01:18:42,171 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 01:18:42,172 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 01:18:42,172 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 -> b1fa78b32466948213cdbfc05d3adcde2ac2fc14323ec3ac2f4b441976452676 [2024-10-24 01:18:42,464 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 01:18:42,488 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 01:18:42,491 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 01:18:42,492 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 01:18:42,493 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 01:18:42,494 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.5.ufo.BOUNDED-10.pals.c [2024-10-24 01:18:43,864 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 01:18:44,151 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 01:18:44,152 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.5.ufo.BOUNDED-10.pals.c [2024-10-24 01:18:44,165 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/965807c14/e2cdff7d430244afa36e6c2b2af2eea2/FLAG6d1b22f8b [2024-10-24 01:18:44,492 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/965807c14/e2cdff7d430244afa36e6c2b2af2eea2 [2024-10-24 01:18:44,494 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 01:18:44,495 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 01:18:44,497 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 01:18:44,497 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 01:18:44,503 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 01:18:44,504 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:18:44" (1/1) ... [2024-10-24 01:18:44,505 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ae961e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:18:44, skipping insertion in model container [2024-10-24 01:18:44,506 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:18:44" (1/1) ... [2024-10-24 01:18:44,553 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 01:18:44,857 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/seq-mthreaded/pals_STARTPALS_ActiveStandby.5.ufo.BOUNDED-10.pals.c[14595,14608] [2024-10-24 01:18:44,861 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 01:18:44,870 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 01:18:44,937 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/seq-mthreaded/pals_STARTPALS_ActiveStandby.5.ufo.BOUNDED-10.pals.c[14595,14608] [2024-10-24 01:18:44,937 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 01:18:44,957 INFO L204 MainTranslator]: Completed translation [2024-10-24 01:18:44,957 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:18:44 WrapperNode [2024-10-24 01:18:44,957 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 01:18:44,958 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 01:18:44,959 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 01:18:44,959 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 01:18:44,964 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:18:44" (1/1) ... [2024-10-24 01:18:44,976 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:18:44" (1/1) ... [2024-10-24 01:18:45,007 INFO L138 Inliner]: procedures = 32, calls = 47, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 511 [2024-10-24 01:18:45,008 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 01:18:45,009 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 01:18:45,009 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 01:18:45,009 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 01:18:45,020 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:18:44" (1/1) ... [2024-10-24 01:18:45,021 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:18:44" (1/1) ... [2024-10-24 01:18:45,026 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:18:44" (1/1) ... [2024-10-24 01:18:45,053 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-24 01:18:45,053 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:18:44" (1/1) ... [2024-10-24 01:18:45,054 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:18:44" (1/1) ... [2024-10-24 01:18:45,066 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:18:44" (1/1) ... [2024-10-24 01:18:45,076 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:18:44" (1/1) ... [2024-10-24 01:18:45,078 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:18:44" (1/1) ... [2024-10-24 01:18:45,085 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:18:44" (1/1) ... [2024-10-24 01:18:45,090 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 01:18:45,092 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 01:18:45,092 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 01:18:45,092 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 01:18:45,093 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:18:44" (1/1) ... [2024-10-24 01:18:45,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 01:18:45,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:18:45,127 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-24 01:18:45,131 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-24 01:18:45,177 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2024-10-24 01:18:45,178 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2024-10-24 01:18:45,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 01:18:45,179 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2024-10-24 01:18:45,179 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2024-10-24 01:18:45,179 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2024-10-24 01:18:45,179 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2024-10-24 01:18:45,179 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 01:18:45,180 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 01:18:45,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 01:18:45,181 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2024-10-24 01:18:45,181 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2024-10-24 01:18:45,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 01:18:45,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 01:18:45,181 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2024-10-24 01:18:45,181 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2024-10-24 01:18:45,302 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 01:18:45,304 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 01:18:45,954 INFO L? ?]: Removed 117 outVars from TransFormulas that were not future-live. [2024-10-24 01:18:45,955 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 01:18:46,020 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 01:18:46,020 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 01:18:46,021 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:18:46 BoogieIcfgContainer [2024-10-24 01:18:46,021 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 01:18:46,023 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 01:18:46,023 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 01:18:46,028 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 01:18:46,028 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 01:18:44" (1/3) ... [2024-10-24 01:18:46,029 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@413a43a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:18:46, skipping insertion in model container [2024-10-24 01:18:46,030 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:18:44" (2/3) ... [2024-10-24 01:18:46,030 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@413a43a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:18:46, skipping insertion in model container [2024-10-24 01:18:46,030 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:18:46" (3/3) ... [2024-10-24 01:18:46,032 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.5.ufo.BOUNDED-10.pals.c [2024-10-24 01:18:46,049 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 01:18:46,049 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 01:18:46,121 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 01:18:46,127 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;@345c90bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 01:18:46,127 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 01:18:46,135 INFO L276 IsEmpty]: Start isEmpty. Operand has 164 states, 127 states have (on average 1.6062992125984252) internal successors, (204), 128 states have internal predecessors, (204), 29 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-24 01:18:46,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-24 01:18:46,145 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:46,145 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] [2024-10-24 01:18:46,146 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:46,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:46,152 INFO L85 PathProgramCache]: Analyzing trace with hash 416796339, now seen corresponding path program 1 times [2024-10-24 01:18:46,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:46,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542766974] [2024-10-24 01:18:46,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:46,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:46,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:46,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 01:18:46,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:46,465 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-24 01:18:46,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:46,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542766974] [2024-10-24 01:18:46,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542766974] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:46,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:46,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 01:18:46,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147347144] [2024-10-24 01:18:46,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:46,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 01:18:46,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:46,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 01:18:46,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 01:18:46,508 INFO L87 Difference]: Start difference. First operand has 164 states, 127 states have (on average 1.6062992125984252) internal successors, (204), 128 states have internal predecessors, (204), 29 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 01:18:46,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:46,579 INFO L93 Difference]: Finished difference Result 313 states and 525 transitions. [2024-10-24 01:18:46,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 01:18:46,582 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-10-24 01:18:46,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:46,591 INFO L225 Difference]: With dead ends: 313 [2024-10-24 01:18:46,591 INFO L226 Difference]: Without dead ends: 162 [2024-10-24 01:18:46,595 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 01:18:46,599 INFO L432 NwaCegarLoop]: 253 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:18:46,600 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 253 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:18:46,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-10-24 01:18:46,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2024-10-24 01:18:46,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 126 states have (on average 1.5793650793650793) internal successors, (199), 126 states have internal predecessors, (199), 29 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-24 01:18:46,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 257 transitions. [2024-10-24 01:18:46,662 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 257 transitions. Word has length 23 [2024-10-24 01:18:46,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:46,662 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 257 transitions. [2024-10-24 01:18:46,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 01:18:46,663 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 257 transitions. [2024-10-24 01:18:46,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-24 01:18:46,664 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:46,665 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] [2024-10-24 01:18:46,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 01:18:46,665 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:46,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:46,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1577348367, now seen corresponding path program 1 times [2024-10-24 01:18:46,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:46,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215587329] [2024-10-24 01:18:46,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:46,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:46,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:46,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 01:18:46,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:46,965 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-24 01:18:46,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:46,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215587329] [2024-10-24 01:18:46,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215587329] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:46,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:46,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 01:18:46,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354283459] [2024-10-24 01:18:46,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:46,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 01:18:46,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:46,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 01:18:46,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 01:18:46,972 INFO L87 Difference]: Start difference. First operand 162 states and 257 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 01:18:47,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:47,135 INFO L93 Difference]: Finished difference Result 415 states and 665 transitions. [2024-10-24 01:18:47,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 01:18:47,136 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-10-24 01:18:47,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:47,139 INFO L225 Difference]: With dead ends: 415 [2024-10-24 01:18:47,139 INFO L226 Difference]: Without dead ends: 266 [2024-10-24 01:18:47,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 01:18:47,142 INFO L432 NwaCegarLoop]: 247 mSDtfsCounter, 127 mSDsluCounter, 967 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 1214 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:18:47,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 1214 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:18:47,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-10-24 01:18:47,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 162. [2024-10-24 01:18:47,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 126 states have (on average 1.4841269841269842) internal successors, (187), 126 states have internal predecessors, (187), 29 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-24 01:18:47,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 245 transitions. [2024-10-24 01:18:47,176 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 245 transitions. Word has length 23 [2024-10-24 01:18:47,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:47,176 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 245 transitions. [2024-10-24 01:18:47,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 01:18:47,177 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 245 transitions. [2024-10-24 01:18:47,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-24 01:18:47,178 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:47,178 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] [2024-10-24 01:18:47,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 01:18:47,178 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:47,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:47,179 INFO L85 PathProgramCache]: Analyzing trace with hash -2120967277, now seen corresponding path program 1 times [2024-10-24 01:18:47,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:47,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987307305] [2024-10-24 01:18:47,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:47,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:47,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:47,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:18:47,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:47,432 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-24 01:18:47,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:47,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987307305] [2024-10-24 01:18:47,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987307305] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:47,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:47,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:18:47,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726212858] [2024-10-24 01:18:47,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:47,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:18:47,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:47,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:18:47,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:18:47,438 INFO L87 Difference]: Start difference. First operand 162 states and 245 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 01:18:47,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:47,527 INFO L93 Difference]: Finished difference Result 312 states and 481 transitions. [2024-10-24 01:18:47,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:18:47,528 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2024-10-24 01:18:47,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:47,529 INFO L225 Difference]: With dead ends: 312 [2024-10-24 01:18:47,530 INFO L226 Difference]: Without dead ends: 166 [2024-10-24 01:18:47,531 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:18:47,535 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 3 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:18:47,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 692 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:18:47,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-10-24 01:18:47,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2024-10-24 01:18:47,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 129 states have (on average 1.4728682170542635) internal successors, (190), 129 states have internal predecessors, (190), 29 states have call successors, (29), 7 states have call predecessors, (29), 7 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-24 01:18:47,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 248 transitions. [2024-10-24 01:18:47,553 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 248 transitions. Word has length 34 [2024-10-24 01:18:47,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:47,553 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 248 transitions. [2024-10-24 01:18:47,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 01:18:47,553 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 248 transitions. [2024-10-24 01:18:47,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-24 01:18:47,556 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:47,556 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:18:47,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 01:18:47,557 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:47,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:47,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1787555156, now seen corresponding path program 1 times [2024-10-24 01:18:47,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:47,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118988027] [2024-10-24 01:18:47,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:47,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:47,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:47,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:18:47,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:47,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:18:47,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:47,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 01:18:47,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:47,647 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 01:18:47,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:47,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118988027] [2024-10-24 01:18:47,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118988027] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:47,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:47,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:18:47,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515664413] [2024-10-24 01:18:47,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:47,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:18:47,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:47,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:18:47,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:18:47,651 INFO L87 Difference]: Start difference. First operand 166 states and 248 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 01:18:47,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:47,703 INFO L93 Difference]: Finished difference Result 458 states and 695 transitions. [2024-10-24 01:18:47,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:18:47,704 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 48 [2024-10-24 01:18:47,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:47,707 INFO L225 Difference]: With dead ends: 458 [2024-10-24 01:18:47,707 INFO L226 Difference]: Without dead ends: 308 [2024-10-24 01:18:47,708 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:18:47,710 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 206 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:18:47,711 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 476 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:18:47,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2024-10-24 01:18:47,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 304. [2024-10-24 01:18:47,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 232 states have (on average 1.4913793103448276) internal successors, (346), 233 states have internal predecessors, (346), 57 states have call successors, (57), 14 states have call predecessors, (57), 14 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) [2024-10-24 01:18:47,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 460 transitions. [2024-10-24 01:18:47,739 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 460 transitions. Word has length 48 [2024-10-24 01:18:47,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:47,739 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 460 transitions. [2024-10-24 01:18:47,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 01:18:47,739 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 460 transitions. [2024-10-24 01:18:47,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-24 01:18:47,741 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:47,741 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:18:47,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 01:18:47,741 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:47,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:47,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1878750554, now seen corresponding path program 1 times [2024-10-24 01:18:47,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:47,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756874344] [2024-10-24 01:18:47,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:47,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:47,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:47,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:18:47,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:47,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:18:47,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:47,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 01:18:47,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:47,848 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 01:18:47,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:47,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756874344] [2024-10-24 01:18:47,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756874344] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:47,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:47,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:18:47,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731759569] [2024-10-24 01:18:47,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:47,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:18:47,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:47,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:18:47,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:18:47,850 INFO L87 Difference]: Start difference. First operand 304 states and 460 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 01:18:47,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:47,912 INFO L93 Difference]: Finished difference Result 860 states and 1310 transitions. [2024-10-24 01:18:47,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:18:47,912 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 49 [2024-10-24 01:18:47,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:47,918 INFO L225 Difference]: With dead ends: 860 [2024-10-24 01:18:47,918 INFO L226 Difference]: Without dead ends: 572 [2024-10-24 01:18:47,919 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:18:47,920 INFO L432 NwaCegarLoop]: 255 mSDtfsCounter, 202 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:18:47,920 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 491 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:18:47,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2024-10-24 01:18:47,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 559. [2024-10-24 01:18:47,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 417 states have (on average 1.4916067146282974) internal successors, (622), 420 states have internal predecessors, (622), 113 states have call successors, (113), 28 states have call predecessors, (113), 28 states have return successors, (113), 110 states have call predecessors, (113), 113 states have call successors, (113) [2024-10-24 01:18:47,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 848 transitions. [2024-10-24 01:18:47,980 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 848 transitions. Word has length 49 [2024-10-24 01:18:47,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:47,982 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 848 transitions. [2024-10-24 01:18:47,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 01:18:47,982 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 848 transitions. [2024-10-24 01:18:47,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-24 01:18:47,988 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:47,988 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:18:47,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 01:18:47,988 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:47,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:47,989 INFO L85 PathProgramCache]: Analyzing trace with hash 598886876, now seen corresponding path program 1 times [2024-10-24 01:18:47,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:47,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780462137] [2024-10-24 01:18:47,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:47,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:48,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:48,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:18:48,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:48,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:18:48,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:48,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 01:18:48,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:48,166 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 01:18:48,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:48,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780462137] [2024-10-24 01:18:48,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780462137] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:48,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:48,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 01:18:48,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028762988] [2024-10-24 01:18:48,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:48,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:18:48,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:48,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:18:48,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:18:48,169 INFO L87 Difference]: Start difference. First operand 559 states and 848 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 01:18:48,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:48,349 INFO L93 Difference]: Finished difference Result 1180 states and 1795 transitions. [2024-10-24 01:18:48,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:18:48,350 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 49 [2024-10-24 01:18:48,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:48,356 INFO L225 Difference]: With dead ends: 1180 [2024-10-24 01:18:48,358 INFO L226 Difference]: Without dead ends: 637 [2024-10-24 01:18:48,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:18:48,360 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 329 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:18:48,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 621 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:18:48,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2024-10-24 01:18:48,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 629. [2024-10-24 01:18:48,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 629 states, 479 states have (on average 1.4822546972860124) internal successors, (710), 482 states have internal predecessors, (710), 117 states have call successors, (117), 32 states have call predecessors, (117), 32 states have return successors, (117), 114 states have call predecessors, (117), 117 states have call successors, (117) [2024-10-24 01:18:48,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 944 transitions. [2024-10-24 01:18:48,417 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 944 transitions. Word has length 49 [2024-10-24 01:18:48,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:48,418 INFO L471 AbstractCegarLoop]: Abstraction has 629 states and 944 transitions. [2024-10-24 01:18:48,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 01:18:48,418 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 944 transitions. [2024-10-24 01:18:48,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-24 01:18:48,420 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:48,421 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:18:48,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 01:18:48,421 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:48,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:48,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1052158445, now seen corresponding path program 1 times [2024-10-24 01:18:48,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:48,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534968697] [2024-10-24 01:18:48,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:48,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:48,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:48,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:18:48,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:48,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:18:48,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:48,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 01:18:48,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:48,578 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 01:18:48,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:48,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534968697] [2024-10-24 01:18:48,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534968697] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:48,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:48,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 01:18:48,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125603449] [2024-10-24 01:18:48,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:48,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:18:48,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:48,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:18:48,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:18:48,581 INFO L87 Difference]: Start difference. First operand 629 states and 944 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 01:18:48,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:48,751 INFO L93 Difference]: Finished difference Result 1184 states and 1795 transitions. [2024-10-24 01:18:48,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:18:48,752 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 50 [2024-10-24 01:18:48,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:48,756 INFO L225 Difference]: With dead ends: 1184 [2024-10-24 01:18:48,756 INFO L226 Difference]: Without dead ends: 641 [2024-10-24 01:18:48,758 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:18:48,759 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 329 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:18:48,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 621 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:18:48,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2024-10-24 01:18:48,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 637. [2024-10-24 01:18:48,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 487 states have (on average 1.4743326488706365) internal successors, (718), 490 states have internal predecessors, (718), 117 states have call successors, (117), 32 states have call predecessors, (117), 32 states have return successors, (117), 114 states have call predecessors, (117), 117 states have call successors, (117) [2024-10-24 01:18:48,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 952 transitions. [2024-10-24 01:18:48,802 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 952 transitions. Word has length 50 [2024-10-24 01:18:48,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:48,804 INFO L471 AbstractCegarLoop]: Abstraction has 637 states and 952 transitions. [2024-10-24 01:18:48,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 01:18:48,804 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 952 transitions. [2024-10-24 01:18:48,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-24 01:18:48,805 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:48,805 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:18:48,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 01:18:48,806 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:48,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:48,808 INFO L85 PathProgramCache]: Analyzing trace with hash -130272225, now seen corresponding path program 1 times [2024-10-24 01:18:48,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:48,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921557136] [2024-10-24 01:18:48,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:48,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:48,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:48,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:18:48,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:48,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:18:48,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:48,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 01:18:48,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:48,963 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 01:18:48,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:48,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921557136] [2024-10-24 01:18:48,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921557136] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:48,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:48,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:18:48,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593013878] [2024-10-24 01:18:48,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:48,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:18:48,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:48,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:18:48,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:18:48,965 INFO L87 Difference]: Start difference. First operand 637 states and 952 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 01:18:49,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:49,156 INFO L93 Difference]: Finished difference Result 1180 states and 1783 transitions. [2024-10-24 01:18:49,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:18:49,157 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 52 [2024-10-24 01:18:49,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:49,162 INFO L225 Difference]: With dead ends: 1180 [2024-10-24 01:18:49,162 INFO L226 Difference]: Without dead ends: 637 [2024-10-24 01:18:49,164 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:18:49,169 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 49 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:18:49,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 620 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:18:49,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2024-10-24 01:18:49,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 637. [2024-10-24 01:18:49,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 487 states have (on average 1.4661190965092403) internal successors, (714), 490 states have internal predecessors, (714), 117 states have call successors, (117), 32 states have call predecessors, (117), 32 states have return successors, (117), 114 states have call predecessors, (117), 117 states have call successors, (117) [2024-10-24 01:18:49,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 948 transitions. [2024-10-24 01:18:49,221 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 948 transitions. Word has length 52 [2024-10-24 01:18:49,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:49,221 INFO L471 AbstractCegarLoop]: Abstraction has 637 states and 948 transitions. [2024-10-24 01:18:49,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 01:18:49,222 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 948 transitions. [2024-10-24 01:18:49,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-24 01:18:49,223 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:49,223 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:18:49,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 01:18:49,223 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:49,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:49,224 INFO L85 PathProgramCache]: Analyzing trace with hash -682908374, now seen corresponding path program 1 times [2024-10-24 01:18:49,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:49,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891915026] [2024-10-24 01:18:49,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:49,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:49,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:49,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:18:49,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:49,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:18:49,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:49,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 01:18:49,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:49,418 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 01:18:49,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:49,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891915026] [2024-10-24 01:18:49,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891915026] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:49,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:49,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:18:49,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245494986] [2024-10-24 01:18:49,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:49,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:18:49,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:49,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:18:49,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:18:49,421 INFO L87 Difference]: Start difference. First operand 637 states and 948 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-24 01:18:49,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:49,497 INFO L93 Difference]: Finished difference Result 1200 states and 1807 transitions. [2024-10-24 01:18:49,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:18:49,498 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 53 [2024-10-24 01:18:49,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:49,502 INFO L225 Difference]: With dead ends: 1200 [2024-10-24 01:18:49,502 INFO L226 Difference]: Without dead ends: 657 [2024-10-24 01:18:49,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:18:49,504 INFO L432 NwaCegarLoop]: 236 mSDtfsCounter, 4 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:18:49,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 704 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:18:49,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2024-10-24 01:18:49,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 657. [2024-10-24 01:18:49,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 503 states have (on average 1.4512922465208749) internal successors, (730), 506 states have internal predecessors, (730), 117 states have call successors, (117), 36 states have call predecessors, (117), 36 states have return successors, (117), 114 states have call predecessors, (117), 117 states have call successors, (117) [2024-10-24 01:18:49,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 964 transitions. [2024-10-24 01:18:49,541 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 964 transitions. Word has length 53 [2024-10-24 01:18:49,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:49,542 INFO L471 AbstractCegarLoop]: Abstraction has 657 states and 964 transitions. [2024-10-24 01:18:49,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-24 01:18:49,542 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 964 transitions. [2024-10-24 01:18:49,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-24 01:18:49,543 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:49,543 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:18:49,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 01:18:49,544 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:49,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:49,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1527575408, now seen corresponding path program 1 times [2024-10-24 01:18:49,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:49,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325606875] [2024-10-24 01:18:49,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:49,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:49,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:49,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:18:49,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:49,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:18:49,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:49,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 01:18:49,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:49,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 01:18:49,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:49,706 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 01:18:49,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:49,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325606875] [2024-10-24 01:18:49,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325606875] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:49,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:49,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:18:49,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520620459] [2024-10-24 01:18:49,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:49,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:18:49,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:49,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:18:49,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:18:49,708 INFO L87 Difference]: Start difference. First operand 657 states and 964 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-24 01:18:49,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:49,799 INFO L93 Difference]: Finished difference Result 1240 states and 1851 transitions. [2024-10-24 01:18:49,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:18:49,799 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 61 [2024-10-24 01:18:49,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:49,803 INFO L225 Difference]: With dead ends: 1240 [2024-10-24 01:18:49,804 INFO L226 Difference]: Without dead ends: 677 [2024-10-24 01:18:49,805 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:18:49,806 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 4 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:18:49,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 690 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:18:49,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2024-10-24 01:18:49,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 677. [2024-10-24 01:18:49,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 677 states, 519 states have (on average 1.4373795761078998) internal successors, (746), 522 states have internal predecessors, (746), 117 states have call successors, (117), 40 states have call predecessors, (117), 40 states have return successors, (117), 114 states have call predecessors, (117), 117 states have call successors, (117) [2024-10-24 01:18:49,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 980 transitions. [2024-10-24 01:18:49,847 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 980 transitions. Word has length 61 [2024-10-24 01:18:49,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:49,848 INFO L471 AbstractCegarLoop]: Abstraction has 677 states and 980 transitions. [2024-10-24 01:18:49,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-24 01:18:49,848 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 980 transitions. [2024-10-24 01:18:49,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-24 01:18:49,849 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:49,850 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:18:49,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 01:18:49,850 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:49,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:49,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1184701862, now seen corresponding path program 1 times [2024-10-24 01:18:49,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:49,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207266130] [2024-10-24 01:18:49,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:49,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:49,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:50,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:18:50,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:50,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:18:50,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:50,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 01:18:50,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:50,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 01:18:50,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:50,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 01:18:50,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:50,019 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 01:18:50,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:50,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207266130] [2024-10-24 01:18:50,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207266130] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:50,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:50,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:18:50,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295866535] [2024-10-24 01:18:50,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:50,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:18:50,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:50,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:18:50,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:18:50,022 INFO L87 Difference]: Start difference. First operand 677 states and 980 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-24 01:18:50,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:50,104 INFO L93 Difference]: Finished difference Result 1276 states and 1867 transitions. [2024-10-24 01:18:50,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:18:50,105 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 69 [2024-10-24 01:18:50,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:50,110 INFO L225 Difference]: With dead ends: 1276 [2024-10-24 01:18:50,110 INFO L226 Difference]: Without dead ends: 693 [2024-10-24 01:18:50,112 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:18:50,112 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 3 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:18:50,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 700 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:18:50,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2024-10-24 01:18:50,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 693. [2024-10-24 01:18:50,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 693 states, 531 states have (on average 1.4274952919020716) internal successors, (758), 534 states have internal predecessors, (758), 117 states have call successors, (117), 44 states have call predecessors, (117), 44 states have return successors, (117), 114 states have call predecessors, (117), 117 states have call successors, (117) [2024-10-24 01:18:50,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 992 transitions. [2024-10-24 01:18:50,153 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 992 transitions. Word has length 69 [2024-10-24 01:18:50,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:50,154 INFO L471 AbstractCegarLoop]: Abstraction has 693 states and 992 transitions. [2024-10-24 01:18:50,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-24 01:18:50,154 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 992 transitions. [2024-10-24 01:18:50,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-24 01:18:50,155 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:50,155 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:18:50,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 01:18:50,156 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:50,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:50,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1211757441, now seen corresponding path program 1 times [2024-10-24 01:18:50,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:50,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375750675] [2024-10-24 01:18:50,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:50,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:50,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:50,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:18:50,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:50,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:18:50,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:50,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 01:18:50,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:50,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 01:18:50,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:50,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 01:18:50,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:50,332 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 01:18:50,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:50,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375750675] [2024-10-24 01:18:50,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375750675] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:50,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:50,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:18:50,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343298155] [2024-10-24 01:18:50,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:50,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:18:50,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:50,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:18:50,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:18:50,334 INFO L87 Difference]: Start difference. First operand 693 states and 992 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-24 01:18:50,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:50,416 INFO L93 Difference]: Finished difference Result 1312 states and 1907 transitions. [2024-10-24 01:18:50,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:18:50,417 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 69 [2024-10-24 01:18:50,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:50,422 INFO L225 Difference]: With dead ends: 1312 [2024-10-24 01:18:50,422 INFO L226 Difference]: Without dead ends: 713 [2024-10-24 01:18:50,424 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:18:50,424 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 4 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:18:50,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 690 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:18:50,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2024-10-24 01:18:50,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 713. [2024-10-24 01:18:50,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 713 states, 547 states have (on average 1.4149908592321756) internal successors, (774), 550 states have internal predecessors, (774), 117 states have call successors, (117), 48 states have call predecessors, (117), 48 states have return successors, (117), 114 states have call predecessors, (117), 117 states have call successors, (117) [2024-10-24 01:18:50,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 1008 transitions. [2024-10-24 01:18:50,489 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 1008 transitions. Word has length 69 [2024-10-24 01:18:50,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:50,490 INFO L471 AbstractCegarLoop]: Abstraction has 713 states and 1008 transitions. [2024-10-24 01:18:50,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-24 01:18:50,490 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 1008 transitions. [2024-10-24 01:18:50,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-24 01:18:50,492 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:50,492 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:18:50,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 01:18:50,492 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:50,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:50,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1107298427, now seen corresponding path program 1 times [2024-10-24 01:18:50,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:50,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306395194] [2024-10-24 01:18:50,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:50,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:50,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:50,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:18:50,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:50,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:18:50,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:50,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 01:18:50,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:50,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 01:18:50,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:50,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 01:18:50,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:50,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 01:18:50,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:50,687 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-24 01:18:50,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:50,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306395194] [2024-10-24 01:18:50,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306395194] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:50,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:50,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:18:50,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631262488] [2024-10-24 01:18:50,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:50,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:18:50,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:50,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:18:50,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:18:50,689 INFO L87 Difference]: Start difference. First operand 713 states and 1008 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-24 01:18:50,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:50,763 INFO L93 Difference]: Finished difference Result 1356 states and 1935 transitions. [2024-10-24 01:18:50,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:18:50,764 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 77 [2024-10-24 01:18:50,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:50,768 INFO L225 Difference]: With dead ends: 1356 [2024-10-24 01:18:50,769 INFO L226 Difference]: Without dead ends: 737 [2024-10-24 01:18:50,770 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:18:50,771 INFO L432 NwaCegarLoop]: 237 mSDtfsCounter, 5 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:18:50,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 702 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:18:50,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2024-10-24 01:18:50,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 737. [2024-10-24 01:18:50,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 737 states, 567 states have (on average 1.400352733686067) internal successors, (794), 570 states have internal predecessors, (794), 117 states have call successors, (117), 52 states have call predecessors, (117), 52 states have return successors, (117), 114 states have call predecessors, (117), 117 states have call successors, (117) [2024-10-24 01:18:50,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1028 transitions. [2024-10-24 01:18:50,809 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1028 transitions. Word has length 77 [2024-10-24 01:18:50,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:50,810 INFO L471 AbstractCegarLoop]: Abstraction has 737 states and 1028 transitions. [2024-10-24 01:18:50,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-24 01:18:50,810 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1028 transitions. [2024-10-24 01:18:50,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-24 01:18:50,812 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:50,812 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:18:50,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 01:18:50,812 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:50,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:50,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1484136390, now seen corresponding path program 1 times [2024-10-24 01:18:50,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:50,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034415552] [2024-10-24 01:18:50,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:50,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:50,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:51,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:18:51,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:51,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:18:51,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:51,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 01:18:51,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:51,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 01:18:51,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:51,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 01:18:51,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:51,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 01:18:51,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:51,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 01:18:51,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:51,420 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-24 01:18:51,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:51,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034415552] [2024-10-24 01:18:51,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034415552] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:51,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:51,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:18:51,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550586020] [2024-10-24 01:18:51,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:51,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:18:51,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:51,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:18:51,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:18:51,422 INFO L87 Difference]: Start difference. First operand 737 states and 1028 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-24 01:18:51,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:51,730 INFO L93 Difference]: Finished difference Result 1938 states and 2686 transitions. [2024-10-24 01:18:51,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 01:18:51,731 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 80 [2024-10-24 01:18:51,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:51,738 INFO L225 Difference]: With dead ends: 1938 [2024-10-24 01:18:51,738 INFO L226 Difference]: Without dead ends: 1295 [2024-10-24 01:18:51,740 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-24 01:18:51,741 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 185 mSDsluCounter, 1119 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 1360 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 01:18:51,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 1360 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 01:18:51,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1295 states. [2024-10-24 01:18:51,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1295 to 882. [2024-10-24 01:18:51,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 675 states have (on average 1.3911111111111112) internal successors, (939), 679 states have internal predecessors, (939), 141 states have call successors, (141), 65 states have call predecessors, (141), 65 states have return successors, (141), 137 states have call predecessors, (141), 141 states have call successors, (141) [2024-10-24 01:18:51,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1221 transitions. [2024-10-24 01:18:51,805 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1221 transitions. Word has length 80 [2024-10-24 01:18:51,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:51,805 INFO L471 AbstractCegarLoop]: Abstraction has 882 states and 1221 transitions. [2024-10-24 01:18:51,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-24 01:18:51,806 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1221 transitions. [2024-10-24 01:18:51,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-24 01:18:51,807 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:51,807 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:18:51,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 01:18:51,807 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:51,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:51,808 INFO L85 PathProgramCache]: Analyzing trace with hash -861295851, now seen corresponding path program 1 times [2024-10-24 01:18:51,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:51,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556763388] [2024-10-24 01:18:51,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:51,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:51,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:51,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:18:51,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:51,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:18:51,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:51,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 01:18:51,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:51,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 01:18:51,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:51,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 01:18:51,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:51,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 01:18:51,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:51,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 01:18:51,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:51,964 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-24 01:18:51,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:51,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556763388] [2024-10-24 01:18:51,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556763388] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:51,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:51,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:18:51,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676596180] [2024-10-24 01:18:51,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:51,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:18:51,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:51,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:18:51,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:18:51,966 INFO L87 Difference]: Start difference. First operand 882 states and 1221 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 01:18:52,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:52,088 INFO L93 Difference]: Finished difference Result 1653 states and 2307 transitions. [2024-10-24 01:18:52,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:18:52,089 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 84 [2024-10-24 01:18:52,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:52,095 INFO L225 Difference]: With dead ends: 1653 [2024-10-24 01:18:52,095 INFO L226 Difference]: Without dead ends: 902 [2024-10-24 01:18:52,097 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:18:52,098 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 3 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:18:52,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 700 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:18:52,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2024-10-24 01:18:52,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 902. [2024-10-24 01:18:52,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 902 states, 690 states have (on average 1.382608695652174) internal successors, (954), 694 states have internal predecessors, (954), 141 states have call successors, (141), 70 states have call predecessors, (141), 70 states have return successors, (141), 137 states have call predecessors, (141), 141 states have call successors, (141) [2024-10-24 01:18:52,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1236 transitions. [2024-10-24 01:18:52,161 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1236 transitions. Word has length 84 [2024-10-24 01:18:52,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:52,161 INFO L471 AbstractCegarLoop]: Abstraction has 902 states and 1236 transitions. [2024-10-24 01:18:52,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 01:18:52,162 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1236 transitions. [2024-10-24 01:18:52,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-24 01:18:52,163 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:52,163 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:18:52,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 01:18:52,163 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:52,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:52,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1191143078, now seen corresponding path program 1 times [2024-10-24 01:18:52,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:52,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359280225] [2024-10-24 01:18:52,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:52,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:52,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:52,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:18:52,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:52,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:18:52,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:52,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 01:18:52,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:52,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 01:18:52,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:52,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 01:18:52,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:52,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 01:18:52,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:52,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 01:18:52,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:52,444 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-24 01:18:52,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:52,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359280225] [2024-10-24 01:18:52,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359280225] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:52,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:52,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 01:18:52,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261769579] [2024-10-24 01:18:52,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:52,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 01:18:52,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:52,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 01:18:52,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 01:18:52,446 INFO L87 Difference]: Start difference. First operand 902 states and 1236 transitions. Second operand has 6 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 01:18:52,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:52,639 INFO L93 Difference]: Finished difference Result 1299 states and 1882 transitions. [2024-10-24 01:18:52,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 01:18:52,640 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 83 [2024-10-24 01:18:52,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:52,647 INFO L225 Difference]: With dead ends: 1299 [2024-10-24 01:18:52,648 INFO L226 Difference]: Without dead ends: 1297 [2024-10-24 01:18:52,648 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:18:52,649 INFO L432 NwaCegarLoop]: 412 mSDtfsCounter, 130 mSDsluCounter, 1469 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 1881 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:18:52,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 1881 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:18:52,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1297 states. [2024-10-24 01:18:52,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1297 to 904. [2024-10-24 01:18:52,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 904 states, 690 states have (on average 1.382608695652174) internal successors, (954), 695 states have internal predecessors, (954), 142 states have call successors, (142), 71 states have call predecessors, (142), 71 states have return successors, (142), 137 states have call predecessors, (142), 142 states have call successors, (142) [2024-10-24 01:18:52,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1238 transitions. [2024-10-24 01:18:52,728 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1238 transitions. Word has length 83 [2024-10-24 01:18:52,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:52,728 INFO L471 AbstractCegarLoop]: Abstraction has 904 states and 1238 transitions. [2024-10-24 01:18:52,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 01:18:52,728 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1238 transitions. [2024-10-24 01:18:52,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-24 01:18:52,730 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:52,730 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:18:52,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 01:18:52,730 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:52,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:52,731 INFO L85 PathProgramCache]: Analyzing trace with hash 358448366, now seen corresponding path program 1 times [2024-10-24 01:18:52,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:52,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145679841] [2024-10-24 01:18:52,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:52,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:52,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:52,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:18:52,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:52,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:18:52,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:52,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 01:18:52,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:52,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 01:18:52,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:52,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 01:18:52,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:52,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 01:18:52,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:52,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 01:18:52,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:52,901 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-24 01:18:52,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:52,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145679841] [2024-10-24 01:18:52,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145679841] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:52,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:52,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:18:52,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93018759] [2024-10-24 01:18:52,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:52,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:18:52,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:52,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:18:52,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:18:52,904 INFO L87 Difference]: Start difference. First operand 904 states and 1238 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-24 01:18:53,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:53,115 INFO L93 Difference]: Finished difference Result 1690 states and 2331 transitions. [2024-10-24 01:18:53,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 01:18:53,115 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 86 [2024-10-24 01:18:53,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:53,122 INFO L225 Difference]: With dead ends: 1690 [2024-10-24 01:18:53,122 INFO L226 Difference]: Without dead ends: 958 [2024-10-24 01:18:53,124 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-24 01:18:53,125 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 226 mSDsluCounter, 1138 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 1377 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:18:53,125 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 1377 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:18:53,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2024-10-24 01:18:53,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 916. [2024-10-24 01:18:53,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 916 states, 707 states have (on average 1.3804809052333804) internal successors, (976), 716 states have internal predecessors, (976), 136 states have call successors, (136), 72 states have call predecessors, (136), 72 states have return successors, (136), 127 states have call predecessors, (136), 136 states have call successors, (136) [2024-10-24 01:18:53,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1248 transitions. [2024-10-24 01:18:53,220 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1248 transitions. Word has length 86 [2024-10-24 01:18:53,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:53,221 INFO L471 AbstractCegarLoop]: Abstraction has 916 states and 1248 transitions. [2024-10-24 01:18:53,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-24 01:18:53,221 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1248 transitions. [2024-10-24 01:18:53,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-24 01:18:53,222 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:53,223 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:18:53,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-24 01:18:53,223 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:53,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:53,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1587701740, now seen corresponding path program 1 times [2024-10-24 01:18:53,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:53,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325419618] [2024-10-24 01:18:53,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:53,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:53,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:53,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:18:53,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:53,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:18:53,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:53,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 01:18:53,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:53,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 01:18:53,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:53,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 01:18:53,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:53,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 01:18:53,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:53,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 01:18:53,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:53,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 01:18:53,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:53,785 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-24 01:18:53,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:53,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325419618] [2024-10-24 01:18:53,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325419618] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:53,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:53,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:18:53,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522708819] [2024-10-24 01:18:53,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:53,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:18:53,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:53,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:18:53,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:18:53,788 INFO L87 Difference]: Start difference. First operand 916 states and 1248 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-24 01:18:54,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:54,039 INFO L93 Difference]: Finished difference Result 1669 states and 2286 transitions. [2024-10-24 01:18:54,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 01:18:54,040 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 88 [2024-10-24 01:18:54,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:54,051 INFO L225 Difference]: With dead ends: 1669 [2024-10-24 01:18:54,051 INFO L226 Difference]: Without dead ends: 915 [2024-10-24 01:18:54,054 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-24 01:18:54,055 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 128 mSDsluCounter, 1183 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 1437 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:18:54,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 1437 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:18:54,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2024-10-24 01:18:54,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 905. [2024-10-24 01:18:54,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 699 states have (on average 1.3791130185979972) internal successors, (964), 708 states have internal predecessors, (964), 134 states have call successors, (134), 71 states have call predecessors, (134), 71 states have return successors, (134), 125 states have call predecessors, (134), 134 states have call successors, (134) [2024-10-24 01:18:54,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1232 transitions. [2024-10-24 01:18:54,124 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1232 transitions. Word has length 88 [2024-10-24 01:18:54,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:54,124 INFO L471 AbstractCegarLoop]: Abstraction has 905 states and 1232 transitions. [2024-10-24 01:18:54,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-24 01:18:54,125 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1232 transitions. [2024-10-24 01:18:54,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-24 01:18:54,126 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:54,126 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:18:54,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-24 01:18:54,126 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:54,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:54,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1454977024, now seen corresponding path program 1 times [2024-10-24 01:18:54,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:54,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346899145] [2024-10-24 01:18:54,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:54,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:54,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:54,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:18:54,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:54,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:18:54,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:54,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 01:18:54,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:54,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 01:18:54,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:54,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 01:18:54,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:54,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 01:18:54,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:54,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 01:18:54,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:54,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 01:18:54,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:54,654 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-24 01:18:54,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:54,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346899145] [2024-10-24 01:18:54,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346899145] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:54,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:54,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 01:18:54,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125249276] [2024-10-24 01:18:54,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:54,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:18:54,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:54,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:18:54,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:18:54,656 INFO L87 Difference]: Start difference. First operand 905 states and 1232 transitions. Second operand has 8 states, 8 states have (on average 8.25) internal successors, (66), 7 states have internal predecessors, (66), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-24 01:18:55,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:55,084 INFO L93 Difference]: Finished difference Result 1734 states and 2344 transitions. [2024-10-24 01:18:55,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 01:18:55,084 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 7 states have internal predecessors, (66), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 89 [2024-10-24 01:18:55,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:55,090 INFO L225 Difference]: With dead ends: 1734 [2024-10-24 01:18:55,090 INFO L226 Difference]: Without dead ends: 960 [2024-10-24 01:18:55,092 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-10-24 01:18:55,092 INFO L432 NwaCegarLoop]: 251 mSDtfsCounter, 520 mSDsluCounter, 882 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 1133 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 01:18:55,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 1133 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 01:18:55,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2024-10-24 01:18:55,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 921. [2024-10-24 01:18:55,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 707 states have (on average 1.3536067892503536) internal successors, (957), 717 states have internal predecessors, (957), 137 states have call successors, (137), 76 states have call predecessors, (137), 76 states have return successors, (137), 127 states have call predecessors, (137), 137 states have call successors, (137) [2024-10-24 01:18:55,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1231 transitions. [2024-10-24 01:18:55,165 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1231 transitions. Word has length 89 [2024-10-24 01:18:55,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:55,166 INFO L471 AbstractCegarLoop]: Abstraction has 921 states and 1231 transitions. [2024-10-24 01:18:55,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 7 states have internal predecessors, (66), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-24 01:18:55,166 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1231 transitions. [2024-10-24 01:18:55,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-24 01:18:55,167 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:55,167 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:18:55,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-24 01:18:55,168 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:55,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:55,168 INFO L85 PathProgramCache]: Analyzing trace with hash -2130270663, now seen corresponding path program 1 times [2024-10-24 01:18:55,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:55,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673490342] [2024-10-24 01:18:55,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:55,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:55,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:55,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:18:55,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:55,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-24 01:18:55,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:55,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 01:18:55,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:55,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 01:18:55,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:55,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 01:18:55,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:55,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-24 01:18:55,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:55,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 01:18:55,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:55,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 01:18:55,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:55,281 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-24 01:18:55,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:55,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673490342] [2024-10-24 01:18:55,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673490342] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:55,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:55,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:18:55,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644397762] [2024-10-24 01:18:55,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:55,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:18:55,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:55,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:18:55,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:18:55,284 INFO L87 Difference]: Start difference. First operand 921 states and 1231 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 01:18:55,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:55,504 INFO L93 Difference]: Finished difference Result 2454 states and 3293 transitions. [2024-10-24 01:18:55,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:18:55,505 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 90 [2024-10-24 01:18:55,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:55,514 INFO L225 Difference]: With dead ends: 2454 [2024-10-24 01:18:55,514 INFO L226 Difference]: Without dead ends: 1715 [2024-10-24 01:18:55,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:18:55,517 INFO L432 NwaCegarLoop]: 419 mSDtfsCounter, 189 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 1054 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:18:55,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 1054 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:18:55,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1715 states. [2024-10-24 01:18:55,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1715 to 1488. [2024-10-24 01:18:55,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1488 states, 1131 states have (on average 1.3448275862068966) internal successors, (1521), 1147 states have internal predecessors, (1521), 231 states have call successors, (231), 125 states have call predecessors, (231), 125 states have return successors, (231), 215 states have call predecessors, (231), 231 states have call successors, (231) [2024-10-24 01:18:55,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1488 states to 1488 states and 1983 transitions. [2024-10-24 01:18:55,645 INFO L78 Accepts]: Start accepts. Automaton has 1488 states and 1983 transitions. Word has length 90 [2024-10-24 01:18:55,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:55,645 INFO L471 AbstractCegarLoop]: Abstraction has 1488 states and 1983 transitions. [2024-10-24 01:18:55,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 01:18:55,646 INFO L276 IsEmpty]: Start isEmpty. Operand 1488 states and 1983 transitions. [2024-10-24 01:18:55,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-24 01:18:55,647 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:55,647 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:18:55,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-24 01:18:55,647 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:55,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:55,648 INFO L85 PathProgramCache]: Analyzing trace with hash -2050336594, now seen corresponding path program 1 times [2024-10-24 01:18:55,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:55,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220046036] [2024-10-24 01:18:55,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:55,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:55,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:56,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:18:56,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:56,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-24 01:18:56,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:56,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 01:18:56,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:56,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 01:18:56,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:56,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 01:18:56,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:56,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-24 01:18:56,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:56,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 01:18:56,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:56,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 01:18:56,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:56,179 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-24 01:18:56,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:56,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220046036] [2024-10-24 01:18:56,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220046036] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:56,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:56,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:18:56,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880519899] [2024-10-24 01:18:56,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:56,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:18:56,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:56,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:18:56,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:18:56,182 INFO L87 Difference]: Start difference. First operand 1488 states and 1983 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 01:18:56,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:56,868 INFO L93 Difference]: Finished difference Result 3054 states and 4059 transitions. [2024-10-24 01:18:56,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 01:18:56,869 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 92 [2024-10-24 01:18:56,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:56,881 INFO L225 Difference]: With dead ends: 3054 [2024-10-24 01:18:56,881 INFO L226 Difference]: Without dead ends: 1820 [2024-10-24 01:18:56,885 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-10-24 01:18:56,885 INFO L432 NwaCegarLoop]: 272 mSDtfsCounter, 465 mSDsluCounter, 973 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 1245 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 01:18:56,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 1245 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 01:18:56,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1820 states. [2024-10-24 01:18:57,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1820 to 1515. [2024-10-24 01:18:57,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1515 states, 1145 states have (on average 1.337117903930131) internal successors, (1531), 1162 states have internal predecessors, (1531), 239 states have call successors, (239), 130 states have call predecessors, (239), 130 states have return successors, (239), 222 states have call predecessors, (239), 239 states have call successors, (239) [2024-10-24 01:18:57,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1515 states to 1515 states and 2009 transitions. [2024-10-24 01:18:57,072 INFO L78 Accepts]: Start accepts. Automaton has 1515 states and 2009 transitions. Word has length 92 [2024-10-24 01:18:57,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:57,072 INFO L471 AbstractCegarLoop]: Abstraction has 1515 states and 2009 transitions. [2024-10-24 01:18:57,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 01:18:57,073 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 2009 transitions. [2024-10-24 01:18:57,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-24 01:18:57,074 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:57,074 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:18:57,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-24 01:18:57,075 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:57,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:57,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1554073978, now seen corresponding path program 1 times [2024-10-24 01:18:57,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:57,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268930768] [2024-10-24 01:18:57,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:57,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:57,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:57,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:18:57,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:57,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 01:18:57,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:57,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 01:18:57,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:57,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 01:18:57,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:57,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-24 01:18:57,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:57,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 01:18:57,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:57,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 01:18:57,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:57,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 01:18:57,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:57,196 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-24 01:18:57,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:57,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268930768] [2024-10-24 01:18:57,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268930768] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:57,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:57,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:18:57,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229778563] [2024-10-24 01:18:57,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:57,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:18:57,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:57,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:18:57,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:18:57,199 INFO L87 Difference]: Start difference. First operand 1515 states and 2009 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 01:18:57,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:57,467 INFO L93 Difference]: Finished difference Result 3793 states and 5057 transitions. [2024-10-24 01:18:57,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:18:57,467 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 94 [2024-10-24 01:18:57,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:57,482 INFO L225 Difference]: With dead ends: 3793 [2024-10-24 01:18:57,483 INFO L226 Difference]: Without dead ends: 2575 [2024-10-24 01:18:57,487 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:18:57,488 INFO L432 NwaCegarLoop]: 435 mSDtfsCounter, 194 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 1092 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:18:57,489 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 1092 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:18:57,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2575 states. [2024-10-24 01:18:57,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2575 to 2394. [2024-10-24 01:18:57,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2394 states, 1787 states have (on average 1.3240067151650812) internal successors, (2366), 1814 states have internal predecessors, (2366), 394 states have call successors, (394), 212 states have call predecessors, (394), 212 states have return successors, (394), 367 states have call predecessors, (394), 394 states have call successors, (394) [2024-10-24 01:18:57,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2394 states to 2394 states and 3154 transitions. [2024-10-24 01:18:57,755 INFO L78 Accepts]: Start accepts. Automaton has 2394 states and 3154 transitions. Word has length 94 [2024-10-24 01:18:57,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:57,755 INFO L471 AbstractCegarLoop]: Abstraction has 2394 states and 3154 transitions. [2024-10-24 01:18:57,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 01:18:57,756 INFO L276 IsEmpty]: Start isEmpty. Operand 2394 states and 3154 transitions. [2024-10-24 01:18:57,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-24 01:18:57,758 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:57,758 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:18:57,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-24 01:18:57,758 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:57,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:57,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1814016471, now seen corresponding path program 1 times [2024-10-24 01:18:57,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:57,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437403677] [2024-10-24 01:18:57,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:57,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:57,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:57,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:18:57,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:57,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 01:18:57,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:57,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 01:18:57,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:57,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 01:18:57,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:57,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 01:18:57,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:57,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 01:18:57,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:57,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-24 01:18:57,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:57,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 01:18:57,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:57,834 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-24 01:18:57,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:57,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437403677] [2024-10-24 01:18:57,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437403677] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:57,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:57,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:18:57,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854641035] [2024-10-24 01:18:57,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:57,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:18:57,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:57,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:18:57,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:18:57,837 INFO L87 Difference]: Start difference. First operand 2394 states and 3154 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 01:18:58,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:58,091 INFO L93 Difference]: Finished difference Result 4605 states and 6088 transitions. [2024-10-24 01:18:58,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:18:58,092 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 94 [2024-10-24 01:18:58,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:58,110 INFO L225 Difference]: With dead ends: 4605 [2024-10-24 01:18:58,111 INFO L226 Difference]: Without dead ends: 2403 [2024-10-24 01:18:58,118 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:18:58,119 INFO L432 NwaCegarLoop]: 237 mSDtfsCounter, 3 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:18:58,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 447 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:18:58,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2403 states. [2024-10-24 01:18:58,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2403 to 2397. [2024-10-24 01:18:58,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2397 states, 1790 states have (on average 1.323463687150838) internal successors, (2369), 1817 states have internal predecessors, (2369), 394 states have call successors, (394), 212 states have call predecessors, (394), 212 states have return successors, (394), 367 states have call predecessors, (394), 394 states have call successors, (394) [2024-10-24 01:18:58,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2397 states to 2397 states and 3157 transitions. [2024-10-24 01:18:58,391 INFO L78 Accepts]: Start accepts. Automaton has 2397 states and 3157 transitions. Word has length 94 [2024-10-24 01:18:58,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:58,392 INFO L471 AbstractCegarLoop]: Abstraction has 2397 states and 3157 transitions. [2024-10-24 01:18:58,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 01:18:58,392 INFO L276 IsEmpty]: Start isEmpty. Operand 2397 states and 3157 transitions. [2024-10-24 01:18:58,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-24 01:18:58,395 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:58,395 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:18:58,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-24 01:18:58,395 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:58,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:58,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1948537536, now seen corresponding path program 1 times [2024-10-24 01:18:58,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:58,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132378332] [2024-10-24 01:18:58,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:58,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:58,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:58,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:18:58,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:58,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 01:18:58,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:58,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 01:18:58,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:58,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 01:18:58,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:58,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 01:18:58,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:58,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 01:18:58,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:58,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-24 01:18:58,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:58,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 01:18:58,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:58,506 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-24 01:18:58,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:58,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132378332] [2024-10-24 01:18:58,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132378332] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:58,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:58,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:18:58,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621428673] [2024-10-24 01:18:58,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:58,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:18:58,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:58,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:18:58,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:18:58,509 INFO L87 Difference]: Start difference. First operand 2397 states and 3157 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 01:18:58,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:58,896 INFO L93 Difference]: Finished difference Result 5712 states and 7554 transitions. [2024-10-24 01:18:58,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:18:58,897 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 94 [2024-10-24 01:18:58,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:58,921 INFO L225 Difference]: With dead ends: 5712 [2024-10-24 01:18:58,922 INFO L226 Difference]: Without dead ends: 3729 [2024-10-24 01:18:58,932 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:18:58,933 INFO L432 NwaCegarLoop]: 446 mSDtfsCounter, 188 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 1106 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:18:58,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 1106 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:18:58,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3729 states. [2024-10-24 01:18:59,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3729 to 3302. [2024-10-24 01:18:59,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3302 states, 2456 states have (on average 1.3188110749185669) internal successors, (3239), 2493 states have internal predecessors, (3239), 551 states have call successors, (551), 294 states have call predecessors, (551), 294 states have return successors, (551), 514 states have call predecessors, (551), 551 states have call successors, (551) [2024-10-24 01:18:59,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3302 states to 3302 states and 4341 transitions. [2024-10-24 01:18:59,399 INFO L78 Accepts]: Start accepts. Automaton has 3302 states and 4341 transitions. Word has length 94 [2024-10-24 01:18:59,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:59,400 INFO L471 AbstractCegarLoop]: Abstraction has 3302 states and 4341 transitions. [2024-10-24 01:18:59,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 01:18:59,401 INFO L276 IsEmpty]: Start isEmpty. Operand 3302 states and 4341 transitions. [2024-10-24 01:18:59,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-24 01:18:59,404 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:59,404 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:18:59,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-24 01:18:59,405 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:59,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:59,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1698817225, now seen corresponding path program 1 times [2024-10-24 01:18:59,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:59,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129992475] [2024-10-24 01:18:59,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:59,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:59,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:59,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:18:59,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:59,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 01:18:59,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:59,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 01:18:59,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:59,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 01:18:59,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:59,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 01:18:59,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:59,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-24 01:18:59,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:59,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 01:18:59,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:59,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 01:18:59,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:59,574 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-24 01:18:59,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:59,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129992475] [2024-10-24 01:18:59,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129992475] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:59,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:59,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:18:59,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875967092] [2024-10-24 01:18:59,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:59,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:18:59,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:59,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:18:59,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:18:59,577 INFO L87 Difference]: Start difference. First operand 3302 states and 4341 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 01:18:59,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:59,850 INFO L93 Difference]: Finished difference Result 6278 states and 8272 transitions. [2024-10-24 01:18:59,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:18:59,851 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 95 [2024-10-24 01:18:59,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:59,910 INFO L225 Difference]: With dead ends: 6278 [2024-10-24 01:18:59,910 INFO L226 Difference]: Without dead ends: 3038 [2024-10-24 01:18:59,919 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:18:59,919 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 69 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:18:59,920 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 693 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:18:59,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3038 states. [2024-10-24 01:19:00,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3038 to 2939. [2024-10-24 01:19:00,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2939 states, 2170 states have (on average 1.3225806451612903) internal successors, (2870), 2194 states have internal predecessors, (2870), 502 states have call successors, (502), 266 states have call predecessors, (502), 266 states have return successors, (502), 478 states have call predecessors, (502), 502 states have call successors, (502) [2024-10-24 01:19:00,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2939 states to 2939 states and 3874 transitions. [2024-10-24 01:19:00,189 INFO L78 Accepts]: Start accepts. Automaton has 2939 states and 3874 transitions. Word has length 95 [2024-10-24 01:19:00,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:19:00,189 INFO L471 AbstractCegarLoop]: Abstraction has 2939 states and 3874 transitions. [2024-10-24 01:19:00,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 01:19:00,190 INFO L276 IsEmpty]: Start isEmpty. Operand 2939 states and 3874 transitions. [2024-10-24 01:19:00,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-24 01:19:00,191 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:19:00,192 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:19:00,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-24 01:19:00,192 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:19:00,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:19:00,192 INFO L85 PathProgramCache]: Analyzing trace with hash -655751939, now seen corresponding path program 1 times [2024-10-24 01:19:00,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:19:00,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027715299] [2024-10-24 01:19:00,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:00,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:19:00,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:00,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:19:00,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:00,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 01:19:00,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:00,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 01:19:00,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:00,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 01:19:00,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:00,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 01:19:00,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:00,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-24 01:19:00,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:00,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 01:19:00,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:00,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 01:19:00,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:00,263 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-24 01:19:00,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:19:00,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027715299] [2024-10-24 01:19:00,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027715299] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:19:00,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:19:00,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:19:00,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665029661] [2024-10-24 01:19:00,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:19:00,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:19:00,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:19:00,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:19:00,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:19:00,265 INFO L87 Difference]: Start difference. First operand 2939 states and 3874 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 01:19:00,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:19:00,553 INFO L93 Difference]: Finished difference Result 5737 states and 7591 transitions. [2024-10-24 01:19:00,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:19:00,554 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 97 [2024-10-24 01:19:00,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:19:00,581 INFO L225 Difference]: With dead ends: 5737 [2024-10-24 01:19:00,581 INFO L226 Difference]: Without dead ends: 2967 [2024-10-24 01:19:00,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:19:00,595 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 4 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:19:00,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 445 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:19:00,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2967 states. [2024-10-24 01:19:00,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2967 to 2946. [2024-10-24 01:19:00,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2946 states, 2177 states have (on average 1.3215434083601285) internal successors, (2877), 2201 states have internal predecessors, (2877), 502 states have call successors, (502), 266 states have call predecessors, (502), 266 states have return successors, (502), 478 states have call predecessors, (502), 502 states have call successors, (502) [2024-10-24 01:19:00,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2946 states to 2946 states and 3881 transitions. [2024-10-24 01:19:00,901 INFO L78 Accepts]: Start accepts. Automaton has 2946 states and 3881 transitions. Word has length 97 [2024-10-24 01:19:00,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:19:00,901 INFO L471 AbstractCegarLoop]: Abstraction has 2946 states and 3881 transitions. [2024-10-24 01:19:00,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 01:19:00,902 INFO L276 IsEmpty]: Start isEmpty. Operand 2946 states and 3881 transitions. [2024-10-24 01:19:00,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-24 01:19:00,903 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:19:00,903 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:19:00,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-24 01:19:00,904 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:19:00,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:19:00,904 INFO L85 PathProgramCache]: Analyzing trace with hash 365285769, now seen corresponding path program 1 times [2024-10-24 01:19:00,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:19:00,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418916355] [2024-10-24 01:19:00,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:00,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:19:00,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:01,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:19:01,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:01,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 01:19:01,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:01,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 01:19:01,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:01,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 01:19:01,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:01,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 01:19:01,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:01,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-24 01:19:01,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:01,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 01:19:01,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:01,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 01:19:01,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:01,042 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-24 01:19:01,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:19:01,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418916355] [2024-10-24 01:19:01,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418916355] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:19:01,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:19:01,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:19:01,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480072093] [2024-10-24 01:19:01,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:19:01,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:19:01,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:19:01,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:19:01,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:19:01,044 INFO L87 Difference]: Start difference. First operand 2946 states and 3881 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 01:19:01,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:19:01,294 INFO L93 Difference]: Finished difference Result 5700 states and 7530 transitions. [2024-10-24 01:19:01,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:19:01,295 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 97 [2024-10-24 01:19:01,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:19:01,312 INFO L225 Difference]: With dead ends: 5700 [2024-10-24 01:19:01,312 INFO L226 Difference]: Without dead ends: 2863 [2024-10-24 01:19:01,320 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:19:01,321 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 56 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:19:01,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 686 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:19:01,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2863 states. [2024-10-24 01:19:01,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2863 to 2708. [2024-10-24 01:19:01,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2708 states, 1998 states have (on average 1.3208208208208208) internal successors, (2639), 2017 states have internal predecessors, (2639), 464 states have call successors, (464), 245 states have call predecessors, (464), 245 states have return successors, (464), 445 states have call predecessors, (464), 464 states have call successors, (464) [2024-10-24 01:19:01,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2708 states to 2708 states and 3567 transitions. [2024-10-24 01:19:01,603 INFO L78 Accepts]: Start accepts. Automaton has 2708 states and 3567 transitions. Word has length 97 [2024-10-24 01:19:01,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:19:01,603 INFO L471 AbstractCegarLoop]: Abstraction has 2708 states and 3567 transitions. [2024-10-24 01:19:01,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 01:19:01,604 INFO L276 IsEmpty]: Start isEmpty. Operand 2708 states and 3567 transitions. [2024-10-24 01:19:01,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-24 01:19:01,609 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:19:01,609 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:19:01,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-24 01:19:01,609 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:19:01,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:19:01,610 INFO L85 PathProgramCache]: Analyzing trace with hash 290510463, now seen corresponding path program 1 times [2024-10-24 01:19:01,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:19:01,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886914640] [2024-10-24 01:19:01,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:01,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:19:01,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:01,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:19:02,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:02,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:19:02,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:02,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 01:19:02,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:02,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 01:19:02,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:02,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 01:19:02,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:02,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 01:19:02,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:02,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 01:19:02,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:02,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 01:19:02,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:02,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 01:19:02,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:02,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 01:19:02,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:02,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-24 01:19:02,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:02,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 01:19:02,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:02,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-24 01:19:02,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:02,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 01:19:02,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:02,048 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-24 01:19:02,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:19:02,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886914640] [2024-10-24 01:19:02,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886914640] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 01:19:02,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840429311] [2024-10-24 01:19:02,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:02,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:19:02,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:19:02,052 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 01:19:02,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 01:19:02,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:02,249 INFO L255 TraceCheckSpWp]: Trace formula consists of 626 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-24 01:19:02,264 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 01:19:02,567 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 27 proven. 42 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-24 01:19:02,567 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 01:19:02,927 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-24 01:19:02,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [840429311] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 01:19:02,927 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 01:19:02,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 8] total 22 [2024-10-24 01:19:02,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077934959] [2024-10-24 01:19:02,928 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 01:19:02,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-24 01:19:02,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:19:02,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-24 01:19:02,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2024-10-24 01:19:02,930 INFO L87 Difference]: Start difference. First operand 2708 states and 3567 transitions. Second operand has 22 states, 22 states have (on average 10.181818181818182) internal successors, (224), 20 states have internal predecessors, (224), 9 states have call successors, (41), 4 states have call predecessors, (41), 7 states have return successors, (40), 11 states have call predecessors, (40), 9 states have call successors, (40) [2024-10-24 01:19:07,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:19:07,897 INFO L93 Difference]: Finished difference Result 11204 states and 14683 transitions. [2024-10-24 01:19:07,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2024-10-24 01:19:07,900 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 10.181818181818182) internal successors, (224), 20 states have internal predecessors, (224), 9 states have call successors, (41), 4 states have call predecessors, (41), 7 states have return successors, (40), 11 states have call predecessors, (40), 9 states have call successors, (40) Word has length 141 [2024-10-24 01:19:07,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:19:07,936 INFO L225 Difference]: With dead ends: 11204 [2024-10-24 01:19:07,937 INFO L226 Difference]: Without dead ends: 8707 [2024-10-24 01:19:07,946 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1844 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1180, Invalid=5300, Unknown=0, NotChecked=0, Total=6480 [2024-10-24 01:19:07,947 INFO L432 NwaCegarLoop]: 324 mSDtfsCounter, 5164 mSDsluCounter, 2949 mSDsCounter, 0 mSdLazyCounter, 1510 mSolverCounterSat, 1937 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5164 SdHoareTripleChecker+Valid, 3273 SdHoareTripleChecker+Invalid, 3447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1937 IncrementalHoareTripleChecker+Valid, 1510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-24 01:19:07,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5164 Valid, 3273 Invalid, 3447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1937 Valid, 1510 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-24 01:19:07,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8707 states. [2024-10-24 01:19:08,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8707 to 7259. [2024-10-24 01:19:08,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7259 states, 5342 states have (on average 1.30887308124298) internal successors, (6992), 5394 states have internal predecessors, (6992), 1239 states have call successors, (1239), 677 states have call predecessors, (1239), 677 states have return successors, (1239), 1187 states have call predecessors, (1239), 1239 states have call successors, (1239) [2024-10-24 01:19:08,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7259 states to 7259 states and 9470 transitions. [2024-10-24 01:19:08,730 INFO L78 Accepts]: Start accepts. Automaton has 7259 states and 9470 transitions. Word has length 141 [2024-10-24 01:19:08,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:19:08,731 INFO L471 AbstractCegarLoop]: Abstraction has 7259 states and 9470 transitions. [2024-10-24 01:19:08,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 10.181818181818182) internal successors, (224), 20 states have internal predecessors, (224), 9 states have call successors, (41), 4 states have call predecessors, (41), 7 states have return successors, (40), 11 states have call predecessors, (40), 9 states have call successors, (40) [2024-10-24 01:19:08,732 INFO L276 IsEmpty]: Start isEmpty. Operand 7259 states and 9470 transitions. [2024-10-24 01:19:08,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-24 01:19:08,744 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:19:08,744 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:19:08,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-24 01:19:08,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-10-24 01:19:08,949 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:19:08,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:19:08,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1827178492, now seen corresponding path program 1 times [2024-10-24 01:19:08,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:19:08,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118531230] [2024-10-24 01:19:08,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:08,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:19:09,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:09,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:19:09,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:09,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 01:19:09,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:09,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 01:19:09,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:09,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 01:19:09,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:09,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-24 01:19:09,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:09,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 01:19:09,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:09,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 01:19:09,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:09,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 01:19:09,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:09,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 01:19:09,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:09,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 01:19:09,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:09,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 01:19:09,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:09,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 01:19:09,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:09,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 01:19:09,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:09,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-24 01:19:09,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:09,917 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 19 proven. 6 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-24 01:19:09,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:19:09,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118531230] [2024-10-24 01:19:09,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118531230] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 01:19:09,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056355217] [2024-10-24 01:19:09,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:09,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:19:09,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:19:09,920 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 01:19:09,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 01:19:10,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:10,111 INFO L255 TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-24 01:19:10,118 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 01:19:10,377 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 48 proven. 20 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-24 01:19:10,379 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 01:19:10,652 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-24 01:19:10,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056355217] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 01:19:10,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-24 01:19:10,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9, 11] total 25 [2024-10-24 01:19:10,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025427159] [2024-10-24 01:19:10,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:19:10,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 01:19:10,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:19:10,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 01:19:10,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2024-10-24 01:19:10,655 INFO L87 Difference]: Start difference. First operand 7259 states and 9470 transitions. Second operand has 9 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2024-10-24 01:19:11,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:19:11,626 INFO L93 Difference]: Finished difference Result 14113 states and 18457 transitions. [2024-10-24 01:19:11,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 01:19:11,627 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 144 [2024-10-24 01:19:11,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:19:11,666 INFO L225 Difference]: With dead ends: 14113 [2024-10-24 01:19:11,666 INFO L226 Difference]: Without dead ends: 7326 [2024-10-24 01:19:11,688 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 301 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=666, Unknown=0, NotChecked=0, Total=756 [2024-10-24 01:19:11,689 INFO L432 NwaCegarLoop]: 249 mSDtfsCounter, 252 mSDsluCounter, 1131 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 1380 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 01:19:11,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 1380 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 01:19:11,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7326 states. [2024-10-24 01:19:12,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7326 to 5851. [2024-10-24 01:19:12,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5851 states, 4328 states have (on average 1.3128465804066543) internal successors, (5682), 4366 states have internal predecessors, (5682), 981 states have call successors, (981), 541 states have call predecessors, (981), 541 states have return successors, (981), 943 states have call predecessors, (981), 981 states have call successors, (981) [2024-10-24 01:19:12,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5851 states to 5851 states and 7644 transitions. [2024-10-24 01:19:12,443 INFO L78 Accepts]: Start accepts. Automaton has 5851 states and 7644 transitions. Word has length 144 [2024-10-24 01:19:12,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:19:12,444 INFO L471 AbstractCegarLoop]: Abstraction has 5851 states and 7644 transitions. [2024-10-24 01:19:12,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2024-10-24 01:19:12,445 INFO L276 IsEmpty]: Start isEmpty. Operand 5851 states and 7644 transitions. [2024-10-24 01:19:12,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-24 01:19:12,457 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:19:12,457 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:19:12,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-24 01:19:12,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-10-24 01:19:12,658 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:19:12,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:19:12,659 INFO L85 PathProgramCache]: Analyzing trace with hash 125444847, now seen corresponding path program 1 times [2024-10-24 01:19:12,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:19:12,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120663154] [2024-10-24 01:19:12,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:12,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:19:12,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:13,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:19:13,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:13,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 01:19:13,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:13,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 01:19:13,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:13,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 01:19:13,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:13,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-24 01:19:13,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:13,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 01:19:13,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:13,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 01:19:13,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:13,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 01:19:13,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:13,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 01:19:13,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:13,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 01:19:13,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:13,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 01:19:13,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:13,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 01:19:13,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:13,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 01:19:13,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:13,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-24 01:19:13,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:13,460 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-24 01:19:13,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:19:13,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120663154] [2024-10-24 01:19:13,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120663154] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 01:19:13,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [88010385] [2024-10-24 01:19:13,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:13,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:19:13,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:19:13,463 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 01:19:13,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-24 01:19:13,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:13,647 INFO L255 TraceCheckSpWp]: Trace formula consists of 677 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-24 01:19:13,652 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 01:19:13,924 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 17 proven. 53 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-24 01:19:13,924 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 01:19:14,215 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-24 01:19:14,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [88010385] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 01:19:14,216 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 01:19:14,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 9] total 24 [2024-10-24 01:19:14,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174338869] [2024-10-24 01:19:14,216 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 01:19:14,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-24 01:19:14,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:19:14,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-24 01:19:14,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=481, Unknown=0, NotChecked=0, Total=552 [2024-10-24 01:19:14,219 INFO L87 Difference]: Start difference. First operand 5851 states and 7644 transitions. Second operand has 24 states, 24 states have (on average 10.083333333333334) internal successors, (242), 20 states have internal predecessors, (242), 7 states have call successors, (40), 5 states have call predecessors, (40), 10 states have return successors, (39), 11 states have call predecessors, (39), 7 states have call successors, (39) [2024-10-24 01:19:17,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:19:17,151 INFO L93 Difference]: Finished difference Result 15562 states and 20339 transitions. [2024-10-24 01:19:17,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-10-24 01:19:17,151 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 10.083333333333334) internal successors, (242), 20 states have internal predecessors, (242), 7 states have call successors, (40), 5 states have call predecessors, (40), 10 states have return successors, (39), 11 states have call predecessors, (39), 7 states have call successors, (39) Word has length 145 [2024-10-24 01:19:17,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:19:17,200 INFO L225 Difference]: With dead ends: 15562 [2024-10-24 01:19:17,200 INFO L226 Difference]: Without dead ends: 9917 [2024-10-24 01:19:17,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 900 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=692, Invalid=3340, Unknown=0, NotChecked=0, Total=4032 [2024-10-24 01:19:17,217 INFO L432 NwaCegarLoop]: 511 mSDtfsCounter, 1598 mSDsluCounter, 4573 mSDsCounter, 0 mSdLazyCounter, 2153 mSolverCounterSat, 568 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1598 SdHoareTripleChecker+Valid, 5084 SdHoareTripleChecker+Invalid, 2721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 568 IncrementalHoareTripleChecker+Valid, 2153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-24 01:19:17,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1598 Valid, 5084 Invalid, 2721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [568 Valid, 2153 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-24 01:19:17,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9917 states. [2024-10-24 01:19:17,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9917 to 6037. [2024-10-24 01:19:17,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6037 states, 4466 states have (on average 1.30653828929691) internal successors, (5835), 4507 states have internal predecessors, (5835), 1011 states have call successors, (1011), 559 states have call predecessors, (1011), 559 states have return successors, (1011), 970 states have call predecessors, (1011), 1011 states have call successors, (1011) [2024-10-24 01:19:17,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6037 states to 6037 states and 7857 transitions. [2024-10-24 01:19:17,847 INFO L78 Accepts]: Start accepts. Automaton has 6037 states and 7857 transitions. Word has length 145 [2024-10-24 01:19:17,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:19:17,848 INFO L471 AbstractCegarLoop]: Abstraction has 6037 states and 7857 transitions. [2024-10-24 01:19:17,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 10.083333333333334) internal successors, (242), 20 states have internal predecessors, (242), 7 states have call successors, (40), 5 states have call predecessors, (40), 10 states have return successors, (39), 11 states have call predecessors, (39), 7 states have call successors, (39) [2024-10-24 01:19:17,848 INFO L276 IsEmpty]: Start isEmpty. Operand 6037 states and 7857 transitions. [2024-10-24 01:19:17,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-24 01:19:17,857 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:19:17,857 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:19:17,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-24 01:19:18,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:19:18,058 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:19:18,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:19:18,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1304878967, now seen corresponding path program 1 times [2024-10-24 01:19:18,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:19:18,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406335326] [2024-10-24 01:19:18,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:18,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:19:18,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:18,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:19:18,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:18,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-24 01:19:18,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:18,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 01:19:18,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:18,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 01:19:18,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:18,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 01:19:18,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:18,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 01:19:18,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:18,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 01:19:18,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:18,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 01:19:18,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:18,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 01:19:18,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:18,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 01:19:18,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:18,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 01:19:18,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:18,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 01:19:18,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:18,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 01:19:18,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:18,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-24 01:19:18,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:18,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-24 01:19:18,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:18,273 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-10-24 01:19:18,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:19:18,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406335326] [2024-10-24 01:19:18,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406335326] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:19:18,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:19:18,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:19:18,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129640820] [2024-10-24 01:19:18,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:19:18,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:19:18,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:19:18,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:19:18,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:19:18,276 INFO L87 Difference]: Start difference. First operand 6037 states and 7857 transitions. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 6 states have internal predecessors, (89), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 01:19:19,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:19:19,709 INFO L93 Difference]: Finished difference Result 17723 states and 23129 transitions. [2024-10-24 01:19:19,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 01:19:19,710 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 6 states have internal predecessors, (89), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 153 [2024-10-24 01:19:19,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:19:19,767 INFO L225 Difference]: With dead ends: 17723 [2024-10-24 01:19:19,768 INFO L226 Difference]: Without dead ends: 11993 [2024-10-24 01:19:19,784 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-24 01:19:19,785 INFO L432 NwaCegarLoop]: 372 mSDtfsCounter, 212 mSDsluCounter, 1639 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 2011 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 01:19:19,785 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 2011 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 01:19:19,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11993 states. [2024-10-24 01:19:20,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11993 to 7588. [2024-10-24 01:19:20,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7588 states, 5581 states have (on average 1.3047840888729618) internal successors, (7282), 5633 states have internal predecessors, (7282), 1304 states have call successors, (1304), 702 states have call predecessors, (1304), 702 states have return successors, (1304), 1252 states have call predecessors, (1304), 1304 states have call successors, (1304) [2024-10-24 01:19:20,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7588 states to 7588 states and 9890 transitions. [2024-10-24 01:19:20,638 INFO L78 Accepts]: Start accepts. Automaton has 7588 states and 9890 transitions. Word has length 153 [2024-10-24 01:19:20,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:19:20,639 INFO L471 AbstractCegarLoop]: Abstraction has 7588 states and 9890 transitions. [2024-10-24 01:19:20,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 6 states have internal predecessors, (89), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 01:19:20,639 INFO L276 IsEmpty]: Start isEmpty. Operand 7588 states and 9890 transitions. [2024-10-24 01:19:20,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-24 01:19:20,651 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:19:20,651 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:19:20,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-24 01:19:20,651 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:19:20,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:19:20,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1232073042, now seen corresponding path program 1 times [2024-10-24 01:19:20,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:19:20,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322406767] [2024-10-24 01:19:20,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:20,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:19:20,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:21,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:19:21,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:21,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-24 01:19:21,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:21,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 01:19:21,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:21,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 01:19:21,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:21,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 01:19:21,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:21,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 01:19:21,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:21,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 01:19:21,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:21,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 01:19:21,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:21,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 01:19:21,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:21,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 01:19:21,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:21,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-24 01:19:21,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:21,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 01:19:21,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:21,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-24 01:19:21,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:21,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 01:19:21,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:21,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-24 01:19:21,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:21,044 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-10-24 01:19:21,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:19:21,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322406767] [2024-10-24 01:19:21,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322406767] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 01:19:21,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [966706129] [2024-10-24 01:19:21,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:21,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:19:21,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:19:21,048 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 01:19:21,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-24 01:19:21,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:21,241 INFO L255 TraceCheckSpWp]: Trace formula consists of 684 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-24 01:19:21,246 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 01:19:21,646 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 57 proven. 18 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-24 01:19:21,646 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 01:19:22,049 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-10-24 01:19:22,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [966706129] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 01:19:22,050 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 01:19:22,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 9] total 22 [2024-10-24 01:19:22,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792290351] [2024-10-24 01:19:22,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 01:19:22,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-24 01:19:22,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:19:22,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-24 01:19:22,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2024-10-24 01:19:22,053 INFO L87 Difference]: Start difference. First operand 7588 states and 9890 transitions. Second operand has 22 states, 22 states have (on average 11.0) internal successors, (242), 22 states have internal predecessors, (242), 9 states have call successors, (41), 5 states have call predecessors, (41), 6 states have return successors, (40), 9 states have call predecessors, (40), 9 states have call successors, (40) [2024-10-24 01:19:27,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:19:27,311 INFO L93 Difference]: Finished difference Result 21926 states and 28747 transitions. [2024-10-24 01:19:27,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2024-10-24 01:19:27,312 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 11.0) internal successors, (242), 22 states have internal predecessors, (242), 9 states have call successors, (41), 5 states have call predecessors, (41), 6 states have return successors, (40), 9 states have call predecessors, (40), 9 states have call successors, (40) Word has length 155 [2024-10-24 01:19:27,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:19:27,367 INFO L225 Difference]: With dead ends: 21926 [2024-10-24 01:19:27,368 INFO L226 Difference]: Without dead ends: 14633 [2024-10-24 01:19:27,388 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 523 GetRequests, 374 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8751 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2870, Invalid=19780, Unknown=0, NotChecked=0, Total=22650 [2024-10-24 01:19:27,389 INFO L432 NwaCegarLoop]: 412 mSDtfsCounter, 2748 mSDsluCounter, 3530 mSDsCounter, 0 mSdLazyCounter, 2204 mSolverCounterSat, 791 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2748 SdHoareTripleChecker+Valid, 3942 SdHoareTripleChecker+Invalid, 2995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 791 IncrementalHoareTripleChecker+Valid, 2204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-24 01:19:27,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2748 Valid, 3942 Invalid, 2995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [791 Valid, 2204 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-24 01:19:27,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14633 states. [2024-10-24 01:19:28,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14633 to 12716. [2024-10-24 01:19:28,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12716 states, 9440 states have (on average 1.2976694915254237) internal successors, (12250), 9525 states have internal predecessors, (12250), 2106 states have call successors, (2106), 1169 states have call predecessors, (2106), 1169 states have return successors, (2106), 2021 states have call predecessors, (2106), 2106 states have call successors, (2106) [2024-10-24 01:19:28,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12716 states to 12716 states and 16462 transitions. [2024-10-24 01:19:28,912 INFO L78 Accepts]: Start accepts. Automaton has 12716 states and 16462 transitions. Word has length 155 [2024-10-24 01:19:28,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:19:28,912 INFO L471 AbstractCegarLoop]: Abstraction has 12716 states and 16462 transitions. [2024-10-24 01:19:28,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 11.0) internal successors, (242), 22 states have internal predecessors, (242), 9 states have call successors, (41), 5 states have call predecessors, (41), 6 states have return successors, (40), 9 states have call predecessors, (40), 9 states have call successors, (40) [2024-10-24 01:19:28,913 INFO L276 IsEmpty]: Start isEmpty. Operand 12716 states and 16462 transitions. [2024-10-24 01:19:28,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-24 01:19:28,928 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:19:28,928 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:19:28,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-24 01:19:29,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:19:29,129 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:19:29,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:19:29,130 INFO L85 PathProgramCache]: Analyzing trace with hash 271123625, now seen corresponding path program 1 times [2024-10-24 01:19:29,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:19:29,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342745376] [2024-10-24 01:19:29,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:29,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:19:29,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:29,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:19:29,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:29,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-24 01:19:29,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:29,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 01:19:29,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:29,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 01:19:29,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:29,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 01:19:29,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:29,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 01:19:29,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:29,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 01:19:29,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:29,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 01:19:29,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:29,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 01:19:29,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:29,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 01:19:29,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:29,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-24 01:19:29,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:29,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 01:19:29,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:29,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-24 01:19:29,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:29,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 01:19:29,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:29,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-24 01:19:29,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:29,803 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 22 proven. 2 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-10-24 01:19:29,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:19:29,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342745376] [2024-10-24 01:19:29,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342745376] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 01:19:29,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70924591] [2024-10-24 01:19:29,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:19:29,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:19:29,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:19:29,806 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 01:19:29,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-24 01:19:29,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:19:30,002 INFO L255 TraceCheckSpWp]: Trace formula consists of 682 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-10-24 01:19:30,007 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 01:19:31,039 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 70 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-24 01:19:31,039 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 01:19:32,132 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2024-10-24 01:19:32,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [70924591] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 01:19:32,133 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 01:19:32,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 19] total 36 [2024-10-24 01:19:32,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372547786] [2024-10-24 01:19:32,133 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 01:19:32,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-10-24 01:19:32,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:19:32,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-10-24 01:19:32,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=1084, Unknown=0, NotChecked=0, Total=1260 [2024-10-24 01:19:32,136 INFO L87 Difference]: Start difference. First operand 12716 states and 16462 transitions. Second operand has 36 states, 36 states have (on average 6.666666666666667) internal successors, (240), 35 states have internal predecessors, (240), 11 states have call successors, (45), 5 states have call predecessors, (45), 7 states have return successors, (44), 12 states have call predecessors, (44), 11 states have call successors, (44)