./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.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.5.ufo.UNBOUNDED.pals.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 0a05a45e59c4449e0f919ee265abbb6a4949f64a9be713d749d79d0baffd63df --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 03:16:58,149 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 03:16:58,211 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 03:16:58,217 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 03:16:58,220 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 03:16:58,239 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 03:16:58,240 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 03:16:58,240 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 03:16:58,240 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 03:16:58,241 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 03:16:58,241 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 03:16:58,241 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 03:16:58,242 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 03:16:58,242 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 03:16:58,242 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 03:16:58,243 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 03:16:58,243 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 03:16:58,243 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 03:16:58,244 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 03:16:58,244 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 03:16:58,244 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 03:16:58,245 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 03:16:58,245 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 03:16:58,245 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 03:16:58,245 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 03:16:58,246 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 03:16:58,246 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 03:16:58,246 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 03:16:58,247 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 03:16:58,247 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 03:16:58,247 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 03:16:58,248 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 03:16:58,248 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:16:58,248 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 03:16:58,248 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 03:16:58,249 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 03:16:58,249 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 03:16:58,249 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 03:16:58,250 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 03:16:58,250 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 03:16:58,250 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 03:16:58,251 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 03:16:58,251 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-clean/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-clean/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 -> 0a05a45e59c4449e0f919ee265abbb6a4949f64a9be713d749d79d0baffd63df [2024-10-11 03:16:58,472 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 03:16:58,491 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 03:16:58,493 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 03:16:58,498 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 03:16:58,499 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 03:16:58,500 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.5.ufo.UNBOUNDED.pals.c [2024-10-11 03:16:59,795 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 03:17:00,022 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 03:17:00,023 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.5.ufo.UNBOUNDED.pals.c [2024-10-11 03:17:00,038 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b5943d282/279c1b9674f540f0b957c2bbd935a382/FLAG1eda88969 [2024-10-11 03:17:00,052 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b5943d282/279c1b9674f540f0b957c2bbd935a382 [2024-10-11 03:17:00,055 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 03:17:00,057 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 03:17:00,059 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 03:17:00,059 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 03:17:00,064 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 03:17:00,064 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:17:00" (1/1) ... [2024-10-11 03:17:00,065 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f1fe7b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:17:00, skipping insertion in model container [2024-10-11 03:17:00,065 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:17:00" (1/1) ... [2024-10-11 03:17:00,099 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 03:17:00,391 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.UNBOUNDED.pals.c[14577,14590] [2024-10-11 03:17:00,395 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:17:00,402 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 03:17:00,473 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.UNBOUNDED.pals.c[14577,14590] [2024-10-11 03:17:00,473 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:17:00,488 INFO L204 MainTranslator]: Completed translation [2024-10-11 03:17:00,489 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:17:00 WrapperNode [2024-10-11 03:17:00,489 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 03:17:00,490 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 03:17:00,490 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 03:17:00,490 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 03:17:00,495 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:17:00" (1/1) ... [2024-10-11 03:17:00,506 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:17:00" (1/1) ... [2024-10-11 03:17:00,540 INFO L138 Inliner]: procedures = 32, calls = 47, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 508 [2024-10-11 03:17:00,541 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 03:17:00,541 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 03:17:00,541 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 03:17:00,541 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 03:17:00,556 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:17:00" (1/1) ... [2024-10-11 03:17:00,556 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:17:00" (1/1) ... [2024-10-11 03:17:00,560 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:17:00" (1/1) ... [2024-10-11 03:17:00,574 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-11 03:17:00,574 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:17:00" (1/1) ... [2024-10-11 03:17:00,575 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:17:00" (1/1) ... [2024-10-11 03:17:00,584 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:17:00" (1/1) ... [2024-10-11 03:17:00,592 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:17:00" (1/1) ... [2024-10-11 03:17:00,598 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:17:00" (1/1) ... [2024-10-11 03:17:00,600 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:17:00" (1/1) ... [2024-10-11 03:17:00,607 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 03:17:00,608 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 03:17:00,608 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 03:17:00,608 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 03:17:00,613 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:17:00" (1/1) ... [2024-10-11 03:17:00,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:17:00,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:17:00,645 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 03:17:00,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 03:17:00,695 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2024-10-11 03:17:00,696 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2024-10-11 03:17:00,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 03:17:00,696 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2024-10-11 03:17:00,696 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2024-10-11 03:17:00,696 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2024-10-11 03:17:00,696 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2024-10-11 03:17:00,698 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 03:17:00,698 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 03:17:00,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 03:17:00,698 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2024-10-11 03:17:00,698 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2024-10-11 03:17:00,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 03:17:00,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 03:17:00,699 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2024-10-11 03:17:00,699 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2024-10-11 03:17:00,808 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 03:17:00,811 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 03:17:01,225 INFO L? ?]: Removed 117 outVars from TransFormulas that were not future-live. [2024-10-11 03:17:01,226 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 03:17:01,266 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 03:17:01,266 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 03:17:01,267 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:17:01 BoogieIcfgContainer [2024-10-11 03:17:01,267 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 03:17:01,269 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 03:17:01,269 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 03:17:01,271 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 03:17:01,272 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:17:00" (1/3) ... [2024-10-11 03:17:01,272 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71f40d81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:17:01, skipping insertion in model container [2024-10-11 03:17:01,272 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:17:00" (2/3) ... [2024-10-11 03:17:01,273 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71f40d81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:17:01, skipping insertion in model container [2024-10-11 03:17:01,273 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:17:01" (3/3) ... [2024-10-11 03:17:01,274 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.5.ufo.UNBOUNDED.pals.c [2024-10-11 03:17:01,288 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 03:17:01,288 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 03:17:01,364 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 03:17:01,370 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;@4967c88, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 03:17:01,371 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 03:17:01,376 INFO L276 IsEmpty]: Start isEmpty. Operand has 163 states, 126 states have (on average 1.6111111111111112) internal successors, (203), 128 states have internal predecessors, (203), 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-11 03:17:01,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 03:17:01,383 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:01,384 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:17:01,385 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:01,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:01,390 INFO L85 PathProgramCache]: Analyzing trace with hash 103658677, now seen corresponding path program 1 times [2024-10-11 03:17:01,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:01,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040206297] [2024-10-11 03:17:01,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:01,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:01,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:01,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:17:01,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:01,701 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-11 03:17:01,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:01,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040206297] [2024-10-11 03:17:01,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040206297] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:01,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:01,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 03:17:01,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248340797] [2024-10-11 03:17:01,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:01,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 03:17:01,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:01,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 03:17:01,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 03:17:01,731 INFO L87 Difference]: Start difference. First operand has 163 states, 126 states have (on average 1.6111111111111112) internal successors, (203), 128 states have internal predecessors, (203), 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-11 03:17:01,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:01,806 INFO L93 Difference]: Finished difference Result 309 states and 522 transitions. [2024-10-11 03:17:01,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 03:17:01,809 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-11 03:17:01,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:01,819 INFO L225 Difference]: With dead ends: 309 [2024-10-11 03:17:01,820 INFO L226 Difference]: Without dead ends: 161 [2024-10-11 03:17:01,825 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-11 03:17:01,830 INFO L432 NwaCegarLoop]: 251 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:01,831 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 251 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:17:01,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-10-11 03:17:01,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2024-10-11 03:17:01,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 125 states have (on average 1.584) internal successors, (198), 126 states have internal predecessors, (198), 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-11 03:17:01,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 256 transitions. [2024-10-11 03:17:01,892 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 256 transitions. Word has length 23 [2024-10-11 03:17:01,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:01,892 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 256 transitions. [2024-10-11 03:17:01,892 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-11 03:17:01,892 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 256 transitions. [2024-10-11 03:17:01,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 03:17:01,894 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:01,894 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-11 03:17:01,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 03:17:01,894 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:01,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:01,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1890486029, now seen corresponding path program 1 times [2024-10-11 03:17:01,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:01,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438404753] [2024-10-11 03:17:01,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:01,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:01,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:02,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:17:02,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:02,107 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-11 03:17:02,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:02,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438404753] [2024-10-11 03:17:02,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438404753] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:02,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:02,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:17:02,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861048119] [2024-10-11 03:17:02,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:02,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 03:17:02,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:02,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 03:17:02,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:17:02,111 INFO L87 Difference]: Start difference. First operand 161 states and 256 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-11 03:17:02,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:02,211 INFO L93 Difference]: Finished difference Result 309 states and 487 transitions. [2024-10-11 03:17:02,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 03:17:02,215 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-11 03:17:02,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:02,217 INFO L225 Difference]: With dead ends: 309 [2024-10-11 03:17:02,217 INFO L226 Difference]: Without dead ends: 161 [2024-10-11 03:17:02,220 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-11 03:17:02,221 INFO L432 NwaCegarLoop]: 247 mSDtfsCounter, 0 mSDsluCounter, 968 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1215 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:02,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1215 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:17:02,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-10-11 03:17:02,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2024-10-11 03:17:02,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 125 states have (on average 1.488) internal successors, (186), 126 states have internal predecessors, (186), 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-11 03:17:02,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 244 transitions. [2024-10-11 03:17:02,246 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 244 transitions. Word has length 23 [2024-10-11 03:17:02,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:02,246 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 244 transitions. [2024-10-11 03:17:02,247 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-11 03:17:02,247 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 244 transitions. [2024-10-11 03:17:02,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 03:17:02,248 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:02,248 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-11 03:17:02,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 03:17:02,248 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:02,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:02,249 INFO L85 PathProgramCache]: Analyzing trace with hash 2080134839, now seen corresponding path program 1 times [2024-10-11 03:17:02,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:02,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987112106] [2024-10-11 03:17:02,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:02,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:02,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:02,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:02,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:02,532 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-11 03:17:02,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:02,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987112106] [2024-10-11 03:17:02,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987112106] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:02,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:02,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:17:02,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103616674] [2024-10-11 03:17:02,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:02,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:17:02,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:02,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:17:02,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:17:02,539 INFO L87 Difference]: Start difference. First operand 161 states and 244 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-11 03:17:02,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:02,617 INFO L93 Difference]: Finished difference Result 310 states and 479 transitions. [2024-10-11 03:17:02,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:17:02,617 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-11 03:17:02,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:02,619 INFO L225 Difference]: With dead ends: 310 [2024-10-11 03:17:02,619 INFO L226 Difference]: Without dead ends: 165 [2024-10-11 03:17:02,620 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-11 03:17:02,621 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 3 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 689 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-11 03:17:02,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 689 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:17:02,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-10-11 03:17:02,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2024-10-11 03:17:02,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 128 states have (on average 1.4765625) internal successors, (189), 129 states have internal predecessors, (189), 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-11 03:17:02,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 247 transitions. [2024-10-11 03:17:02,633 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 247 transitions. Word has length 34 [2024-10-11 03:17:02,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:02,634 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 247 transitions. [2024-10-11 03:17:02,634 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-11 03:17:02,634 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 247 transitions. [2024-10-11 03:17:02,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-11 03:17:02,635 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:02,635 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-11 03:17:02,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 03:17:02,636 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:02,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:02,636 INFO L85 PathProgramCache]: Analyzing trace with hash 2074468601, now seen corresponding path program 1 times [2024-10-11 03:17:02,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:02,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866984074] [2024-10-11 03:17:02,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:02,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:02,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:02,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:02,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:02,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:17:02,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:02,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 03:17:02,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:02,756 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-11 03:17:02,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:02,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866984074] [2024-10-11 03:17:02,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866984074] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:02,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:02,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:17:02,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775540434] [2024-10-11 03:17:02,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:02,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:17:02,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:02,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:17:02,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:17:02,760 INFO L87 Difference]: Start difference. First operand 165 states and 247 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-11 03:17:02,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:02,818 INFO L93 Difference]: Finished difference Result 455 states and 692 transitions. [2024-10-11 03:17:02,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:17:02,820 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-11 03:17:02,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:02,822 INFO L225 Difference]: With dead ends: 455 [2024-10-11 03:17:02,825 INFO L226 Difference]: Without dead ends: 306 [2024-10-11 03:17:02,830 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-11 03:17:02,831 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 205 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 474 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-11 03:17:02,831 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 474 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:17:02,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2024-10-11 03:17:02,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 303. [2024-10-11 03:17:02,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 231 states have (on average 1.4935064935064934) internal successors, (345), 233 states have internal predecessors, (345), 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-11 03:17:02,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 459 transitions. [2024-10-11 03:17:02,878 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 459 transitions. Word has length 48 [2024-10-11 03:17:02,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:02,880 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 459 transitions. [2024-10-11 03:17:02,880 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-11 03:17:02,880 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 459 transitions. [2024-10-11 03:17:02,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-11 03:17:02,882 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:02,883 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-11 03:17:02,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 03:17:02,883 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:02,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:02,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1204065463, now seen corresponding path program 1 times [2024-10-11 03:17:02,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:02,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280603047] [2024-10-11 03:17:02,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:02,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:02,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:02,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:02,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:02,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:17:02,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:02,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 03:17:02,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:02,980 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-11 03:17:02,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:02,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280603047] [2024-10-11 03:17:02,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280603047] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:02,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:02,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:17:02,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282965062] [2024-10-11 03:17:02,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:02,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:17:02,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:02,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:17:02,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:17:02,989 INFO L87 Difference]: Start difference. First operand 303 states and 459 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-11 03:17:03,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:03,065 INFO L93 Difference]: Finished difference Result 857 states and 1307 transitions. [2024-10-11 03:17:03,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:17:03,067 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-11 03:17:03,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:03,074 INFO L225 Difference]: With dead ends: 857 [2024-10-11 03:17:03,074 INFO L226 Difference]: Without dead ends: 570 [2024-10-11 03:17:03,076 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-11 03:17:03,077 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 201 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 489 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-11 03:17:03,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 489 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:17:03,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2024-10-11 03:17:03,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 558. [2024-10-11 03:17:03,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 416 states have (on average 1.4927884615384615) internal successors, (621), 420 states have internal predecessors, (621), 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-11 03:17:03,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 847 transitions. [2024-10-11 03:17:03,135 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 847 transitions. Word has length 49 [2024-10-11 03:17:03,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:03,137 INFO L471 AbstractCegarLoop]: Abstraction has 558 states and 847 transitions. [2024-10-11 03:17:03,137 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-11 03:17:03,138 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 847 transitions. [2024-10-11 03:17:03,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-11 03:17:03,142 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:03,142 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-11 03:17:03,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 03:17:03,142 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:03,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:03,143 INFO L85 PathProgramCache]: Analyzing trace with hash -75798215, now seen corresponding path program 1 times [2024-10-11 03:17:03,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:03,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786606489] [2024-10-11 03:17:03,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:03,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:03,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:03,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:03,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:03,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:17:03,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:03,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 03:17:03,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:03,324 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-11 03:17:03,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:03,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786606489] [2024-10-11 03:17:03,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786606489] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:03,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:03,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:17:03,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324097303] [2024-10-11 03:17:03,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:03,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:17:03,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:03,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:17:03,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:17:03,327 INFO L87 Difference]: Start difference. First operand 558 states and 847 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-11 03:17:03,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:03,487 INFO L93 Difference]: Finished difference Result 1178 states and 1793 transitions. [2024-10-11 03:17:03,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:17:03,487 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-11 03:17:03,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:03,492 INFO L225 Difference]: With dead ends: 1178 [2024-10-11 03:17:03,492 INFO L226 Difference]: Without dead ends: 636 [2024-10-11 03:17:03,494 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-11 03:17:03,496 INFO L432 NwaCegarLoop]: 209 mSDtfsCounter, 328 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 618 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-11 03:17:03,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 618 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:17:03,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2024-10-11 03:17:03,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 628. [2024-10-11 03:17:03,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 478 states have (on average 1.4832635983263598) internal successors, (709), 481 states have internal predecessors, (709), 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-11 03:17:03,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 943 transitions. [2024-10-11 03:17:03,546 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 943 transitions. Word has length 49 [2024-10-11 03:17:03,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:03,547 INFO L471 AbstractCegarLoop]: Abstraction has 628 states and 943 transitions. [2024-10-11 03:17:03,547 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-11 03:17:03,547 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 943 transitions. [2024-10-11 03:17:03,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 03:17:03,551 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:03,551 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-11 03:17:03,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 03:17:03,552 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:03,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:03,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1717692240, now seen corresponding path program 1 times [2024-10-11 03:17:03,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:03,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793172895] [2024-10-11 03:17:03,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:03,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:03,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:03,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:03,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:03,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:17:03,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:03,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 03:17:03,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:03,687 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-11 03:17:03,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:03,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793172895] [2024-10-11 03:17:03,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793172895] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:03,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:03,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:17:03,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575155878] [2024-10-11 03:17:03,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:03,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:17:03,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:03,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:17:03,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:17:03,689 INFO L87 Difference]: Start difference. First operand 628 states and 943 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-11 03:17:03,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:03,830 INFO L93 Difference]: Finished difference Result 1182 states and 1793 transitions. [2024-10-11 03:17:03,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:17:03,831 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-11 03:17:03,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:03,835 INFO L225 Difference]: With dead ends: 1182 [2024-10-11 03:17:03,835 INFO L226 Difference]: Without dead ends: 640 [2024-10-11 03:17:03,837 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-11 03:17:03,837 INFO L432 NwaCegarLoop]: 209 mSDtfsCounter, 328 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 618 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-11 03:17:03,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 618 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:17:03,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2024-10-11 03:17:03,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 636. [2024-10-11 03:17:03,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 486 states have (on average 1.4753086419753085) internal successors, (717), 489 states have internal predecessors, (717), 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-11 03:17:03,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 951 transitions. [2024-10-11 03:17:03,882 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 951 transitions. Word has length 50 [2024-10-11 03:17:03,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:03,884 INFO L471 AbstractCegarLoop]: Abstraction has 636 states and 951 transitions. [2024-10-11 03:17:03,884 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-11 03:17:03,884 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 951 transitions. [2024-10-11 03:17:03,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-11 03:17:03,885 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:03,885 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-11 03:17:03,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 03:17:03,886 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:03,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:03,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1754746402, now seen corresponding path program 1 times [2024-10-11 03:17:03,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:03,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535334412] [2024-10-11 03:17:03,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:03,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:03,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:04,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:04,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:04,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:17:04,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:04,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 03:17:04,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:04,057 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-11 03:17:04,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:04,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535334412] [2024-10-11 03:17:04,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535334412] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:04,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:04,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:17:04,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954747927] [2024-10-11 03:17:04,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:04,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:17:04,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:04,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:17:04,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:17:04,064 INFO L87 Difference]: Start difference. First operand 636 states and 951 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-11 03:17:04,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:04,193 INFO L93 Difference]: Finished difference Result 1178 states and 1781 transitions. [2024-10-11 03:17:04,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:17:04,193 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-11 03:17:04,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:04,197 INFO L225 Difference]: With dead ends: 1178 [2024-10-11 03:17:04,197 INFO L226 Difference]: Without dead ends: 636 [2024-10-11 03:17:04,198 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-11 03:17:04,199 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 49 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 617 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-11 03:17:04,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 617 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:17:04,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2024-10-11 03:17:04,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 636. [2024-10-11 03:17:04,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 486 states have (on average 1.4670781893004115) internal successors, (713), 489 states have internal predecessors, (713), 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-11 03:17:04,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 947 transitions. [2024-10-11 03:17:04,235 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 947 transitions. Word has length 52 [2024-10-11 03:17:04,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:04,236 INFO L471 AbstractCegarLoop]: Abstraction has 636 states and 947 transitions. [2024-10-11 03:17:04,236 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-11 03:17:04,236 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 947 transitions. [2024-10-11 03:17:04,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-11 03:17:04,237 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:04,237 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-11 03:17:04,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 03:17:04,237 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:04,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:04,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1411355129, now seen corresponding path program 1 times [2024-10-11 03:17:04,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:04,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007775386] [2024-10-11 03:17:04,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:04,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:04,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:04,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:04,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:04,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:17:04,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:04,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 03:17:04,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:04,363 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-11 03:17:04,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:04,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007775386] [2024-10-11 03:17:04,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007775386] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:04,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:04,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:17:04,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834336179] [2024-10-11 03:17:04,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:04,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:17:04,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:04,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:17:04,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:17:04,364 INFO L87 Difference]: Start difference. First operand 636 states and 947 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-11 03:17:04,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:04,432 INFO L93 Difference]: Finished difference Result 1198 states and 1805 transitions. [2024-10-11 03:17:04,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:17:04,433 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-11 03:17:04,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:04,437 INFO L225 Difference]: With dead ends: 1198 [2024-10-11 03:17:04,437 INFO L226 Difference]: Without dead ends: 656 [2024-10-11 03:17:04,439 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-11 03:17:04,440 INFO L432 NwaCegarLoop]: 235 mSDtfsCounter, 4 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 701 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-11 03:17:04,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 701 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:17:04,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2024-10-11 03:17:04,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2024-10-11 03:17:04,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 502 states have (on average 1.452191235059761) internal successors, (729), 505 states have internal predecessors, (729), 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-11 03:17:04,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 963 transitions. [2024-10-11 03:17:04,505 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 963 transitions. Word has length 53 [2024-10-11 03:17:04,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:04,505 INFO L471 AbstractCegarLoop]: Abstraction has 656 states and 963 transitions. [2024-10-11 03:17:04,505 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-11 03:17:04,506 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 963 transitions. [2024-10-11 03:17:04,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-11 03:17:04,506 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:04,507 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-11 03:17:04,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 03:17:04,507 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:04,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:04,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1026075629, now seen corresponding path program 1 times [2024-10-11 03:17:04,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:04,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333518196] [2024-10-11 03:17:04,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:04,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:04,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:04,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:04,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:04,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:17:04,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:04,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 03:17:04,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:04,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 03:17:04,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:04,646 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-11 03:17:04,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:04,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333518196] [2024-10-11 03:17:04,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333518196] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:04,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:04,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:17:04,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619860377] [2024-10-11 03:17:04,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:04,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:17:04,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:04,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:17:04,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:17:04,648 INFO L87 Difference]: Start difference. First operand 656 states and 963 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-11 03:17:04,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:04,846 INFO L93 Difference]: Finished difference Result 1238 states and 1849 transitions. [2024-10-11 03:17:04,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:17:04,851 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-11 03:17:04,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:04,859 INFO L225 Difference]: With dead ends: 1238 [2024-10-11 03:17:04,863 INFO L226 Difference]: Without dead ends: 676 [2024-10-11 03:17:04,865 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-11 03:17:04,866 INFO L432 NwaCegarLoop]: 232 mSDtfsCounter, 4 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 687 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.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:04,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 687 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:17:04,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2024-10-11 03:17:04,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 676. [2024-10-11 03:17:04,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 676 states, 518 states have (on average 1.4382239382239381) internal successors, (745), 521 states have internal predecessors, (745), 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-11 03:17:04,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 979 transitions. [2024-10-11 03:17:04,946 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 979 transitions. Word has length 61 [2024-10-11 03:17:04,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:04,947 INFO L471 AbstractCegarLoop]: Abstraction has 676 states and 979 transitions. [2024-10-11 03:17:04,948 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-11 03:17:04,948 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 979 transitions. [2024-10-11 03:17:04,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-11 03:17:04,949 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:04,949 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-11 03:17:04,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 03:17:04,950 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:04,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:04,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1366026871, now seen corresponding path program 1 times [2024-10-11 03:17:04,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:04,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903755044] [2024-10-11 03:17:04,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:04,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:04,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:05,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:05,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:05,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:17:05,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:05,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 03:17:05,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:05,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 03:17:05,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:05,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 03:17:05,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:05,126 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-11 03:17:05,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:05,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903755044] [2024-10-11 03:17:05,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903755044] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:05,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:05,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:17:05,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115267150] [2024-10-11 03:17:05,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:05,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:17:05,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:05,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:17:05,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:17:05,132 INFO L87 Difference]: Start difference. First operand 676 states and 979 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-11 03:17:05,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:05,240 INFO L93 Difference]: Finished difference Result 1274 states and 1865 transitions. [2024-10-11 03:17:05,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:17:05,241 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-11 03:17:05,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:05,245 INFO L225 Difference]: With dead ends: 1274 [2024-10-11 03:17:05,245 INFO L226 Difference]: Without dead ends: 692 [2024-10-11 03:17:05,247 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-11 03:17:05,248 INFO L432 NwaCegarLoop]: 237 mSDtfsCounter, 3 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 697 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.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:05,248 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 697 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:17:05,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2024-10-11 03:17:05,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 692. [2024-10-11 03:17:05,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 692 states, 530 states have (on average 1.4283018867924528) internal successors, (757), 533 states have internal predecessors, (757), 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-11 03:17:05,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 991 transitions. [2024-10-11 03:17:05,296 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 991 transitions. Word has length 69 [2024-10-11 03:17:05,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:05,296 INFO L471 AbstractCegarLoop]: Abstraction has 692 states and 991 transitions. [2024-10-11 03:17:05,296 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-11 03:17:05,296 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 991 transitions. [2024-10-11 03:17:05,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-11 03:17:05,298 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:05,298 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-11 03:17:05,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 03:17:05,298 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:05,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:05,299 INFO L85 PathProgramCache]: Analyzing trace with hash -532481122, now seen corresponding path program 1 times [2024-10-11 03:17:05,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:05,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624131372] [2024-10-11 03:17:05,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:05,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:05,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:05,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:05,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:05,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:17:05,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:05,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 03:17:05,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:05,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 03:17:05,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:05,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 03:17:05,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:05,427 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-11 03:17:05,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:05,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624131372] [2024-10-11 03:17:05,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624131372] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:05,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:05,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:17:05,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463183656] [2024-10-11 03:17:05,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:05,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:17:05,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:05,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:17:05,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:17:05,429 INFO L87 Difference]: Start difference. First operand 692 states and 991 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-11 03:17:05,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:05,512 INFO L93 Difference]: Finished difference Result 1310 states and 1905 transitions. [2024-10-11 03:17:05,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:17:05,513 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-11 03:17:05,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:05,518 INFO L225 Difference]: With dead ends: 1310 [2024-10-11 03:17:05,518 INFO L226 Difference]: Without dead ends: 712 [2024-10-11 03:17:05,519 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-11 03:17:05,520 INFO L432 NwaCegarLoop]: 232 mSDtfsCounter, 4 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 687 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-11 03:17:05,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 687 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:17:05,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2024-10-11 03:17:05,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 712. [2024-10-11 03:17:05,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 712 states, 546 states have (on average 1.4157509157509158) internal successors, (773), 549 states have internal predecessors, (773), 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-11 03:17:05,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 1007 transitions. [2024-10-11 03:17:05,557 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 1007 transitions. Word has length 69 [2024-10-11 03:17:05,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:05,557 INFO L471 AbstractCegarLoop]: Abstraction has 712 states and 1007 transitions. [2024-10-11 03:17:05,558 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-11 03:17:05,558 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 1007 transitions. [2024-10-11 03:17:05,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-11 03:17:05,560 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:05,560 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-11 03:17:05,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 03:17:05,561 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:05,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:05,561 INFO L85 PathProgramCache]: Analyzing trace with hash -109947134, now seen corresponding path program 1 times [2024-10-11 03:17:05,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:05,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329042802] [2024-10-11 03:17:05,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:05,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:05,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:05,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:05,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:05,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:17:05,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:05,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 03:17:05,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:05,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 03:17:05,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:05,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 03:17:05,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:05,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 03:17:05,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:05,748 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-11 03:17:05,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:05,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329042802] [2024-10-11 03:17:05,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329042802] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:05,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:05,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:17:05,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205433848] [2024-10-11 03:17:05,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:05,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:17:05,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:05,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:17:05,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:17:05,750 INFO L87 Difference]: Start difference. First operand 712 states and 1007 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-11 03:17:05,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:05,820 INFO L93 Difference]: Finished difference Result 1354 states and 1933 transitions. [2024-10-11 03:17:05,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:17:05,821 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-11 03:17:05,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:05,825 INFO L225 Difference]: With dead ends: 1354 [2024-10-11 03:17:05,825 INFO L226 Difference]: Without dead ends: 736 [2024-10-11 03:17:05,827 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-11 03:17:05,827 INFO L432 NwaCegarLoop]: 236 mSDtfsCounter, 5 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 699 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-11 03:17:05,827 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 699 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:17:05,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2024-10-11 03:17:05,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 736. [2024-10-11 03:17:05,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 736 states, 566 states have (on average 1.401060070671378) internal successors, (793), 569 states have internal predecessors, (793), 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-11 03:17:05,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1027 transitions. [2024-10-11 03:17:05,861 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 1027 transitions. Word has length 77 [2024-10-11 03:17:05,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:05,862 INFO L471 AbstractCegarLoop]: Abstraction has 736 states and 1027 transitions. [2024-10-11 03:17:05,862 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-11 03:17:05,862 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1027 transitions. [2024-10-11 03:17:05,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-11 03:17:05,863 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:05,863 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-11 03:17:05,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 03:17:05,864 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:05,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:05,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1880226315, now seen corresponding path program 1 times [2024-10-11 03:17:05,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:05,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42065888] [2024-10-11 03:17:05,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:05,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:05,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:06,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:06,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:06,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:17:06,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:06,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 03:17:06,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:06,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 03:17:06,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:06,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 03:17:06,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:06,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 03:17:06,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:06,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 03:17:06,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:06,256 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-11 03:17:06,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:06,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42065888] [2024-10-11 03:17:06,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42065888] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:06,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:06,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:17:06,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618549060] [2024-10-11 03:17:06,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:06,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:17:06,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:06,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:17:06,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:17:06,259 INFO L87 Difference]: Start difference. First operand 736 states and 1027 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-11 03:17:06,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:06,499 INFO L93 Difference]: Finished difference Result 1935 states and 2683 transitions. [2024-10-11 03:17:06,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 03:17:06,500 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-11 03:17:06,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:06,506 INFO L225 Difference]: With dead ends: 1935 [2024-10-11 03:17:06,506 INFO L226 Difference]: Without dead ends: 1293 [2024-10-11 03:17:06,508 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-11 03:17:06,509 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 184 mSDsluCounter, 1114 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 1354 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.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:06,509 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 1354 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:17:06,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1293 states. [2024-10-11 03:17:06,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1293 to 881. [2024-10-11 03:17:06,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 674 states have (on average 1.3916913946587537) internal successors, (938), 678 states have internal predecessors, (938), 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-11 03:17:06,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1220 transitions. [2024-10-11 03:17:06,562 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1220 transitions. Word has length 80 [2024-10-11 03:17:06,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:06,562 INFO L471 AbstractCegarLoop]: Abstraction has 881 states and 1220 transitions. [2024-10-11 03:17:06,563 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-11 03:17:06,563 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1220 transitions. [2024-10-11 03:17:06,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-11 03:17:06,563 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:06,564 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-11 03:17:06,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 03:17:06,564 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:06,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:06,564 INFO L85 PathProgramCache]: Analyzing trace with hash 392030714, now seen corresponding path program 1 times [2024-10-11 03:17:06,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:06,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454892565] [2024-10-11 03:17:06,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:06,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:06,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:06,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:06,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:06,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:17:06,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:06,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 03:17:06,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:06,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 03:17:06,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:06,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 03:17:06,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:06,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 03:17:06,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:06,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 03:17:06,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:06,689 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-11 03:17:06,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:06,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454892565] [2024-10-11 03:17:06,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454892565] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:06,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:06,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:17:06,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881582616] [2024-10-11 03:17:06,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:06,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:17:06,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:06,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:17:06,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:17:06,691 INFO L87 Difference]: Start difference. First operand 881 states and 1220 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-11 03:17:06,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:06,774 INFO L93 Difference]: Finished difference Result 1651 states and 2305 transitions. [2024-10-11 03:17:06,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:17:06,775 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-11 03:17:06,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:06,779 INFO L225 Difference]: With dead ends: 1651 [2024-10-11 03:17:06,779 INFO L226 Difference]: Without dead ends: 901 [2024-10-11 03:17:06,782 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-11 03:17:06,782 INFO L432 NwaCegarLoop]: 237 mSDtfsCounter, 3 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 697 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-11 03:17:06,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 697 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:17:06,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2024-10-11 03:17:06,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 901. [2024-10-11 03:17:06,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 901 states, 689 states have (on average 1.3831640058055152) internal successors, (953), 693 states have internal predecessors, (953), 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-11 03:17:06,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1235 transitions. [2024-10-11 03:17:06,838 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1235 transitions. Word has length 84 [2024-10-11 03:17:06,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:06,839 INFO L471 AbstractCegarLoop]: Abstraction has 901 states and 1235 transitions. [2024-10-11 03:17:06,839 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-11 03:17:06,839 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1235 transitions. [2024-10-11 03:17:06,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-11 03:17:06,840 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:06,840 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-11 03:17:06,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 03:17:06,840 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:06,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:06,841 INFO L85 PathProgramCache]: Analyzing trace with hash -954874953, now seen corresponding path program 1 times [2024-10-11 03:17:06,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:06,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764862217] [2024-10-11 03:17:06,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:06,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:06,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:07,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:07,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:07,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:17:07,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:07,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 03:17:07,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:07,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 03:17:07,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:07,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 03:17:07,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:07,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 03:17:07,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:07,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 03:17:07,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:07,056 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-11 03:17:07,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:07,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764862217] [2024-10-11 03:17:07,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764862217] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:07,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:07,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:17:07,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794424644] [2024-10-11 03:17:07,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:07,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 03:17:07,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:07,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 03:17:07,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:17:07,058 INFO L87 Difference]: Start difference. First operand 901 states and 1235 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-11 03:17:07,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:07,232 INFO L93 Difference]: Finished difference Result 1297 states and 1880 transitions. [2024-10-11 03:17:07,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 03:17:07,232 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-11 03:17:07,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:07,239 INFO L225 Difference]: With dead ends: 1297 [2024-10-11 03:17:07,239 INFO L226 Difference]: Without dead ends: 1295 [2024-10-11 03:17:07,240 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-11 03:17:07,240 INFO L432 NwaCegarLoop]: 410 mSDtfsCounter, 129 mSDsluCounter, 1462 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 1872 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-11 03:17:07,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 1872 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:17:07,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1295 states. [2024-10-11 03:17:07,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1295 to 903. [2024-10-11 03:17:07,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 903 states, 689 states have (on average 1.3831640058055152) internal successors, (953), 694 states have internal predecessors, (953), 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-11 03:17:07,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1237 transitions. [2024-10-11 03:17:07,329 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 1237 transitions. Word has length 83 [2024-10-11 03:17:07,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:07,329 INFO L471 AbstractCegarLoop]: Abstraction has 903 states and 1237 transitions. [2024-10-11 03:17:07,329 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-11 03:17:07,329 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1237 transitions. [2024-10-11 03:17:07,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-11 03:17:07,330 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:07,330 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-11 03:17:07,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 03:17:07,330 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:07,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:07,331 INFO L85 PathProgramCache]: Analyzing trace with hash -2029276846, now seen corresponding path program 1 times [2024-10-11 03:17:07,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:07,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812655955] [2024-10-11 03:17:07,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:07,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:07,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:07,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:07,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:07,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:17:07,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:07,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 03:17:07,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:07,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 03:17:07,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:07,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 03:17:07,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:07,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 03:17:07,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:07,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 03:17:07,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:07,448 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-11 03:17:07,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:07,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812655955] [2024-10-11 03:17:07,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812655955] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:07,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:07,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:17:07,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638366913] [2024-10-11 03:17:07,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:07,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:17:07,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:07,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:17:07,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:17:07,449 INFO L87 Difference]: Start difference. First operand 903 states and 1237 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-11 03:17:07,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:07,611 INFO L93 Difference]: Finished difference Result 1687 states and 2328 transitions. [2024-10-11 03:17:07,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 03:17:07,612 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-11 03:17:07,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:07,617 INFO L225 Difference]: With dead ends: 1687 [2024-10-11 03:17:07,617 INFO L226 Difference]: Without dead ends: 956 [2024-10-11 03:17:07,619 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-11 03:17:07,619 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 225 mSDsluCounter, 1133 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 1371 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-11 03:17:07,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 1371 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:17:07,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2024-10-11 03:17:07,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 914. [2024-10-11 03:17:07,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 914 states, 705 states have (on average 1.3815602836879433) internal successors, (974), 714 states have internal predecessors, (974), 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-11 03:17:07,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1246 transitions. [2024-10-11 03:17:07,679 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1246 transitions. Word has length 86 [2024-10-11 03:17:07,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:07,680 INFO L471 AbstractCegarLoop]: Abstraction has 914 states and 1246 transitions. [2024-10-11 03:17:07,680 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-11 03:17:07,680 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1246 transitions. [2024-10-11 03:17:07,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-11 03:17:07,681 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:07,681 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-11 03:17:07,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 03:17:07,681 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:07,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:07,681 INFO L85 PathProgramCache]: Analyzing trace with hash -847343983, now seen corresponding path program 1 times [2024-10-11 03:17:07,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:07,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920500867] [2024-10-11 03:17:07,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:07,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:07,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:08,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:08,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:08,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:17:08,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:08,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 03:17:08,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:08,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 03:17:08,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:08,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 03:17:08,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:08,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 03:17:08,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:08,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 03:17:08,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:08,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 03:17:08,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:08,083 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-11 03:17:08,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:08,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920500867] [2024-10-11 03:17:08,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920500867] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:08,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:08,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:17:08,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861114304] [2024-10-11 03:17:08,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:08,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:17:08,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:08,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:17:08,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:17:08,084 INFO L87 Difference]: Start difference. First operand 914 states and 1246 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-11 03:17:08,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:08,274 INFO L93 Difference]: Finished difference Result 1665 states and 2282 transitions. [2024-10-11 03:17:08,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 03:17:08,274 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-11 03:17:08,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:08,279 INFO L225 Difference]: With dead ends: 1665 [2024-10-11 03:17:08,279 INFO L226 Difference]: Without dead ends: 913 [2024-10-11 03:17:08,281 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-11 03:17:08,281 INFO L432 NwaCegarLoop]: 253 mSDtfsCounter, 127 mSDsluCounter, 1178 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 1431 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-11 03:17:08,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 1431 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:17:08,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2024-10-11 03:17:08,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 903. [2024-10-11 03:17:08,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 903 states, 697 states have (on average 1.3802008608321377) internal successors, (962), 706 states have internal predecessors, (962), 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-11 03:17:08,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1230 transitions. [2024-10-11 03:17:08,356 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 1230 transitions. Word has length 88 [2024-10-11 03:17:08,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:08,356 INFO L471 AbstractCegarLoop]: Abstraction has 903 states and 1230 transitions. [2024-10-11 03:17:08,356 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-11 03:17:08,357 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1230 transitions. [2024-10-11 03:17:08,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-11 03:17:08,357 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:08,357 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-11 03:17:08,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 03:17:08,358 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:08,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:08,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1883504194, now seen corresponding path program 1 times [2024-10-11 03:17:08,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:08,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602992146] [2024-10-11 03:17:08,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:08,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:08,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:08,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:08,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:08,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:17:08,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:08,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 03:17:08,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:08,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 03:17:08,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:08,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 03:17:08,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:08,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 03:17:08,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:08,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 03:17:08,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:08,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 03:17:08,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:08,794 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-11 03:17:08,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:08,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602992146] [2024-10-11 03:17:08,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602992146] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:08,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:08,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 03:17:08,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433741679] [2024-10-11 03:17:08,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:08,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:17:08,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:08,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:17:08,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:17:08,796 INFO L87 Difference]: Start difference. First operand 903 states and 1230 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), 4 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 03:17:09,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:09,267 INFO L93 Difference]: Finished difference Result 1758 states and 2388 transitions. [2024-10-11 03:17:09,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 03:17:09,268 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), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 89 [2024-10-11 03:17:09,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:09,274 INFO L225 Difference]: With dead ends: 1758 [2024-10-11 03:17:09,274 INFO L226 Difference]: Without dead ends: 996 [2024-10-11 03:17:09,276 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-11 03:17:09,277 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 634 mSDsluCounter, 966 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 640 SdHoareTripleChecker+Valid, 1236 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.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:09,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [640 Valid, 1236 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 03:17:09,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 996 states. [2024-10-11 03:17:09,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 996 to 941. [2024-10-11 03:17:09,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 941 states, 720 states have (on average 1.3555555555555556) internal successors, (976), 730 states have internal predecessors, (976), 143 states have call successors, (143), 77 states have call predecessors, (143), 77 states have return successors, (143), 133 states have call predecessors, (143), 143 states have call successors, (143) [2024-10-11 03:17:09,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1262 transitions. [2024-10-11 03:17:09,355 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 1262 transitions. Word has length 89 [2024-10-11 03:17:09,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:09,355 INFO L471 AbstractCegarLoop]: Abstraction has 941 states and 1262 transitions. [2024-10-11 03:17:09,356 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), 4 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 03:17:09,356 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1262 transitions. [2024-10-11 03:17:09,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 03:17:09,356 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:09,357 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] [2024-10-11 03:17:09,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 03:17:09,357 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:09,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:09,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1355276720, now seen corresponding path program 1 times [2024-10-11 03:17:09,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:09,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888931388] [2024-10-11 03:17:09,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:09,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:09,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:09,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:09,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:09,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 03:17:09,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:09,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 03:17:09,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:09,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 03:17:09,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:09,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 03:17:09,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:09,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 03:17:09,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:09,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 03:17:09,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:09,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 03:17:09,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:09,861 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-11 03:17:09,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:09,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888931388] [2024-10-11 03:17:09,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888931388] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:09,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:09,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 03:17:09,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631141093] [2024-10-11 03:17:09,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:09,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:17:09,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:09,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:17:09,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:17:09,865 INFO L87 Difference]: Start difference. First operand 941 states and 1262 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 7 states have internal predecessors, (68), 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-11 03:17:10,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:10,326 INFO L93 Difference]: Finished difference Result 1827 states and 2434 transitions. [2024-10-11 03:17:10,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 03:17:10,327 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 7 states have internal predecessors, (68), 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 91 [2024-10-11 03:17:10,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:10,332 INFO L225 Difference]: With dead ends: 1827 [2024-10-11 03:17:10,332 INFO L226 Difference]: Without dead ends: 1040 [2024-10-11 03:17:10,334 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-11 03:17:10,335 INFO L432 NwaCegarLoop]: 249 mSDtfsCounter, 628 mSDsluCounter, 875 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 634 SdHoareTripleChecker+Valid, 1124 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:10,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [634 Valid, 1124 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 03:17:10,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1040 states. [2024-10-11 03:17:10,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1040 to 963. [2024-10-11 03:17:10,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 963 states, 734 states have (on average 1.337874659400545) internal successors, (982), 745 states have internal predecessors, (982), 146 states have call successors, (146), 82 states have call predecessors, (146), 82 states have return successors, (146), 135 states have call predecessors, (146), 146 states have call successors, (146) [2024-10-11 03:17:10,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1274 transitions. [2024-10-11 03:17:10,511 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1274 transitions. Word has length 91 [2024-10-11 03:17:10,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:10,512 INFO L471 AbstractCegarLoop]: Abstraction has 963 states and 1274 transitions. [2024-10-11 03:17:10,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 7 states have internal predecessors, (68), 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-11 03:17:10,512 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1274 transitions. [2024-10-11 03:17:10,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 03:17:10,513 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:10,513 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-11 03:17:10,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 03:17:10,513 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:10,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:10,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1092770635, now seen corresponding path program 1 times [2024-10-11 03:17:10,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:10,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655890559] [2024-10-11 03:17:10,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:10,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:10,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:10,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:10,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:10,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 03:17:10,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:10,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 03:17:10,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:10,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 03:17:10,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:10,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 03:17:10,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:10,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 03:17:10,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:10,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 03:17:10,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:10,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 03:17:10,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:10,614 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-11 03:17:10,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:10,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655890559] [2024-10-11 03:17:10,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655890559] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:10,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:10,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:17:10,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073705842] [2024-10-11 03:17:10,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:10,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:17:10,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:10,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:17:10,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:17:10,616 INFO L87 Difference]: Start difference. First operand 963 states and 1274 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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-11 03:17:10,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:10,846 INFO L93 Difference]: Finished difference Result 2533 states and 3370 transitions. [2024-10-11 03:17:10,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:17:10,847 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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 92 [2024-10-11 03:17:10,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:10,857 INFO L225 Difference]: With dead ends: 2533 [2024-10-11 03:17:10,857 INFO L226 Difference]: Without dead ends: 1802 [2024-10-11 03:17:10,860 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-11 03:17:10,860 INFO L432 NwaCegarLoop]: 418 mSDtfsCounter, 186 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 1051 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-11 03:17:10,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 1051 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:17:10,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2024-10-11 03:17:10,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1513. [2024-10-11 03:17:10,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1143 states have (on average 1.3377077865266842) internal successors, (1529), 1160 states have internal predecessors, (1529), 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-11 03:17:10,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2007 transitions. [2024-10-11 03:17:11,001 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 2007 transitions. Word has length 92 [2024-10-11 03:17:11,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:11,002 INFO L471 AbstractCegarLoop]: Abstraction has 1513 states and 2007 transitions. [2024-10-11 03:17:11,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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-11 03:17:11,002 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 2007 transitions. [2024-10-11 03:17:11,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 03:17:11,003 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:11,003 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-11 03:17:11,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 03:17:11,004 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:11,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:11,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1350470272, now seen corresponding path program 1 times [2024-10-11 03:17:11,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:11,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39974265] [2024-10-11 03:17:11,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:11,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:11,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:11,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:11,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:11,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 03:17:11,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:11,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 03:17:11,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:11,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 03:17:11,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:11,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 03:17:11,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:11,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 03:17:11,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:11,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 03:17:11,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:11,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 03:17:11,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:11,104 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-11 03:17:11,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:11,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39974265] [2024-10-11 03:17:11,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39974265] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:11,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:11,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:17:11,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258766749] [2024-10-11 03:17:11,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:11,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:17:11,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:11,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:17:11,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:17:11,110 INFO L87 Difference]: Start difference. First operand 1513 states and 2007 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-11 03:17:11,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:11,399 INFO L93 Difference]: Finished difference Result 3787 states and 5051 transitions. [2024-10-11 03:17:11,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:17:11,400 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-11 03:17:11,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:11,412 INFO L225 Difference]: With dead ends: 3787 [2024-10-11 03:17:11,413 INFO L226 Difference]: Without dead ends: 2571 [2024-10-11 03:17:11,417 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-11 03:17:11,418 INFO L432 NwaCegarLoop]: 434 mSDtfsCounter, 193 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 1089 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-11 03:17:11,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 1089 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:17:11,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2571 states. [2024-10-11 03:17:11,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2571 to 2392. [2024-10-11 03:17:11,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2392 states, 1785 states have (on average 1.3243697478991596) internal successors, (2364), 1812 states have internal predecessors, (2364), 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-11 03:17:11,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2392 states to 2392 states and 3152 transitions. [2024-10-11 03:17:11,643 INFO L78 Accepts]: Start accepts. Automaton has 2392 states and 3152 transitions. Word has length 94 [2024-10-11 03:17:11,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:11,644 INFO L471 AbstractCegarLoop]: Abstraction has 2392 states and 3152 transitions. [2024-10-11 03:17:11,644 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-11 03:17:11,644 INFO L276 IsEmpty]: Start isEmpty. Operand 2392 states and 3152 transitions. [2024-10-11 03:17:11,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 03:17:11,646 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:11,646 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-11 03:17:11,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 03:17:11,646 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:11,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:11,647 INFO L85 PathProgramCache]: Analyzing trace with hash -615930275, now seen corresponding path program 1 times [2024-10-11 03:17:11,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:11,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687023570] [2024-10-11 03:17:11,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:11,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:11,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:11,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:11,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:11,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 03:17:11,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:11,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 03:17:11,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:11,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 03:17:11,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:11,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 03:17:11,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:11,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 03:17:11,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:11,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 03:17:11,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:11,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 03:17:11,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:11,725 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-11 03:17:11,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:11,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687023570] [2024-10-11 03:17:11,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687023570] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:11,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:11,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:17:11,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120247522] [2024-10-11 03:17:11,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:11,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:17:11,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:11,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:17:11,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:17:11,727 INFO L87 Difference]: Start difference. First operand 2392 states and 3152 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-11 03:17:11,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:11,926 INFO L93 Difference]: Finished difference Result 4601 states and 6084 transitions. [2024-10-11 03:17:11,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:17:11,926 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-11 03:17:11,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:11,938 INFO L225 Difference]: With dead ends: 4601 [2024-10-11 03:17:11,938 INFO L226 Difference]: Without dead ends: 2401 [2024-10-11 03:17:11,943 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-11 03:17:11,944 INFO L432 NwaCegarLoop]: 236 mSDtfsCounter, 3 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 445 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-11 03:17:11,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 445 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:17:11,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2401 states. [2024-10-11 03:17:12,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2401 to 2395. [2024-10-11 03:17:12,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2395 states, 1788 states have (on average 1.3238255033557047) internal successors, (2367), 1815 states have internal predecessors, (2367), 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-11 03:17:12,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2395 states to 2395 states and 3155 transitions. [2024-10-11 03:17:12,268 INFO L78 Accepts]: Start accepts. Automaton has 2395 states and 3155 transitions. Word has length 94 [2024-10-11 03:17:12,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:12,269 INFO L471 AbstractCegarLoop]: Abstraction has 2395 states and 3155 transitions. [2024-10-11 03:17:12,273 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-11 03:17:12,273 INFO L276 IsEmpty]: Start isEmpty. Operand 2395 states and 3155 transitions. [2024-10-11 03:17:12,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 03:17:12,276 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:12,276 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-11 03:17:12,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 03:17:12,276 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:12,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:12,277 INFO L85 PathProgramCache]: Analyzing trace with hash -83516986, now seen corresponding path program 1 times [2024-10-11 03:17:12,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:12,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188689329] [2024-10-11 03:17:12,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:12,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:12,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:12,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:12,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:12,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 03:17:12,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:12,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 03:17:12,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:12,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 03:17:12,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:12,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 03:17:12,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:12,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 03:17:12,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:12,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 03:17:12,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:12,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 03:17:12,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:12,371 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-11 03:17:12,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:12,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188689329] [2024-10-11 03:17:12,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188689329] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:12,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:12,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:17:12,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138523282] [2024-10-11 03:17:12,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:12,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:17:12,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:12,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:17:12,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:17:12,373 INFO L87 Difference]: Start difference. First operand 2395 states and 3155 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-11 03:17:12,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:12,712 INFO L93 Difference]: Finished difference Result 5706 states and 7548 transitions. [2024-10-11 03:17:12,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:17:12,712 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-11 03:17:12,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:12,729 INFO L225 Difference]: With dead ends: 5706 [2024-10-11 03:17:12,729 INFO L226 Difference]: Without dead ends: 3725 [2024-10-11 03:17:12,734 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-11 03:17:12,735 INFO L432 NwaCegarLoop]: 444 mSDtfsCounter, 187 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 1101 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.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:12,735 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 1101 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:17:12,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3725 states. [2024-10-11 03:17:12,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3725 to 3300. [2024-10-11 03:17:12,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3300 states, 2454 states have (on average 1.3190709046454767) internal successors, (3237), 2491 states have internal predecessors, (3237), 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-11 03:17:12,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3300 states to 3300 states and 4339 transitions. [2024-10-11 03:17:13,003 INFO L78 Accepts]: Start accepts. Automaton has 3300 states and 4339 transitions. Word has length 94 [2024-10-11 03:17:13,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:13,004 INFO L471 AbstractCegarLoop]: Abstraction has 3300 states and 4339 transitions. [2024-10-11 03:17:13,005 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-11 03:17:13,005 INFO L276 IsEmpty]: Start isEmpty. Operand 3300 states and 4339 transitions. [2024-10-11 03:17:13,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-11 03:17:13,006 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:13,007 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-11 03:17:13,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 03:17:13,007 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:13,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:13,008 INFO L85 PathProgramCache]: Analyzing trace with hash -104683305, now seen corresponding path program 1 times [2024-10-11 03:17:13,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:13,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609728362] [2024-10-11 03:17:13,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:13,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:13,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:13,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:13,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:13,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 03:17:13,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:13,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 03:17:13,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:13,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 03:17:13,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:13,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 03:17:13,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:13,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 03:17:13,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:13,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 03:17:13,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:13,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 03:17:13,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:13,155 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-11 03:17:13,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:13,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609728362] [2024-10-11 03:17:13,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609728362] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:13,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:13,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:17:13,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317744447] [2024-10-11 03:17:13,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:13,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:17:13,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:13,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:17:13,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:17:13,157 INFO L87 Difference]: Start difference. First operand 3300 states and 4339 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-11 03:17:13,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:13,392 INFO L93 Difference]: Finished difference Result 6274 states and 8268 transitions. [2024-10-11 03:17:13,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:17:13,393 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-11 03:17:13,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:13,419 INFO L225 Difference]: With dead ends: 6274 [2024-10-11 03:17:13,419 INFO L226 Difference]: Without dead ends: 3036 [2024-10-11 03:17:13,433 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-11 03:17:13,433 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 69 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 690 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-11 03:17:13,434 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 690 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:17:13,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3036 states. [2024-10-11 03:17:13,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3036 to 2937. [2024-10-11 03:17:13,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2937 states, 2168 states have (on average 1.3228782287822878) internal successors, (2868), 2192 states have internal predecessors, (2868), 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-11 03:17:13,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2937 states to 2937 states and 3872 transitions. [2024-10-11 03:17:13,703 INFO L78 Accepts]: Start accepts. Automaton has 2937 states and 3872 transitions. Word has length 95 [2024-10-11 03:17:13,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:13,704 INFO L471 AbstractCegarLoop]: Abstraction has 2937 states and 3872 transitions. [2024-10-11 03:17:13,704 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-11 03:17:13,704 INFO L276 IsEmpty]: Start isEmpty. Operand 2937 states and 3872 transitions. [2024-10-11 03:17:13,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-11 03:17:13,705 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:13,705 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-11 03:17:13,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 03:17:13,706 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:13,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:13,706 INFO L85 PathProgramCache]: Analyzing trace with hash -58029957, now seen corresponding path program 1 times [2024-10-11 03:17:13,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:13,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311184539] [2024-10-11 03:17:13,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:13,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:13,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:13,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:13,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:13,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 03:17:13,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:13,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 03:17:13,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:13,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 03:17:13,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:13,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 03:17:13,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:13,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 03:17:13,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:13,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 03:17:13,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:13,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 03:17:13,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:13,758 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-11 03:17:13,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:13,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311184539] [2024-10-11 03:17:13,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311184539] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:13,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:13,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:17:13,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533010366] [2024-10-11 03:17:13,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:13,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:17:13,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:13,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:17:13,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:17:13,760 INFO L87 Difference]: Start difference. First operand 2937 states and 3872 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-11 03:17:14,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:14,018 INFO L93 Difference]: Finished difference Result 5733 states and 7587 transitions. [2024-10-11 03:17:14,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:17:14,019 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-11 03:17:14,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:14,034 INFO L225 Difference]: With dead ends: 5733 [2024-10-11 03:17:14,034 INFO L226 Difference]: Without dead ends: 2965 [2024-10-11 03:17:14,042 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-11 03:17:14,043 INFO L432 NwaCegarLoop]: 237 mSDtfsCounter, 4 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 443 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.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:14,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 443 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:17:14,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2965 states. [2024-10-11 03:17:14,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2965 to 2944. [2024-10-11 03:17:14,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2944 states, 2175 states have (on average 1.3218390804597702) internal successors, (2875), 2199 states have internal predecessors, (2875), 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-11 03:17:14,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2944 states to 2944 states and 3879 transitions. [2024-10-11 03:17:14,501 INFO L78 Accepts]: Start accepts. Automaton has 2944 states and 3879 transitions. Word has length 97 [2024-10-11 03:17:14,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:14,502 INFO L471 AbstractCegarLoop]: Abstraction has 2944 states and 3879 transitions. [2024-10-11 03:17:14,502 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-11 03:17:14,502 INFO L276 IsEmpty]: Start isEmpty. Operand 2944 states and 3879 transitions. [2024-10-11 03:17:14,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-11 03:17:14,504 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:14,504 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-11 03:17:14,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-11 03:17:14,505 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:14,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:14,505 INFO L85 PathProgramCache]: Analyzing trace with hash 963007751, now seen corresponding path program 1 times [2024-10-11 03:17:14,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:14,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467921512] [2024-10-11 03:17:14,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:14,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:14,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:14,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:14,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:14,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 03:17:14,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:14,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 03:17:14,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:14,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 03:17:14,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:14,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 03:17:14,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:14,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 03:17:14,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:14,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 03:17:14,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:14,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 03:17:14,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:14,639 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-11 03:17:14,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:14,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467921512] [2024-10-11 03:17:14,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467921512] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:14,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:14,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:17:14,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534213807] [2024-10-11 03:17:14,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:14,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:17:14,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:14,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:17:14,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:17:14,642 INFO L87 Difference]: Start difference. First operand 2944 states and 3879 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-11 03:17:14,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:14,965 INFO L93 Difference]: Finished difference Result 5696 states and 7526 transitions. [2024-10-11 03:17:14,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:17:14,965 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-11 03:17:14,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:14,977 INFO L225 Difference]: With dead ends: 5696 [2024-10-11 03:17:14,977 INFO L226 Difference]: Without dead ends: 2861 [2024-10-11 03:17:14,983 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-11 03:17:14,984 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 56 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 683 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-11 03:17:14,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 683 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:17:14,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2861 states. [2024-10-11 03:17:15,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2861 to 2706. [2024-10-11 03:17:15,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2706 states, 1996 states have (on average 1.3211422845691383) internal successors, (2637), 2015 states have internal predecessors, (2637), 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-11 03:17:15,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2706 states to 2706 states and 3565 transitions. [2024-10-11 03:17:15,247 INFO L78 Accepts]: Start accepts. Automaton has 2706 states and 3565 transitions. Word has length 97 [2024-10-11 03:17:15,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:15,248 INFO L471 AbstractCegarLoop]: Abstraction has 2706 states and 3565 transitions. [2024-10-11 03:17:15,248 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-11 03:17:15,248 INFO L276 IsEmpty]: Start isEmpty. Operand 2706 states and 3565 transitions. [2024-10-11 03:17:15,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-11 03:17:15,251 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:15,251 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] [2024-10-11 03:17:15,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-11 03:17:15,252 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:15,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:15,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1659213603, now seen corresponding path program 1 times [2024-10-11 03:17:15,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:15,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85327573] [2024-10-11 03:17:15,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:15,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:15,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:15,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:15,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:15,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:17:15,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:15,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 03:17:15,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:15,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 03:17:15,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:15,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 03:17:15,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:15,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 03:17:15,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:15,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 03:17:15,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:15,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 03:17:15,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:15,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 03:17:15,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:15,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 03:17:15,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:15,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 03:17:15,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:15,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 03:17:15,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:15,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 03:17:15,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:15,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 03:17:15,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:15,516 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-11 03:17:15,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:15,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85327573] [2024-10-11 03:17:15,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85327573] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:17:15,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175293236] [2024-10-11 03:17:15,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:15,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:17:15,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:17:15,519 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:17:15,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 03:17:15,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:15,681 INFO L255 TraceCheckSpWp]: Trace formula consists of 622 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-11 03:17:15,702 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:17:16,009 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-11 03:17:16,010 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:17:16,296 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-11 03:17:16,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [175293236] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:17:16,297 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:17:16,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 8] total 22 [2024-10-11 03:17:16,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273761354] [2024-10-11 03:17:16,298 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:17:16,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-11 03:17:16,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:16,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-11 03:17:16,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2024-10-11 03:17:16,300 INFO L87 Difference]: Start difference. First operand 2706 states and 3565 transitions. Second operand has 22 states, 22 states have (on average 10.045454545454545) internal successors, (221), 20 states have internal predecessors, (221), 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-11 03:17:20,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:20,563 INFO L93 Difference]: Finished difference Result 11191 states and 14670 transitions. [2024-10-11 03:17:20,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2024-10-11 03:17:20,564 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 10.045454545454545) internal successors, (221), 20 states have internal predecessors, (221), 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 140 [2024-10-11 03:17:20,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:20,595 INFO L225 Difference]: With dead ends: 11191 [2024-10-11 03:17:20,596 INFO L226 Difference]: Without dead ends: 8695 [2024-10-11 03:17:20,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1844 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1180, Invalid=5300, Unknown=0, NotChecked=0, Total=6480 [2024-10-11 03:17:20,604 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 3877 mSDsluCounter, 3099 mSDsCounter, 0 mSdLazyCounter, 1674 mSolverCounterSat, 1479 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3877 SdHoareTripleChecker+Valid, 3421 SdHoareTripleChecker+Invalid, 3153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1479 IncrementalHoareTripleChecker+Valid, 1674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:20,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3877 Valid, 3421 Invalid, 3153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1479 Valid, 1674 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-11 03:17:20,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8695 states. [2024-10-11 03:17:21,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8695 to 7251. [2024-10-11 03:17:21,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7251 states, 5334 states have (on average 1.3093363329583803) internal successors, (6984), 5386 states have internal predecessors, (6984), 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-11 03:17:21,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7251 states to 7251 states and 9462 transitions. [2024-10-11 03:17:21,615 INFO L78 Accepts]: Start accepts. Automaton has 7251 states and 9462 transitions. Word has length 140 [2024-10-11 03:17:21,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:21,616 INFO L471 AbstractCegarLoop]: Abstraction has 7251 states and 9462 transitions. [2024-10-11 03:17:21,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 10.045454545454545) internal successors, (221), 20 states have internal predecessors, (221), 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-11 03:17:21,617 INFO L276 IsEmpty]: Start isEmpty. Operand 7251 states and 9462 transitions. [2024-10-11 03:17:21,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-11 03:17:21,627 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:21,627 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] [2024-10-11 03:17:21,644 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 03:17:21,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-10-11 03:17:21,832 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:21,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:21,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1542223408, now seen corresponding path program 1 times [2024-10-11 03:17:21,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:21,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070505261] [2024-10-11 03:17:21,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:21,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:21,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:22,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:22,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:22,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 03:17:22,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:22,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 03:17:22,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:22,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 03:17:22,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:22,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 03:17:22,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:22,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 03:17:22,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:22,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 03:17:22,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:22,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 03:17:22,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:22,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 03:17:22,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:22,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 03:17:22,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:22,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 03:17:22,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:22,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 03:17:22,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:22,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 03:17:22,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:22,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 03:17:22,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:22,594 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-11 03:17:22,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:22,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070505261] [2024-10-11 03:17:22,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070505261] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:17:22,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1281844074] [2024-10-11 03:17:22,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:22,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:17:22,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:17:22,596 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:17:22,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 03:17:22,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:22,759 INFO L255 TraceCheckSpWp]: Trace formula consists of 656 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-11 03:17:22,766 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:17:23,109 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-11 03:17:23,111 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:17:23,360 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-11 03:17:23,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1281844074] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 03:17:23,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-11 03:17:23,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9, 11] total 25 [2024-10-11 03:17:23,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252254410] [2024-10-11 03:17:23,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:23,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 03:17:23,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:23,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 03:17:23,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2024-10-11 03:17:23,363 INFO L87 Difference]: Start difference. First operand 7251 states and 9462 transitions. Second operand has 9 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 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-11 03:17:24,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:24,268 INFO L93 Difference]: Finished difference Result 14099 states and 18443 transitions. [2024-10-11 03:17:24,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 03:17:24,269 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 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 143 [2024-10-11 03:17:24,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:24,298 INFO L225 Difference]: With dead ends: 14099 [2024-10-11 03:17:24,298 INFO L226 Difference]: Without dead ends: 7316 [2024-10-11 03:17:24,314 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=666, Unknown=0, NotChecked=0, Total=756 [2024-10-11 03:17:24,315 INFO L432 NwaCegarLoop]: 248 mSDtfsCounter, 448 mSDsluCounter, 1124 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 1372 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:24,315 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [452 Valid, 1372 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:17:24,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7316 states. [2024-10-11 03:17:24,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7316 to 5847. [2024-10-11 03:17:24,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5847 states, 4324 states have (on average 1.31313598519889) internal successors, (5678), 4362 states have internal predecessors, (5678), 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-11 03:17:24,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5847 states to 5847 states and 7640 transitions. [2024-10-11 03:17:24,950 INFO L78 Accepts]: Start accepts. Automaton has 5847 states and 7640 transitions. Word has length 143 [2024-10-11 03:17:24,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:24,952 INFO L471 AbstractCegarLoop]: Abstraction has 5847 states and 7640 transitions. [2024-10-11 03:17:24,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 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-11 03:17:24,952 INFO L276 IsEmpty]: Start isEmpty. Operand 5847 states and 7640 transitions. [2024-10-11 03:17:24,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-11 03:17:24,960 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:24,960 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] [2024-10-11 03:17:24,979 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 03:17:25,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-10-11 03:17:25,165 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:25,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:25,166 INFO L85 PathProgramCache]: Analyzing trace with hash 290012325, now seen corresponding path program 1 times [2024-10-11 03:17:25,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:25,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104243229] [2024-10-11 03:17:25,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:25,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:25,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:26,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:26,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:26,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 03:17:26,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:26,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 03:17:26,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:26,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 03:17:26,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:26,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 03:17:26,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:26,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 03:17:26,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:26,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 03:17:26,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:26,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 03:17:26,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:26,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-11 03:17:26,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:26,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 03:17:26,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:26,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 03:17:26,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:26,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 03:17:26,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:26,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 03:17:26,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:26,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-11 03:17:26,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:26,169 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 20 proven. 3 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-11 03:17:26,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:26,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104243229] [2024-10-11 03:17:26,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104243229] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:17:26,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819319085] [2024-10-11 03:17:26,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:26,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:17:26,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:17:26,171 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:17:26,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 03:17:26,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:26,318 INFO L255 TraceCheckSpWp]: Trace formula consists of 673 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-11 03:17:26,323 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:17:26,583 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-11 03:17:26,583 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:17:26,885 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-11 03:17:26,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1819319085] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:17:26,885 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:17:26,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 9] total 26 [2024-10-11 03:17:26,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394084337] [2024-10-11 03:17:26,886 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:17:26,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-11 03:17:26,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:26,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-11 03:17:26,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=583, Unknown=0, NotChecked=0, Total=650 [2024-10-11 03:17:26,889 INFO L87 Difference]: Start difference. First operand 5847 states and 7640 transitions. Second operand has 26 states, 26 states have (on average 9.653846153846153) internal successors, (251), 24 states have internal predecessors, (251), 10 states have call successors, (41), 5 states have call predecessors, (41), 8 states have return successors, (40), 12 states have call predecessors, (40), 10 states have call successors, (40) [2024-10-11 03:17:32,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:32,368 INFO L93 Difference]: Finished difference Result 13620 states and 17871 transitions. [2024-10-11 03:17:32,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-10-11 03:17:32,369 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 9.653846153846153) internal successors, (251), 24 states have internal predecessors, (251), 10 states have call successors, (41), 5 states have call predecessors, (41), 8 states have return successors, (40), 12 states have call predecessors, (40), 10 states have call successors, (40) Word has length 144 [2024-10-11 03:17:32,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:32,399 INFO L225 Difference]: With dead ends: 13620 [2024-10-11 03:17:32,399 INFO L226 Difference]: Without dead ends: 8013 [2024-10-11 03:17:32,413 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1222 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=989, Invalid=4561, Unknown=0, NotChecked=0, Total=5550 [2024-10-11 03:17:32,413 INFO L432 NwaCegarLoop]: 694 mSDtfsCounter, 1929 mSDsluCounter, 8705 mSDsCounter, 0 mSdLazyCounter, 4192 mSolverCounterSat, 640 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1929 SdHoareTripleChecker+Valid, 9399 SdHoareTripleChecker+Invalid, 4832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 640 IncrementalHoareTripleChecker+Valid, 4192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:32,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1929 Valid, 9399 Invalid, 4832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [640 Valid, 4192 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-11 03:17:32,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8013 states. [2024-10-11 03:17:33,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8013 to 5898. [2024-10-11 03:17:33,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5898 states, 4369 states have (on average 1.308766308079652) internal successors, (5718), 4407 states have internal predecessors, (5718), 986 states have call successors, (986), 542 states have call predecessors, (986), 542 states have return successors, (986), 948 states have call predecessors, (986), 986 states have call successors, (986) [2024-10-11 03:17:33,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5898 states to 5898 states and 7690 transitions. [2024-10-11 03:17:33,300 INFO L78 Accepts]: Start accepts. Automaton has 5898 states and 7690 transitions. Word has length 144 [2024-10-11 03:17:33,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:33,301 INFO L471 AbstractCegarLoop]: Abstraction has 5898 states and 7690 transitions. [2024-10-11 03:17:33,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 9.653846153846153) internal successors, (251), 24 states have internal predecessors, (251), 10 states have call successors, (41), 5 states have call predecessors, (41), 8 states have return successors, (40), 12 states have call predecessors, (40), 10 states have call successors, (40) [2024-10-11 03:17:33,302 INFO L276 IsEmpty]: Start isEmpty. Operand 5898 states and 7690 transitions. [2024-10-11 03:17:33,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-11 03:17:33,310 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:33,310 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 03:17:33,324 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 03:17:33,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:17:33,515 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:33,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:33,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1804780543, now seen corresponding path program 1 times [2024-10-11 03:17:33,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:33,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496956125] [2024-10-11 03:17:33,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:33,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:33,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:33,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:33,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:33,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 03:17:33,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:33,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 03:17:33,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:33,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 03:17:33,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:33,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 03:17:33,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:33,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 03:17:33,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:33,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 03:17:33,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:33,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 03:17:33,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:33,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 03:17:33,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:33,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 03:17:33,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:33,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 03:17:33,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:33,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 03:17:33,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:33,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 03:17:33,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:33,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-11 03:17:33,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:33,738 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2024-10-11 03:17:33,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:33,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496956125] [2024-10-11 03:17:33,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496956125] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:17:33,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:17:33,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:17:33,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263432466] [2024-10-11 03:17:33,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:17:33,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:17:33,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:33,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:17:33,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:17:33,740 INFO L87 Difference]: Start difference. First operand 5898 states and 7690 transitions. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 6 states have internal predecessors, (86), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 03:17:35,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:35,138 INFO L93 Difference]: Finished difference Result 17276 states and 22590 transitions. [2024-10-11 03:17:35,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 03:17:35,140 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 6 states have internal predecessors, (86), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 144 [2024-10-11 03:17:35,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:35,175 INFO L225 Difference]: With dead ends: 17276 [2024-10-11 03:17:35,175 INFO L226 Difference]: Without dead ends: 11696 [2024-10-11 03:17:35,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 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-11 03:17:35,188 INFO L432 NwaCegarLoop]: 418 mSDtfsCounter, 211 mSDsluCounter, 1816 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 2234 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:35,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 2234 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:17:35,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11696 states. [2024-10-11 03:17:36,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11696 to 7565. [2024-10-11 03:17:36,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7565 states, 5568 states have (on average 1.3062140804597702) internal successors, (7273), 5618 states have internal predecessors, (7273), 1300 states have call successors, (1300), 696 states have call predecessors, (1300), 696 states have return successors, (1300), 1250 states have call predecessors, (1300), 1300 states have call successors, (1300) [2024-10-11 03:17:36,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7565 states to 7565 states and 9873 transitions. [2024-10-11 03:17:36,098 INFO L78 Accepts]: Start accepts. Automaton has 7565 states and 9873 transitions. Word has length 144 [2024-10-11 03:17:36,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:36,099 INFO L471 AbstractCegarLoop]: Abstraction has 7565 states and 9873 transitions. [2024-10-11 03:17:36,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 6 states have internal predecessors, (86), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 03:17:36,099 INFO L276 IsEmpty]: Start isEmpty. Operand 7565 states and 9873 transitions. [2024-10-11 03:17:36,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-11 03:17:36,124 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:36,124 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 03:17:36,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-11 03:17:36,125 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:36,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:36,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1367347971, now seen corresponding path program 1 times [2024-10-11 03:17:36,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:36,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262835447] [2024-10-11 03:17:36,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:36,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:36,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:36,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:36,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:36,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 03:17:36,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:36,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 03:17:36,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:36,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 03:17:36,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:36,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 03:17:36,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:36,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 03:17:36,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:36,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 03:17:36,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:36,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 03:17:36,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:36,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 03:17:36,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:36,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 03:17:36,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:36,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 03:17:36,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:36,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 03:17:36,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:36,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-11 03:17:36,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:36,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 03:17:36,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:36,448 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 14 proven. 23 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-10-11 03:17:36,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:36,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262835447] [2024-10-11 03:17:36,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262835447] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:17:36,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600427581] [2024-10-11 03:17:36,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:36,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:17:36,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:17:36,451 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:17:36,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 03:17:36,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:36,594 INFO L255 TraceCheckSpWp]: Trace formula consists of 644 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 03:17:36,599 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:17:36,744 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 8 proven. 82 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 03:17:36,744 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:17:36,873 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 14 proven. 23 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-10-11 03:17:36,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1600427581] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:17:36,873 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:17:36,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 10 [2024-10-11 03:17:36,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692972899] [2024-10-11 03:17:36,874 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:17:36,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 03:17:36,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:36,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 03:17:36,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-11 03:17:36,875 INFO L87 Difference]: Start difference. First operand 7565 states and 9873 transitions. Second operand has 10 states, 10 states have (on average 13.1) internal successors, (131), 9 states have internal predecessors, (131), 4 states have call successors, (30), 5 states have call predecessors, (30), 7 states have return successors, (29), 4 states have call predecessors, (29), 3 states have call successors, (29) [2024-10-11 03:17:38,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:38,398 INFO L93 Difference]: Finished difference Result 20410 states and 26460 transitions. [2024-10-11 03:17:38,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 03:17:38,399 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 13.1) internal successors, (131), 9 states have internal predecessors, (131), 4 states have call successors, (30), 5 states have call predecessors, (30), 7 states have return successors, (29), 4 states have call predecessors, (29), 3 states have call successors, (29) Word has length 147 [2024-10-11 03:17:38,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:38,457 INFO L225 Difference]: With dead ends: 20410 [2024-10-11 03:17:38,457 INFO L226 Difference]: Without dead ends: 13163 [2024-10-11 03:17:38,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 318 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-10-11 03:17:38,565 INFO L432 NwaCegarLoop]: 237 mSDtfsCounter, 336 mSDsluCounter, 1545 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 1782 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:38,566 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 1782 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:17:38,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13163 states. [2024-10-11 03:17:40,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13163 to 11416. [2024-10-11 03:17:40,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11416 states, 8443 states have (on average 1.2925500414544593) internal successors, (10913), 8539 states have internal predecessors, (10913), 1913 states have call successors, (1913), 1059 states have call predecessors, (1913), 1059 states have return successors, (1913), 1817 states have call predecessors, (1913), 1913 states have call successors, (1913) [2024-10-11 03:17:40,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11416 states to 11416 states and 14739 transitions. [2024-10-11 03:17:40,609 INFO L78 Accepts]: Start accepts. Automaton has 11416 states and 14739 transitions. Word has length 147 [2024-10-11 03:17:40,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:40,610 INFO L471 AbstractCegarLoop]: Abstraction has 11416 states and 14739 transitions. [2024-10-11 03:17:40,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.1) internal successors, (131), 9 states have internal predecessors, (131), 4 states have call successors, (30), 5 states have call predecessors, (30), 7 states have return successors, (29), 4 states have call predecessors, (29), 3 states have call successors, (29) [2024-10-11 03:17:40,610 INFO L276 IsEmpty]: Start isEmpty. Operand 11416 states and 14739 transitions. [2024-10-11 03:17:40,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-11 03:17:40,628 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:40,629 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 03:17:40,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 03:17:40,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2024-10-11 03:17:40,830 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:40,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:40,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1549728730, now seen corresponding path program 1 times [2024-10-11 03:17:40,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:40,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862824891] [2024-10-11 03:17:40,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:40,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:40,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:41,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:41,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:41,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 03:17:41,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:41,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 03:17:41,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:41,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 03:17:41,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:41,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 03:17:41,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:41,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 03:17:41,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:41,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 03:17:41,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:41,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 03:17:41,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:41,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 03:17:41,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:41,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 03:17:41,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:41,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 03:17:41,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:41,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 03:17:41,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:41,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 03:17:41,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:41,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 03:17:41,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:41,253 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-11 03:17:41,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:41,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862824891] [2024-10-11 03:17:41,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862824891] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:17:41,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1323071694] [2024-10-11 03:17:41,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:41,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:17:41,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:17:41,255 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:17:41,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 03:17:41,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:41,425 INFO L255 TraceCheckSpWp]: Trace formula consists of 661 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-11 03:17:41,429 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:17:41,798 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 52 proven. 18 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-11 03:17:41,798 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:17:42,158 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-11 03:17:42,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1323071694] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:17:42,158 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:17:42,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 9] total 22 [2024-10-11 03:17:42,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065513929] [2024-10-11 03:17:42,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:17:42,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-11 03:17:42,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:42,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-11 03:17:42,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2024-10-11 03:17:42,160 INFO L87 Difference]: Start difference. First operand 11416 states and 14739 transitions. Second operand has 22 states, 22 states have (on average 10.409090909090908) internal successors, (229), 22 states have internal predecessors, (229), 9 states have call successors, (38), 5 states have call predecessors, (38), 6 states have return successors, (37), 9 states have call predecessors, (37), 9 states have call successors, (37) [2024-10-11 03:17:49,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:49,210 INFO L93 Difference]: Finished difference Result 33464 states and 43318 transitions. [2024-10-11 03:17:49,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2024-10-11 03:17:49,211 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 10.409090909090908) internal successors, (229), 22 states have internal predecessors, (229), 9 states have call successors, (38), 5 states have call predecessors, (38), 6 states have return successors, (37), 9 states have call predecessors, (37), 9 states have call successors, (37) Word has length 146 [2024-10-11 03:17:49,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:49,320 INFO L225 Difference]: With dead ends: 33464 [2024-10-11 03:17:49,321 INFO L226 Difference]: Without dead ends: 22941 [2024-10-11 03:17:49,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 337 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3803 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1617, Invalid=9513, Unknown=0, NotChecked=0, Total=11130 [2024-10-11 03:17:49,346 INFO L432 NwaCegarLoop]: 563 mSDtfsCounter, 4930 mSDsluCounter, 4931 mSDsCounter, 0 mSdLazyCounter, 3155 mSolverCounterSat, 1575 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4930 SdHoareTripleChecker+Valid, 5494 SdHoareTripleChecker+Invalid, 4730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1575 IncrementalHoareTripleChecker+Valid, 3155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:49,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4930 Valid, 5494 Invalid, 4730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1575 Valid, 3155 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-11 03:17:49,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22941 states. [2024-10-11 03:17:52,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22941 to 20582. [2024-10-11 03:17:52,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20582 states, 15341 states have (on average 1.2795776025030963) internal successors, (19630), 15506 states have internal predecessors, (19630), 3336 states have call successors, (3336), 1904 states have call predecessors, (3336), 1904 states have return successors, (3336), 3171 states have call predecessors, (3336), 3336 states have call successors, (3336) [2024-10-11 03:17:52,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20582 states to 20582 states and 26302 transitions. [2024-10-11 03:17:52,263 INFO L78 Accepts]: Start accepts. Automaton has 20582 states and 26302 transitions. Word has length 146 [2024-10-11 03:17:52,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:17:52,264 INFO L471 AbstractCegarLoop]: Abstraction has 20582 states and 26302 transitions. [2024-10-11 03:17:52,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 10.409090909090908) internal successors, (229), 22 states have internal predecessors, (229), 9 states have call successors, (38), 5 states have call predecessors, (38), 6 states have return successors, (37), 9 states have call predecessors, (37), 9 states have call successors, (37) [2024-10-11 03:17:52,264 INFO L276 IsEmpty]: Start isEmpty. Operand 20582 states and 26302 transitions. [2024-10-11 03:17:52,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-11 03:17:52,280 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:17:52,280 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 03:17:52,302 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 03:17:52,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2024-10-11 03:17:52,481 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:17:52,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:17:52,482 INFO L85 PathProgramCache]: Analyzing trace with hash 588779313, now seen corresponding path program 1 times [2024-10-11 03:17:52,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:17:52,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866696692] [2024-10-11 03:17:52,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:52,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:17:52,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:52,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:17:52,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:52,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 03:17:52,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:52,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 03:17:52,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:52,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 03:17:52,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:52,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 03:17:52,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:52,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 03:17:52,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:52,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 03:17:52,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:52,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 03:17:52,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:52,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 03:17:52,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:52,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 03:17:52,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:52,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 03:17:52,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:52,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 03:17:52,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:52,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 03:17:52,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:52,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 03:17:52,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:52,987 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-11 03:17:52,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:17:52,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866696692] [2024-10-11 03:17:52,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866696692] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:17:52,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899776464] [2024-10-11 03:17:52,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:17:52,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:17:52,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:17:52,990 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:17:52,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 03:17:53,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:17:53,145 INFO L255 TraceCheckSpWp]: Trace formula consists of 659 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 03:17:53,148 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:17:53,231 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 42 proven. 4 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-11 03:17:53,231 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:17:53,308 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2024-10-11 03:17:53,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899776464] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:17:53,308 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:17:53,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 15 [2024-10-11 03:17:53,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674782002] [2024-10-11 03:17:53,308 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:17:53,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 03:17:53,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:17:53,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 03:17:53,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-10-11 03:17:53,310 INFO L87 Difference]: Start difference. First operand 20582 states and 26302 transitions. Second operand has 15 states, 14 states have (on average 11.714285714285714) internal successors, (164), 12 states have internal predecessors, (164), 5 states have call successors, (32), 4 states have call predecessors, (32), 8 states have return successors, (32), 7 states have call predecessors, (32), 5 states have call successors, (32) [2024-10-11 03:17:58,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:17:58,556 INFO L93 Difference]: Finished difference Result 50259 states and 63508 transitions. [2024-10-11 03:17:58,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-11 03:17:58,557 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 11.714285714285714) internal successors, (164), 12 states have internal predecessors, (164), 5 states have call successors, (32), 4 states have call predecessors, (32), 8 states have return successors, (32), 7 states have call predecessors, (32), 5 states have call successors, (32) Word has length 146 [2024-10-11 03:17:58,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:17:58,670 INFO L225 Difference]: With dead ends: 50259 [2024-10-11 03:17:58,671 INFO L226 Difference]: Without dead ends: 29906 [2024-10-11 03:17:58,711 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=694, Unknown=0, NotChecked=0, Total=812 [2024-10-11 03:17:58,712 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 319 mSDsluCounter, 2365 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 2615 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:17:58,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 2615 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 03:17:58,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29906 states. [2024-10-11 03:18:02,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29906 to 20335. [2024-10-11 03:18:02,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20335 states, 15198 states have (on average 1.2677325963942625) internal successors, (19267), 15363 states have internal predecessors, (19267), 3189 states have call successors, (3189), 1947 states have call predecessors, (3189), 1947 states have return successors, (3189), 3024 states have call predecessors, (3189), 3189 states have call successors, (3189) [2024-10-11 03:18:02,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20335 states to 20335 states and 25645 transitions. [2024-10-11 03:18:02,407 INFO L78 Accepts]: Start accepts. Automaton has 20335 states and 25645 transitions. Word has length 146 [2024-10-11 03:18:02,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:18:02,407 INFO L471 AbstractCegarLoop]: Abstraction has 20335 states and 25645 transitions. [2024-10-11 03:18:02,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 11.714285714285714) internal successors, (164), 12 states have internal predecessors, (164), 5 states have call successors, (32), 4 states have call predecessors, (32), 8 states have return successors, (32), 7 states have call predecessors, (32), 5 states have call successors, (32) [2024-10-11 03:18:02,407 INFO L276 IsEmpty]: Start isEmpty. Operand 20335 states and 25645 transitions. [2024-10-11 03:18:02,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 03:18:02,419 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:18:02,420 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 1, 1, 1] [2024-10-11 03:18:02,434 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 03:18:02,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2024-10-11 03:18:02,621 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:18:02,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:18:02,621 INFO L85 PathProgramCache]: Analyzing trace with hash -899207503, now seen corresponding path program 1 times [2024-10-11 03:18:02,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:18:02,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799836351] [2024-10-11 03:18:02,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:18:02,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:18:02,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:03,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:18:03,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:03,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 03:18:03,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:03,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 03:18:03,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:03,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 03:18:03,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:03,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 03:18:03,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:03,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 03:18:03,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:03,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 03:18:03,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:03,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 03:18:03,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:03,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 03:18:03,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:03,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 03:18:03,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:03,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 03:18:03,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:03,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-11 03:18:03,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:03,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 03:18:03,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:03,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 03:18:03,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:03,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 03:18:03,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:03,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 03:18:03,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:03,271 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 22 proven. 2 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-10-11 03:18:03,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:18:03,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799836351] [2024-10-11 03:18:03,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799836351] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:18:03,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183636619] [2024-10-11 03:18:03,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:18:03,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:18:03,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:18:03,274 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:18:03,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 03:18:03,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:03,425 INFO L255 TraceCheckSpWp]: Trace formula consists of 696 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-10-11 03:18:03,428 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:18:04,021 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 75 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-11 03:18:04,022 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:18:04,713 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 13 proven. 11 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-10-11 03:18:04,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [183636619] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:18:04,713 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:18:04,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 13] total 29 [2024-10-11 03:18:04,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097676481] [2024-10-11 03:18:04,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:18:04,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-11 03:18:04,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:18:04,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-11 03:18:04,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=676, Unknown=0, NotChecked=0, Total=812 [2024-10-11 03:18:04,715 INFO L87 Difference]: Start difference. First operand 20335 states and 25645 transitions. Second operand has 29 states, 29 states have (on average 8.03448275862069) internal successors, (233), 29 states have internal predecessors, (233), 10 states have call successors, (44), 5 states have call predecessors, (44), 6 states have return successors, (43), 10 states have call predecessors, (43), 10 states have call successors, (43) [2024-10-11 03:18:15,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:18:15,119 INFO L93 Difference]: Finished difference Result 39745 states and 50300 transitions. [2024-10-11 03:18:15,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-10-11 03:18:15,119 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 8.03448275862069) internal successors, (233), 29 states have internal predecessors, (233), 10 states have call successors, (44), 5 states have call predecessors, (44), 6 states have return successors, (43), 10 states have call predecessors, (43), 10 states have call successors, (43) Word has length 162 [2024-10-11 03:18:15,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:18:15,202 INFO L225 Difference]: With dead ends: 39745 [2024-10-11 03:18:15,202 INFO L226 Difference]: Without dead ends: 22009 [2024-10-11 03:18:15,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 359 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3588 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=2007, Invalid=8295, Unknown=0, NotChecked=0, Total=10302 [2024-10-11 03:18:15,238 INFO L432 NwaCegarLoop]: 444 mSDtfsCounter, 3731 mSDsluCounter, 3008 mSDsCounter, 0 mSdLazyCounter, 2144 mSolverCounterSat, 1342 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3731 SdHoareTripleChecker+Valid, 3452 SdHoareTripleChecker+Invalid, 3486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1342 IncrementalHoareTripleChecker+Valid, 2144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-11 03:18:15,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3731 Valid, 3452 Invalid, 3486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1342 Valid, 2144 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-11 03:18:15,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22009 states. [2024-10-11 03:18:19,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22009 to 21674. [2024-10-11 03:18:19,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21674 states, 16239 states have (on average 1.2680583779789396) internal successors, (20592), 16393 states have internal predecessors, (20592), 3339 states have call successors, (3339), 2095 states have call predecessors, (3339), 2095 states have return successors, (3339), 3185 states have call predecessors, (3339), 3339 states have call successors, (3339) [2024-10-11 03:18:19,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21674 states to 21674 states and 27270 transitions. [2024-10-11 03:18:20,000 INFO L78 Accepts]: Start accepts. Automaton has 21674 states and 27270 transitions. Word has length 162 [2024-10-11 03:18:20,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:18:20,001 INFO L471 AbstractCegarLoop]: Abstraction has 21674 states and 27270 transitions. [2024-10-11 03:18:20,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 8.03448275862069) internal successors, (233), 29 states have internal predecessors, (233), 10 states have call successors, (44), 5 states have call predecessors, (44), 6 states have return successors, (43), 10 states have call predecessors, (43), 10 states have call successors, (43) [2024-10-11 03:18:20,001 INFO L276 IsEmpty]: Start isEmpty. Operand 21674 states and 27270 transitions. [2024-10-11 03:18:20,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-11 03:18:20,012 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:18:20,012 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 03:18:20,030 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-11 03:18:20,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:18:20,216 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:18:20,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:18:20,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1290593666, now seen corresponding path program 1 times [2024-10-11 03:18:20,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:18:20,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139932749] [2024-10-11 03:18:20,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:18:20,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:18:20,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:20,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:18:20,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:20,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 03:18:20,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:20,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 03:18:20,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:20,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 03:18:20,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:20,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 03:18:20,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:20,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 03:18:20,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:20,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 03:18:20,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:20,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 03:18:20,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:20,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 03:18:20,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:20,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 03:18:20,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:20,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 03:18:20,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:20,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 03:18:20,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:20,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-11 03:18:20,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:20,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 03:18:20,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:20,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 03:18:20,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:20,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 03:18:20,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:20,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 03:18:20,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:18:20,500 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-10-11 03:18:20,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:18:20,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139932749] [2024-10-11 03:18:20,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139932749] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:18:20,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:18:20,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:18:20,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708233599] [2024-10-11 03:18:20,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:18:20,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:18:20,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:18:20,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:18:20,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:18:20,502 INFO L87 Difference]: Start difference. First operand 21674 states and 27270 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, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16)